Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r231-tall-167856415600092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r231-tall-167856415600092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 11K Feb 26 04:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 04:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 04:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 04:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 04:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 04:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 04:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 203K Mar 5 18:22 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 1679434414925

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 21:33:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 21:33:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:33:36] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-21 21:33:36] [INFO ] Transformed 262 places.
[2023-03-21 21:33:36] [INFO ] Transformed 284 transitions.
[2023-03-21 21:33:36] [INFO ] Found NUPN structural information;
[2023-03-21 21:33:36] [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]
[2023-03-21 21:33:36] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA IBM703-PT-none-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 34 place count 228 transition count 256
Iterating global reduction 1 with 28 rules applied. Total rules applied 62 place count 228 transition count 256
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 218 transition count 246
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 218 transition count 246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 90 place count 210 transition count 238
Iterating global reduction 1 with 8 rules applied. Total rules applied 98 place count 210 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 100 place count 210 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 207 transition count 233
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 207 transition count 233
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 204 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 204 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 201 transition count 227
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 201 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 198 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 198 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 196 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 196 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 194 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 194 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 193 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 193 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 192 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 192 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 191 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 191 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 191 transition count 216
Applied a total of 139 rules in 104 ms. Remains 191 /262 variables (removed 71) and now considering 216/284 (removed 68) transitions.
// Phase 1: matrix 216 rows 191 cols
[2023-03-21 21:33:36] [INFO ] Computed 0 place invariants in 15 ms
[2023-03-21 21:33:37] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-21 21:33:37] [INFO ] Invariant cache hit.
[2023-03-21 21:33:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2023-03-21 21:33:37] [INFO ] Invariant cache hit.
[2023-03-21 21:33:37] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/262 places, 216/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 679 ms. Remains : 191/262 places, 216/284 transitions.
Support contains 22 out of 191 places after structural reductions.
[2023-03-21 21:33:37] [INFO ] Flatten gal took : 34 ms
[2023-03-21 21:33:37] [INFO ] Flatten gal took : 17 ms
[2023-03-21 21:33:37] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 20 out of 191 places (down from 22) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:33:37] [INFO ] Invariant cache hit.
[2023-03-21 21:33:37] [INFO ] After 112ms 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.
FORMULA IBM703-PT-none-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 191 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 191 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA IBM703-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 185 transition count 210
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 185 transition count 210
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 180 transition count 205
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 180 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 180 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 178 transition count 202
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 178 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 177 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 177 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 176 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 176 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 175 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 175 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 174 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 174 transition count 198
Applied a total of 35 rules in 27 ms. Remains 174 /191 variables (removed 17) and now considering 198/216 (removed 18) transitions.
// Phase 1: matrix 198 rows 174 cols
[2023-03-21 21:33:38] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-21 21:33:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-21 21:33:38] [INFO ] Invariant cache hit.
[2023-03-21 21:33:38] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-21 21:33:38] [INFO ] Invariant cache hit.
[2023-03-21 21:33:38] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/191 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 174/191 places, 198/216 transitions.
Stuttering acceptance computed with spot in 362 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s47 1) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA IBM703-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-01 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 216/216 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 183 transition count 208
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 183 transition count 208
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 177 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 177 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 177 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 174 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 174 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 172 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 172 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 170 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 170 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 169 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 169 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 168 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 168 transition count 192
Applied a total of 47 rules in 24 ms. Remains 168 /191 variables (removed 23) and now considering 192/216 (removed 24) transitions.
// Phase 1: matrix 192 rows 168 cols
[2023-03-21 21:33:38] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-21 21:33:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-21 21:33:38] [INFO ] Invariant cache hit.
[2023-03-21 21:33:38] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/191 places, 192/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 168/191 places, 192/216 transitions.
Stuttering acceptance computed with spot in 79 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=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s134 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-05 finished in 333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1))&&F(p2))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 216/216 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 183 transition count 208
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 183 transition count 208
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 177 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 177 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 177 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 174 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 174 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 172 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 172 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 170 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 170 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 168 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 168 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 166 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 166 transition count 190
Applied a total of 51 rules in 17 ms. Remains 166 /191 variables (removed 25) and now considering 190/216 (removed 26) transitions.
// Phase 1: matrix 190 rows 166 cols
[2023-03-21 21:33:39] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/191 places, 190/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 166/191 places, 190/216 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s102 0), p0:(EQ s91 1), p2:(EQ s93 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-06 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U (p1&&G(!p0)))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 216/216 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 183 transition count 208
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 183 transition count 208
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 177 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 177 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 177 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 174 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 174 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 172 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 172 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 170 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 170 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 168 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 168 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 166 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 166 transition count 190
Applied a total of 51 rules in 18 ms. Remains 166 /191 variables (removed 25) and now considering 190/216 (removed 26) transitions.
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/191 places, 190/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 166/191 places, 190/216 transitions.
Stuttering acceptance computed with spot in 130 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s34 1) (EQ s49 1)), p1:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 166 steps with 3 reset in 4 ms.
FORMULA IBM703-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-09 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 216/216 transitions.
Graph (complete) has 216 edges and 191 vertex of which 70 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.2 ms
Discarding 121 places :
Also discarding 134 output transitions
Drop transitions removed 134 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 69 transition count 29
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 56 rules applied. Total rules applied 109 place count 18 transition count 24
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 15 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 112 place count 15 transition count 21
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 118 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 11 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 11 transition count 19
Performed 5 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 130 place count 6 transition count 13
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 134 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 136 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 5 transition count 8
Applied a total of 137 rules in 11 ms. Remains 5 /191 variables (removed 186) and now considering 8/216 (removed 208) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 21:33:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [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.
[2023-03-21 21:33:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/191 places, 8/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 5/191 places, 8/216 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1), p1:(EQ s1 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-11 finished in 122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 216/216 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 184 transition count 209
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 184 transition count 209
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 179 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 179 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 179 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 176 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 176 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 174 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 174 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 172 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 172 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 170 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 170 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 168 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 168 transition count 192
Applied a total of 47 rules in 28 ms. Remains 168 /191 variables (removed 23) and now considering 192/216 (removed 24) transitions.
// Phase 1: matrix 192 rows 168 cols
[2023-03-21 21:33:40] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-21 21:33:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-21 21:33:40] [INFO ] Invariant cache hit.
[2023-03-21 21:33:40] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-21 21:33:40] [INFO ] Invariant cache hit.
[2023-03-21 21:33:40] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/191 places, 192/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 168/191 places, 192/216 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s8 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 74 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-12 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(X(p1))))&&X(p2)))'
Support contains 2 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 216/216 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 184 transition count 209
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 184 transition count 209
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 179 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 179 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 179 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 176 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 176 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 174 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 174 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 172 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 172 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 171 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 171 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 170 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 170 transition count 194
Applied a total of 43 rules in 8 ms. Remains 170 /191 variables (removed 21) and now considering 194/216 (removed 22) transitions.
// Phase 1: matrix 194 rows 170 cols
[2023-03-21 21:33:40] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 21:33:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-21 21:33:40] [INFO ] Invariant cache hit.
[2023-03-21 21:33:40] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-21 21:33:40] [INFO ] Invariant cache hit.
[2023-03-21 21:33:40] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/191 places, 194/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 170/191 places, 194/216 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s169 0), p2:(EQ s142 1), p1:(EQ s142 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-13 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1 U X((F(p2)&&G(p3)))))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 216/216 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 183 transition count 208
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 183 transition count 208
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 177 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 177 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 177 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 174 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 174 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 172 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 172 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 170 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 170 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 168 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 168 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 166 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 166 transition count 190
Applied a total of 51 rules in 22 ms. Remains 166 /191 variables (removed 25) and now considering 190/216 (removed 26) transitions.
// Phase 1: matrix 190 rows 166 cols
[2023-03-21 21:33:40] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 21:33:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-21 21:33:40] [INFO ] Invariant cache hit.
[2023-03-21 21:33:40] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-21 21:33:40] [INFO ] Invariant cache hit.
[2023-03-21 21:33:41] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/191 places, 190/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 166/191 places, 190/216 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (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=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 4}, { cond=p3, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0) p3), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s107 1), p0:(AND (EQ s66 1) (NEQ s67 1)), p3:(EQ s66 1), p2:(EQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-15 finished in 594 ms.
All properties solved by simple procedures.
Total runtime 5025 ms.
ITS solved all properties within timeout

BK_STOP 1679434422296

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
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 r231-tall-167856415600092"
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 ;