Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 11K Apr 30 02:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 02:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 02:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 02:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 203K May 10 09:34 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 IBM703-PT-none-LTLFireability-00
FORMULA_NAME IBM703-PT-none-LTLFireability-01
FORMULA_NAME IBM703-PT-none-LTLFireability-02
FORMULA_NAME IBM703-PT-none-LTLFireability-03
FORMULA_NAME IBM703-PT-none-LTLFireability-04
FORMULA_NAME IBM703-PT-none-LTLFireability-05
FORMULA_NAME IBM703-PT-none-LTLFireability-06
FORMULA_NAME IBM703-PT-none-LTLFireability-07
FORMULA_NAME IBM703-PT-none-LTLFireability-08
FORMULA_NAME IBM703-PT-none-LTLFireability-09
FORMULA_NAME IBM703-PT-none-LTLFireability-10
FORMULA_NAME IBM703-PT-none-LTLFireability-11
FORMULA_NAME IBM703-PT-none-LTLFireability-12
FORMULA_NAME IBM703-PT-none-LTLFireability-13
FORMULA_NAME IBM703-PT-none-LTLFireability-14
FORMULA_NAME IBM703-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652745265679

Running Version 202205111006
[2022-05-16 23:54:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 23:54:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:54:27] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2022-05-16 23:54:27] [INFO ] Transformed 262 places.
[2022-05-16 23:54:27] [INFO ] Transformed 284 transitions.
[2022-05-16 23:54:27] [INFO ] Found NUPN structural information;
[2022-05-16 23:54:27] [INFO ] Completing missing partition info from NUPN : creating a component with [merge_s00000450_activated, merge_s00000462_activated, merge_s00000319_activated, merge_s00000446_activated, merge_s00000449_activated, task_s00000720_input_s00000263, task_s00000721_input_s00000263, task_s00000704_input_s00000263, task_s00000714_input_s00000263, task_s00000724_input_s00000263, fork_s00000464_input_s00000263, task_s00000716_input_s00000263, task_s00000762_input_s00000263, task_s00000726_input_s00000263, task_s00000754_input_s00000263, task_s00000727_input_s00000263, task_s00000746_input_s00000263, task_s00000756_input_s00000263, task_s00000757_input_s00000263, merge_s00000320_input_s00000263, merge_s00000453_input_s00000290, merge_s00000319_input_s00000290, merge_s00000455_input_s00000290, merge_s00000446_input_s00000290, merge_s00000456_input_s00000263, merge_s00000458_input_s00000263, merge_s00000457_input_s00000285, task_s00000710_output_s00000264, task_s00000730_output_s00000264, task_s00000740_output_s00000264, task_s00000704_output_s00000264, task_s00000732_output_s00000264, task_s00000714_output_s00000264, task_s00000733_output_s00000264, task_s00000724_output_s00000264, task_s00000752_output_s00000264, task_s00000716_output_s00000264, task_s00000707_output_s00000264, task_s00000744_output_s00000264, task_s00000708_output_s00000264, task_s00000736_output_s00000264, task_s00000727_output_s00000264, task_s00000755_output_s00000264, task_s00000728_output_s00000264, task_s00000738_output_s00000264, task_s00000739_output_s00000264, task_s00000749_output_s00000264, decision_s00000801_activated, decision_s00000804_activated, decision_s00000772_activated, decision_s00000792_activated, decision_s00000793_activated, decision_s00000776_activated, decision_s00000796_activated, decision_s00000788_activated, fork_s00000463_activated_s00000272, fork_s00000464_activated_s00000272, fork_s00000466_activated_s00000272, fork_s00000466_activated_s00000274, decision_s00000773_input_s00000263, decision_s00000793_input_s00000263, decision_s00000775_input_s00000263, decision_s00000787_input_s00000263, process_s00000030__s00000703_input_s00000263, callToProcess_s00000807_output_s00000264, callToProcess_s00000808_output_s00000264, task_s00000710_inputCriterion_s00000257_used, task_s00000711_inputCriterion_s00000257_used, task_s00000721_inputCriterion_s00000257_used, task_s00000740_inputCriterion_s00000257_used, task_s00000722_inputCriterion_s00000257_used, task_s00000741_inputCriterion_s00000257_used, task_s00000732_inputCriterion_s00000257_used, task_s00000714_inputCriterion_s00000257_used, task_s00000760_inputCriterion_s00000257_used, task_s00000733_inputCriterion_s00000257_used, task_s00000724_inputCriterion_s00000257_used, task_s00000706_inputCriterion_s00000257_used, task_s00000752_inputCriterion_s00000257_used, task_s00000725_inputCriterion_s00000257_used, task_s00000707_inputCriterion_s00000257_used, task_s00000753_inputCriterion_s00000257_used, task_s00000735_inputCriterion_s00000257_used, task_s00000726_inputCriterion_s00000257_used, task_s00000708_inputCriterion_s00000257_used, task_s00000745_inputCriterion_s00000257_used, task_s00000736_inputCriterion_s00000257_used, task_s00000718_inputCriterion_s00000257_used, task_s00000755_inputCriterion_s00000257_used, task_s00000737_inputCriterion_s00000257_used, task_s00000719_inputCriterion_s00000257_used, task_s00000738_inputCriterion_s00000257_used, task_s00000757_inputCriterion_s00000257_used, task_s00000748_inputCriterion_s00000257_used, task_s00000758_inputCriterion_s00000257_used, callToProcess_s00000807_inputCriterion_s00000257_used, callToProcess_s00000808_inputCriterion_s00000257_used]
[2022-05-16 23:54:27] [INFO ] Parsed PT model containing 262 places and 284 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA IBM703-PT-none-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 284
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 31 place count 231 transition count 259
Iterating global reduction 1 with 25 rules applied. Total rules applied 56 place count 231 transition count 259
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 223 transition count 251
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 223 transition count 251
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 218 transition count 246
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 218 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 218 transition count 245
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 216 transition count 243
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 216 transition count 243
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 214 transition count 241
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 214 transition count 241
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 212 transition count 239
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 212 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 211 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 211 transition count 238
Applied a total of 97 rules in 82 ms. Remains 211 /262 variables (removed 51) and now considering 238/284 (removed 46) transitions.
// Phase 1: matrix 238 rows 211 cols
[2022-05-16 23:54:27] [INFO ] Computed 0 place invariants in 17 ms
[2022-05-16 23:54:27] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 238 rows 211 cols
[2022-05-16 23:54:27] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:27] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 211 cols
[2022-05-16 23:54:27] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:27] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/262 places, 238/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/262 places, 238/284 transitions.
Support contains 37 out of 211 places after structural reductions.
[2022-05-16 23:54:27] [INFO ] Flatten gal took : 38 ms
[2022-05-16 23:54:27] [INFO ] Flatten gal took : 16 ms
[2022-05-16 23:54:27] [INFO ] Input system was already deterministic with 238 transitions.
Support contains 36 out of 211 places (down from 37) after GAL structural reductions.
Finished random walk after 7644 steps, including 132 resets, run visited all 38 properties in 220 ms. (steps per millisecond=34 )
Computed a total of 211 stabilizing places and 238 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 211 transition count 238
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&p1))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 190 transition count 217
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 190 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 190 transition count 216
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 184 transition count 210
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 184 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 184 transition count 209
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 179 transition count 204
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 179 transition count 204
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 175 transition count 200
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 175 transition count 200
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 171 transition count 196
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 171 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 171 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 169 transition count 193
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 169 transition count 193
Applied a total of 87 rules in 29 ms. Remains 169 /211 variables (removed 42) and now considering 193/238 (removed 45) transitions.
// Phase 1: matrix 193 rows 169 cols
[2022-05-16 23:54:28] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:28] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 193 rows 169 cols
[2022-05-16 23:54:28] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:29] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 169 cols
[2022-05-16 23:54:29] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:29] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/211 places, 193/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/211 places, 193/238 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p0:(EQ s0 0), p1:(EQ s69 0)], 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 33333 reset in 265 ms.
Product exploration explored 100000 steps with 33333 reset in 160 ms.
Computed a total of 169 stabilizing places and 193 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 169 transition count 193
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p0)))))
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM703-PT-none-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-00 finished in 1451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 189 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 189 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 189 transition count 215
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 183 transition count 209
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 183 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 183 transition count 208
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 179 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 179 transition count 204
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 175 transition count 200
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 175 transition count 200
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 171 transition count 196
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 171 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 171 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 169 transition count 193
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 169 transition count 193
Applied a total of 87 rules in 20 ms. Remains 169 /211 variables (removed 42) and now considering 193/238 (removed 45) transitions.
// Phase 1: matrix 193 rows 169 cols
[2022-05-16 23:54:30] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:30] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 193 rows 169 cols
[2022-05-16 23:54:30] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:30] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 169 cols
[2022-05-16 23:54:30] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/211 places, 193/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/211 places, 193/238 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s131 1), p1:(EQ s95 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-01 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(p0)))||X(F(p1)))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Graph (complete) has 240 edges and 211 vertex of which 75 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.2 ms
Discarding 136 places :
Also discarding 152 output transitions
Drop transitions removed 152 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 74 transition count 32
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 64 rules applied. Total rules applied 118 place count 21 transition count 21
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 14 transition count 21
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 125 place count 14 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 133 place count 10 transition count 17
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 9 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 9 transition count 15
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 141 place count 6 transition count 11
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 5 transition count 8
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 5 transition count 7
Applied a total of 146 rules in 14 ms. Remains 5 /211 variables (removed 206) and now considering 7/238 (removed 231) transitions.
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 23:54:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:30] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 23:54:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:30] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-16 23:54:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 23:54:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:30] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/211 places, 7/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/211 places, 7/238 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 37839 reset in 140 ms.
Product exploration explored 100000 steps with 37801 reset in 126 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 7
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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM703-PT-none-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-02 finished in 602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !F(p1))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 191 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 191 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 191 transition count 217
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 185 transition count 211
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 185 transition count 211
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 180 transition count 206
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 180 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 176 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 176 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 172 transition count 198
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 172 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 172 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 170 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 170 transition count 195
Applied a total of 84 rules in 25 ms. Remains 170 /211 variables (removed 41) and now considering 195/238 (removed 43) transitions.
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:31] [INFO ] Computed 0 place invariants in 16 ms
[2022-05-16 23:54:31] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:31] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:31] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-16 23:54:31] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/211 places, 195/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/211 places, 195/238 transitions.
Stuttering acceptance computed with spot in 103 ms :[p1, p1, true, p1]
Running random walk in product with property : IBM703-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s87 1), p0:(OR (NEQ s31 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1844 reset in 119 ms.
Product exploration explored 100000 steps with 1896 reset in 133 ms.
Computed a total of 170 stabilizing places and 195 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 195
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 p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 427 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 184 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 128 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:32] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 14 factoid took 546 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[p1, p1, true, p1]
Stuttering acceptance computed with spot in 133 ms :[p1, p1, true, p1]
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 195/195 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 195/195 (removed 0) transitions.
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:33] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:33] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:33] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:33] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:33] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:33] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 195/195 transitions.
Computed a total of 170 stabilizing places and 195 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 195
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)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 390 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[p1, p1, true, p1]
Finished random walk after 6771 steps, including 130 resets, run visited all 3 properties in 12 ms. (steps per millisecond=564 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 9 factoid took 1164 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[p1, p1, true, p1]
Stuttering acceptance computed with spot in 113 ms :[p1, p1, true, p1]
Stuttering acceptance computed with spot in 132 ms :[p1, p1, true, p1]
Product exploration explored 100000 steps with 1854 reset in 63 ms.
Product exploration explored 100000 steps with 1884 reset in 73 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 122 ms :[p1, p1, true, p1]
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 195/195 transitions.
Graph (complete) has 196 edges and 170 vertex of which 78 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.2 ms
Discarding 92 places :
Also discarding 103 output transitions
Drop transitions removed 103 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 78 transition count 91
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 38 place count 78 transition count 93
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 49 place count 78 transition count 93
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 57 transition count 72
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 57 transition count 72
Performed 15 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 106 place count 57 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 57 transition count 69
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 135 place count 29 transition count 40
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 163 place count 29 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 28 transition count 39
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 28 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 28 transition count 39
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 26 transition count 37
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 26 transition count 37
Performed 6 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 176 place count 26 transition count 65
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 186 place count 26 transition count 55
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 195 place count 17 transition count 34
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 204 place count 17 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 17 transition count 42
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 212 place count 17 transition count 35
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 215 place count 14 transition count 29
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 218 place count 14 transition count 29
Deduced a syphon composed of 7 places in 0 ms
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 225 place count 14 transition count 22
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 226 place count 13 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 13 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 227 rules in 34 ms. Remains 13 /170 variables (removed 157) and now considering 21/195 (removed 174) transitions.
[2022-05-16 23:54:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 21 rows 13 cols
[2022-05-16 23:54:36] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/170 places, 21/195 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/170 places, 21/195 transitions.
Product exploration explored 100000 steps with 1907 reset in 105 ms.
Product exploration explored 100000 steps with 1917 reset in 106 ms.
Built C files in :
/tmp/ltsmin17303166645240815857
[2022-05-16 23:54:36] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17303166645240815857
Running compilation step : cd /tmp/ltsmin17303166645240815857;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 409 ms.
Running link step : cd /tmp/ltsmin17303166645240815857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17303166645240815857;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased134142555436808729.hoa' '--buchi-type=spotba'
LTSmin run took 345 ms.
FORMULA IBM703-PT-none-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBM703-PT-none-LTLFireability-03 finished in 6161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Graph (complete) has 240 edges and 211 vertex of which 173 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 172 transition count 73
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 148 rules applied. Total rules applied 274 place count 47 transition count 50
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 21 rules applied. Total rules applied 295 place count 32 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 299 place count 28 transition count 44
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 299 place count 28 transition count 39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 309 place count 23 transition count 39
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 311 place count 21 transition count 36
Iterating global reduction 4 with 2 rules applied. Total rules applied 313 place count 21 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 313 place count 21 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 20 transition count 35
Performed 14 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 343 place count 6 transition count 16
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 7 rules applied. Total rules applied 350 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 352 place count 5 transition count 8
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 356 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 357 place count 3 transition count 4
Applied a total of 357 rules in 7 ms. Remains 3 /211 variables (removed 208) and now considering 4/238 (removed 234) transitions.
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:54:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:37] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:54:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:37] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-16 23:54:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:54:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:37] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/211 places, 4/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/211 places, 4/238 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-04 finished in 139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0))||p1) U p0))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 190 transition count 217
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 190 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 190 transition count 216
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 184 transition count 210
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 184 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 184 transition count 209
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 180 transition count 205
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 180 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 177 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 177 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 174 transition count 199
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 174 transition count 199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 172 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 172 transition count 197
Applied a total of 80 rules in 23 ms. Remains 172 /211 variables (removed 39) and now considering 197/238 (removed 41) transitions.
// Phase 1: matrix 197 rows 172 cols
[2022-05-16 23:54:37] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:37] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 197 rows 172 cols
[2022-05-16 23:54:37] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:37] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 172 cols
[2022-05-16 23:54:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:37] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/211 places, 197/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 172/211 places, 197/238 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s92 1), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-05 finished in 314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 190 transition count 217
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 190 transition count 217
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 184 transition count 211
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 184 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 184 transition count 210
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 180 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 180 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 176 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 176 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 172 transition count 198
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 172 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 172 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 170 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 170 transition count 195
Applied a total of 84 rules in 22 ms. Remains 170 /211 variables (removed 41) and now considering 195/238 (removed 43) transitions.
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:37] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:37] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:37] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:37] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:37] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:37] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/211 places, 195/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/211 places, 195/238 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s166 0), p1:(NEQ s155 1)], 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]]
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 170 stabilizing places and 195 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 195
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM703-PT-none-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-06 finished in 863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!G(F((G(p0)||p1)))) U G(p2))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 190 transition count 217
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 190 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 190 transition count 216
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 183 transition count 209
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 183 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 183 transition count 208
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 178 transition count 203
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 178 transition count 203
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 174 transition count 199
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 174 transition count 199
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 170 transition count 195
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 170 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 170 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 168 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 168 transition count 192
Applied a total of 89 rules in 27 ms. Remains 168 /211 variables (removed 43) and now considering 192/238 (removed 46) transitions.
// Phase 1: matrix 192 rows 168 cols
[2022-05-16 23:54:38] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:38] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 192 rows 168 cols
[2022-05-16 23:54:38] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:38] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 168 cols
[2022-05-16 23:54:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:38] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/211 places, 192/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 168/211 places, 192/238 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (OR p1 p0), p0]
Running random walk in product with property : IBM703-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s96 1), p1:(EQ s79 1), p0:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1088 steps with 17 reset in 4 ms.
FORMULA IBM703-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-07 finished in 434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(G(X(F(p0))))||(!(F(p1) U p2)&&p3)))))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 189 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 189 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 189 transition count 215
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 182 transition count 208
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 182 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 182 transition count 207
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 177 transition count 202
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 177 transition count 202
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 173 transition count 198
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 173 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 170 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 170 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 170 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 169 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 169 transition count 193
Applied a total of 87 rules in 21 ms. Remains 169 /211 variables (removed 42) and now considering 193/238 (removed 45) transitions.
// Phase 1: matrix 193 rows 169 cols
[2022-05-16 23:54:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:39] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 193 rows 169 cols
[2022-05-16 23:54:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:39] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 169 cols
[2022-05-16 23:54:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:39] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/211 places, 193/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/211 places, 193/238 transitions.
Stuttering acceptance computed with spot in 446 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 p2))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p3 p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p3 p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=3 dest: 7}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p3) p1 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p3 p1 (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={1} source=7 dest: 7}], [{ cond=(OR (AND (NOT p3) p1) (AND p1 p2)), acceptance={} source=8 dest: 1}, { cond=(OR (AND (NOT p3) p1 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={} source=8 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p3 p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={} source=8 dest: 7}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(EQ s87 0), p2:(EQ s167 1), p0:(EQ s96 0), p1:(EQ s156 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1864 reset in 127 ms.
Product exploration explored 100000 steps with 1859 reset in 91 ms.
Computed a total of 169 stabilizing places and 193 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 169 transition count 193
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 (NOT p2) p0 (NOT p1)), (X (AND p3 (NOT p1) (NOT p2))), (X (NOT (AND p3 p1 (NOT p2) (NOT p0)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (OR (NOT p3) p2))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (OR (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND p3 (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (G p3)), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 26 factoid took 911 ms. Reduced automaton from 9 states, 39 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM703-PT-none-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-08 finished in 2013 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U ((X(p1)||p2) U X(p3))))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 189 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 189 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 189 transition count 215
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 182 transition count 208
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 182 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 182 transition count 207
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 177 transition count 202
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 177 transition count 202
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 173 transition count 198
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 173 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 169 transition count 194
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 169 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 169 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 167 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 167 transition count 191
Applied a total of 91 rules in 18 ms. Remains 167 /211 variables (removed 44) and now considering 191/238 (removed 47) transitions.
// Phase 1: matrix 191 rows 167 cols
[2022-05-16 23:54:41] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:41] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 191 rows 167 cols
[2022-05-16 23:54:41] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:41] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 191 rows 167 cols
[2022-05-16 23:54:41] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:41] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/211 places, 191/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 167/211 places, 191/238 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), true, (NOT p0), (AND (NOT p1) (NOT p3) p0), (AND p0 (NOT p3))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p3) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s78 1) (NEQ s164 1)), p1:(EQ s147 1), p3:(EQ s47 1), p0:(EQ s164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-09 finished in 445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(((G(p0)&&p1)||p2)))&&X(p3)))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 191 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 191 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 191 transition count 217
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 186 transition count 212
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 186 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 182 transition count 208
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 182 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 179 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 179 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 176 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 176 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 176 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 174 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 174 transition count 199
Applied a total of 76 rules in 17 ms. Remains 174 /211 variables (removed 37) and now considering 199/238 (removed 39) transitions.
// Phase 1: matrix 199 rows 174 cols
[2022-05-16 23:54:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:41] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 199 rows 174 cols
[2022-05-16 23:54:41] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:41] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 174 cols
[2022-05-16 23:54:41] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:41] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/211 places, 199/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/211 places, 199/238 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=p3, acceptance={0} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p3 (NOT p2) (NOT p1)) (AND p3 (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 4}, { cond=(AND p3 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s166 0), p2:(EQ s103 1), p1:(EQ s162 1), p0:(EQ s166 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-10 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(G(p0))))))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Graph (complete) has 240 edges and 211 vertex of which 57 are kept as prefixes of interest. Removing 154 places using SCC suffix rule.2 ms
Discarding 154 places :
Also discarding 172 output transitions
Drop transitions removed 172 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 56 transition count 24
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 47 rules applied. Total rules applied 89 place count 15 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 11 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 93 place count 11 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 8 transition count 15
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 7 transition count 13
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 7 transition count 13
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 4 transition count 9
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 110 place count 4 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 3 transition count 4
Applied a total of 113 rules in 10 ms. Remains 3 /211 variables (removed 208) and now considering 4/238 (removed 234) transitions.
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:54:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:41] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:54:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:41] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2022-05-16 23:54:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:54:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:41] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/211 places, 4/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/211 places, 4/238 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s1 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 33397 reset in 38 ms.
Product exploration explored 100000 steps with 33363 reset in 40 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (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 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM703-PT-none-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-11 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(F(p0) U p1)||X(p2)||X(X(p3)))))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 200 transition count 227
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 200 transition count 227
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 194 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 194 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 194 transition count 220
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 189 transition count 215
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 189 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 189 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 186 transition count 211
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 186 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 184 transition count 209
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 184 transition count 209
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 182 transition count 207
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 182 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 182 transition count 206
Applied a total of 61 rules in 18 ms. Remains 182 /211 variables (removed 29) and now considering 206/238 (removed 32) transitions.
// Phase 1: matrix 206 rows 182 cols
[2022-05-16 23:54:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:42] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 206 rows 182 cols
[2022-05-16 23:54:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:42] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 182 cols
[2022-05-16 23:54:42] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:42] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 182/211 places, 206/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 182/211 places, 206/238 transitions.
Stuttering acceptance computed with spot in 420 ms :[true, (AND (NOT p2) (NOT p3)), (NOT p3), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) p1 p0), (AND p1 (NOT p3)), (AND p0 p1 (NOT p3)), (AND p0 (NOT p3)), p0, p1, (AND p0 p1)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=7 dest: 11}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 12}], [{ cond=(AND p0 p1 (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=8 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=8 dest: 12}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=9 dest: 10}], [{ cond=p0, acceptance={} source=10 dest: 0}, { cond=(NOT p0), acceptance={} source=10 dest: 10}], [{ cond=p1, acceptance={} source=11 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 12}], [{ cond=(AND p0 p1), acceptance={} source=12 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=12 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 12}]], initial=3, aps=[p2:(EQ s174 0), p3:(EQ s66 0), p1:(EQ s50 1), p0:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 108 ms.
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Computed a total of 182 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 182 transition count 206
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 p2 p3 (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (G p2)), (F (G p3)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 14 factoid took 296 ms. Reduced automaton from 13 states, 32 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM703-PT-none-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-13 finished in 1217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||p1)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 225
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 189 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 189 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 189 transition count 215
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 182 transition count 208
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 182 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 182 transition count 207
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 177 transition count 202
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 177 transition count 202
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 173 transition count 198
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 173 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 169 transition count 194
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 169 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 169 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 167 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 167 transition count 191
Applied a total of 91 rules in 14 ms. Remains 167 /211 variables (removed 44) and now considering 191/238 (removed 47) transitions.
// Phase 1: matrix 191 rows 167 cols
[2022-05-16 23:54:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:43] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 191 rows 167 cols
[2022-05-16 23:54:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 191 rows 167 cols
[2022-05-16 23:54:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:43] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/211 places, 191/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 167/211 places, 191/238 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s112 1), p0:(EQ s118 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][false, false]]
Stuttering criterion allowed to conclude after 114 steps with 1 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-14 finished in 245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(F(p1)&&F(p2)))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 238/238 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 197 transition count 224
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 197 transition count 224
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 188 transition count 215
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 188 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 188 transition count 214
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 181 transition count 207
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 181 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 181 transition count 206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 176 transition count 201
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 176 transition count 201
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 172 transition count 197
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 172 transition count 197
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 168 transition count 193
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 168 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 168 transition count 192
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 166 transition count 190
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 166 transition count 190
Applied a total of 93 rules in 25 ms. Remains 166 /211 variables (removed 45) and now considering 190/238 (removed 48) transitions.
// Phase 1: matrix 190 rows 166 cols
[2022-05-16 23:54:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:43] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 190 rows 166 cols
[2022-05-16 23:54:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:43] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 190 rows 166 cols
[2022-05-16 23:54:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:43] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/211 places, 190/238 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/211 places, 190/238 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s115 1), p2:(EQ s123 1), p0:(EQ s154 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-15 finished in 353 ms.
All properties solved by simple procedures.
Total runtime 17194 ms.

BK_STOP 1652745284442

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="IBM703-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is IBM703-PT-none, 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 r132-tall-165271820400092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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