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-165271820400076.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 IBM319-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-165271820400076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 11K Apr 29 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 16:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 16:04 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.0K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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 184K 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 IBM319-PT-none-LTLFireability-00
FORMULA_NAME IBM319-PT-none-LTLFireability-01
FORMULA_NAME IBM319-PT-none-LTLFireability-02
FORMULA_NAME IBM319-PT-none-LTLFireability-03
FORMULA_NAME IBM319-PT-none-LTLFireability-04
FORMULA_NAME IBM319-PT-none-LTLFireability-05
FORMULA_NAME IBM319-PT-none-LTLFireability-06
FORMULA_NAME IBM319-PT-none-LTLFireability-07
FORMULA_NAME IBM319-PT-none-LTLFireability-08
FORMULA_NAME IBM319-PT-none-LTLFireability-09
FORMULA_NAME IBM319-PT-none-LTLFireability-10
FORMULA_NAME IBM319-PT-none-LTLFireability-11
FORMULA_NAME IBM319-PT-none-LTLFireability-12
FORMULA_NAME IBM319-PT-none-LTLFireability-13
FORMULA_NAME IBM319-PT-none-LTLFireability-14
FORMULA_NAME IBM319-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652745005794

Running Version 202205111006
[2022-05-16 23:50:06] [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:50:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:50:07] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2022-05-16 23:50:07] [INFO ] Transformed 253 places.
[2022-05-16 23:50:07] [INFO ] Transformed 178 transitions.
[2022-05-16 23:50:07] [INFO ] Found NUPN structural information;
[2022-05-16 23:50:07] [INFO ] Completing missing partition info from NUPN : creating a component with [alpha, merge_s00002239_activated, join_s00001164_input_s00001127, join_s00001163_input_s00001128, callToProcess_s00002943_inputCriterion_s00001053_used, merge_s00002240_input_s00001052, merge_s00001162_input_s00001052, callToProcess_s00002802_inputCriterion_s00001053_used, merge_s00002241_input_s00001127, callToProcess_s00002121_inputCriterion_s00001053_used, callToTask_s00002869_inputCriterion_s00001053_used, callToTask_s00002896_inputCriterion_s00001053_used, callToTask_s00002949_inputCriterion_s00001053_used, callToTask_s00002958_inputCriterion_s00001053_used, callToTask_s00002966_inputCriterion_s00001053_used, decision_s00002055_activated, decision_s00002760_activated, decision_s00002948_activated, join_s00001163_activated_s00001062, fork_s00001071_activated_s00001073, fork_s00001298_activated_s00001073, fork_s00001298_activated_s00001078, decision_s00001123_input_s00001052, callToTask_s00002929_inputCriterion_s00001053_used, callToTask_s00002965_inputCriterion_s00001053_used, callToTask_s00002063_input_s00001052, callToTask_s00002931_input_s00001052, callToTask_s00002932_input_s00001052, callToTask_s00002954_inputCriterion_s00001053_used, callToTask_s00002951_input_s00001052, callToTask_s00002962_input_s00001052, callToTask_s00002963_inputCriterion_s00001053_used, callToTask_s00002954_input_s00001052, callToTask_s00002962_inputCriterion_s00001053_used, callToTask_s00002961_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001066, callToTask_s00002965_input_s00001052, callToTask_s00002956_input_s00001052, callToTask_s00002929_input_s00001052, callToTask_s00002960_inputCriterion_s00001053_used, callToTask_s00001168_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001068, callToTask_s00002950_inputCriterion_s00001053_used, callToTask_s00002930_inputCriterion_s00001053_used, callToTask_s00002254_inputCriterion_s00001053_used, callToTask_s00002063_inputCriterion_s00001053_used, callToProcess_s00002499_output_s00001054, callToProcess_s00002038_output_s00001077, callToTask_s00002063_output_s00001054, callToTask_s00002931_output_s00001054, callToTask_s00002044_output_s00001077, callToProcess_s00002802_output_s00001054, callToTask_s00002951_output_s00001054, callToTask_s00002952_output_s00001054, callToTask_s00002963_output_s00001054, callToTask_s00002955_output_s00001054, callToProcess_s00001108_input_s00001052, callToTask_s00002869_output_s00001054, callToTask_s00002965_output_s00001054, callToTask_s00002959_output_s00001054, callToTask_s00002966_output_s00001054, callToTask_s00002958_output_s00001054, callToTask_s00002961_output_s00001077, callToTask_s00002951_output_s00001077, callToTask_s00001852_output_s00001077, callToTask_s00002965_output_s00001077, callToTask_s00002966_output_s00001077, callToTask_s00002959_output_s00001077, callToTask_s00002869_output_s00001077, callToProcess_s00002499_input_s00001066, callToTask_s00001406_output_s00001077, callToProcess_s00002802_output_s00001077, callToTask_s00002966_input_s00001066, process_s00000343__s00003019_output_s00001249, callToProcess_s00002944_output_s00001077, callToProcess_s00002499_output_s00001083, callToTask_s00002964_input_s00001066, callToTask_s00002954_input_s00001066, callToTask_s00002931_inputCriterion_s00001053_used, callToTask_s00002952_input_s00001066, callToTask_s00002950_input_s00001066, callToTask_s00002960_input_s00001128, callToTask_s00001406_input_s00001066, callToTask_s00002063_input_s00001066, merge_s00002239_input_s00001066, merge_s00001162_input_s00001068, merge_s00001161_input_s00001068, merge_s00002241_input_s00001066]
[2022-05-16 23:50:07] [INFO ] Parsed PT model containing 253 places and 178 transitions in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IBM319-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 62 places
Reduce places removed 70 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 182 transition count 178
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 78 place count 175 transition count 171
Iterating global reduction 1 with 7 rules applied. Total rules applied 85 place count 175 transition count 171
Applied a total of 85 rules in 32 ms. Remains 175 /253 variables (removed 78) and now considering 171/178 (removed 7) transitions.
// Phase 1: matrix 171 rows 175 cols
[2022-05-16 23:50:07] [INFO ] Computed 17 place invariants in 15 ms
[2022-05-16 23:50:07] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 171 rows 175 cols
[2022-05-16 23:50:07] [INFO ] Computed 17 place invariants in 10 ms
[2022-05-16 23:50:07] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 175 cols
[2022-05-16 23:50:07] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 23:50:07] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 175/253 places, 171/178 transitions.
Finished structural reductions, in 1 iterations. Remains : 175/253 places, 171/178 transitions.
Support contains 45 out of 175 places after structural reductions.
[2022-05-16 23:50:07] [INFO ] Flatten gal took : 35 ms
[2022-05-16 23:50:07] [INFO ] Flatten gal took : 15 ms
[2022-05-16 23:50:07] [INFO ] Input system was already deterministic with 171 transitions.
Support contains 42 out of 175 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 193 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 33) seen :30
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 171 rows 175 cols
[2022-05-16 23:50:08] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-16 23:50:08] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-16 23:50:08] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA IBM319-PT-none-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 175 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 transition count 171
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' '!(F(G(F(G(G(F(((p1 U X(X(p2)))&&p0))))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 162 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 157 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 157 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 157 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 155 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 155 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 154 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 154 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 153 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 153 transition count 161
Applied a total of 32 rules in 26 ms. Remains 153 /175 variables (removed 22) and now considering 161/171 (removed 10) transitions.
// Phase 1: matrix 161 rows 153 cols
[2022-05-16 23:50:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:09] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 161 rows 153 cols
[2022-05-16 23:50:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:09] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 153 cols
[2022-05-16 23:50:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:09] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/175 places, 161/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/175 places, 161/171 transitions.
Stuttering acceptance computed with spot in 467 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s134 1)), p1:(AND (EQ s61 1) (EQ s134 1)), p2:(EQ s49 1)], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 3 ms.
FORMULA IBM319-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-00 finished in 780 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0) U X(p1)))||F(p2)||F(p3)||p2)))'
Support contains 6 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 163 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 158 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 158 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 158 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 157 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 157 transition count 164
Applied a total of 25 rules in 8 ms. Remains 157 /175 variables (removed 18) and now considering 164/171 (removed 7) transitions.
// Phase 1: matrix 164 rows 157 cols
[2022-05-16 23:50:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 23:50:10] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 164 rows 157 cols
[2022-05-16 23:50:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 23:50:10] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 157 cols
[2022-05-16 23:50:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 23:50:10] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/175 places, 164/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/175 places, 164/171 transitions.
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s85 1) (EQ s91 1)), p3:(EQ s5 1), p0:(AND (EQ s57 1) (EQ s141 1)), p1:(EQ s38 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]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 3 ms.
FORMULA IBM319-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-01 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(p0) U (!G(p0)&&p1))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Graph (complete) has 205 edges and 175 vertex of which 140 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.4 ms
Discarding 35 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 130 transition count 56
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 96 rules applied. Total rules applied 184 place count 44 transition count 46
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 191 place count 38 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 192 place count 37 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 192 place count 37 transition count 32
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 220 place count 22 transition count 32
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 222 place count 21 transition count 31
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 20 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 226 place count 19 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 226 place count 19 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 228 place count 18 transition count 28
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 242 place count 11 transition count 19
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 245 place count 11 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 249 place count 9 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 253 place count 9 transition count 15
Applied a total of 253 rules in 26 ms. Remains 9 /175 variables (removed 166) and now considering 15/171 (removed 156) transitions.
// Phase 1: matrix 15 rows 9 cols
[2022-05-16 23:50:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 23:50:10] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 15 rows 9 cols
[2022-05-16 23:50:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 23:50:10] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-16 23:50:10] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 15 rows 9 cols
[2022-05-16 23:50:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 23:50:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/175 places, 15/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/175 places, 15/171 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0, 2} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 2} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0, 2} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2 1), p1:(AND (OR (AND (EQ s4 1) (EQ s6 1)) (EQ s3 1)) (EQ s4 1) (EQ s6 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 31892 reset in 208 ms.
Product exploration explored 100000 steps with 31705 reset in 138 ms.
Computed a total of 9 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 9 factoid took 402 ms. Reduced automaton from 3 states, 12 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM319-PT-none-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-02 finished in 1028 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U (!p0&&G(!p1))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Graph (complete) has 205 edges and 175 vertex of which 51 are kept as prefixes of interest. Removing 124 places using SCC suffix rule.2 ms
Discarding 124 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 49 transition count 19
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 18 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 16 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 15 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 70 place count 15 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 78 place count 11 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 80 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 83 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 84 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 84 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 86 place count 7 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 87 place count 7 transition count 7
Applied a total of 87 rules in 15 ms. Remains 7 /175 variables (removed 168) and now considering 7/171 (removed 164) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 23:50:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 23:50:11] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 23:50:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 23:50:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-16 23:50:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 23:50:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 23:50:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/175 places, 7/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/175 places, 7/171 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, p1, (OR p0 p1)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (EQ s2 1) (EQ s4 1)), p0:(AND (EQ s0 1) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 22 steps with 9 reset in 2 ms.
FORMULA IBM319-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-03 finished in 165 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 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Graph (complete) has 205 edges and 175 vertex of which 13 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.1 ms
Discarding 162 places :
Also discarding 158 output transitions
Drop transitions removed 158 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 12 transition count 7
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 7 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 7 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 5 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 3 transition count 4
Applied a total of 18 rules in 3 ms. Remains 3 /175 variables (removed 172) and now considering 4/171 (removed 167) transitions.
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:50:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:50:11] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:50:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:50:11] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2022-05-16 23:50:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:50:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:50:11] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/175 places, 4/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/175 places, 4/171 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-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 s0 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 0 ms.
FORMULA IBM319-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-04 finished in 142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((G(X((p1 U !F(X(p2)))))||p0)))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 162 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 158 transition count 167
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 158 transition count 167
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 156 transition count 165
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 156 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 155 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 155 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 154 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 154 transition count 163
Applied a total of 29 rules in 18 ms. Remains 154 /175 variables (removed 21) and now considering 163/171 (removed 8) transitions.
// Phase 1: matrix 163 rows 154 cols
[2022-05-16 23:50:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 23:50:12] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 163 rows 154 cols
[2022-05-16 23:50:12] [INFO ] Computed 4 place invariants in 13 ms
[2022-05-16 23:50:12] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 154 cols
[2022-05-16 23:50:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:12] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/175 places, 163/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/175 places, 163/171 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, true]
Running random walk in product with property : IBM319-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s22 0) (EQ s148 0)), p2:(EQ s110 1), p1:(AND (EQ s22 1) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2032 reset in 172 ms.
Product exploration explored 100000 steps with 1964 reset in 143 ms.
Computed a total of 154 stabilizing places and 163 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 154 transition count 163
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 p2) (NOT p1)), (X (X p0)), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, true]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 163 rows 154 cols
[2022-05-16 23:50:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 6 ms returned sat
[2022-05-16 23:50:13] [INFO ] After 68ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X p0)), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F p1), (F p2)]
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 209 ms :[true, p2, (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 174 ms :[true, p2, (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 163/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 154 cols
[2022-05-16 23:50:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:14] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 163 rows 154 cols
[2022-05-16 23:50:14] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 23:50:14] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 154 cols
[2022-05-16 23:50:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:14] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/154 places, 163/163 transitions.
Computed a total of 154 stabilizing places and 163 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 154 transition count 163
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X p0)), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 268 ms :[true, p2, (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Finished random walk after 102 steps, including 2 resets, run visited all 3 properties in 3 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X p0)), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 192 ms :[true, p2, (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 170 ms :[true, p2, (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 ms :[true, p2, (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2033 reset in 64 ms.
Product exploration explored 100000 steps with 2028 reset in 69 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 184 ms :[true, p2, (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 163/163 transitions.
Graph (complete) has 173 edges and 154 vertex of which 69 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 90 output transitions
Drop transitions removed 90 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 69 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 69 transition count 69
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 33 place count 69 transition count 74
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 54 place count 69 transition count 74
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 86 place count 37 transition count 42
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 118 place count 37 transition count 42
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 125 place count 37 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 37 transition count 40
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 137 place count 27 transition count 30
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 27 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 27 transition count 30
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 25 transition count 28
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 25 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 25 transition count 37
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 21 transition count 27
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 21 transition count 27
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 162 rules in 23 ms. Remains 21 /154 variables (removed 133) and now considering 27/163 (removed 136) transitions.
[2022-05-16 23:50:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 27 rows 21 cols
[2022-05-16 23:50:16] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 23:50:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/154 places, 27/163 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/154 places, 27/163 transitions.
Product exploration explored 100000 steps with 2093 reset in 88 ms.
Product exploration explored 100000 steps with 2170 reset in 109 ms.
Built C files in :
/tmp/ltsmin16203907967429010999
[2022-05-16 23:50:16] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16203907967429010999
Running compilation step : cd /tmp/ltsmin16203907967429010999;'/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 356 ms.
Running link step : cd /tmp/ltsmin16203907967429010999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16203907967429010999;'/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/stateBased6914197641886028627.hoa' '--buchi-type=spotba'
LTSmin run took 2412 ms.
FORMULA IBM319-PT-none-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBM319-PT-none-LTLFireability-08 finished in 7309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((F(G(p0))&&X(p1)&&p0))&&X(p2)))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 162 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 157 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 157 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 157 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 155 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 155 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 154 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 154 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 153 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 153 transition count 161
Applied a total of 32 rules in 18 ms. Remains 153 /175 variables (removed 22) and now considering 161/171 (removed 10) transitions.
// Phase 1: matrix 161 rows 153 cols
[2022-05-16 23:50:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:19] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 161 rows 153 cols
[2022-05-16 23:50:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:19] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 153 cols
[2022-05-16 23:50:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:19] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/175 places, 161/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/175 places, 161/171 transitions.
Stuttering acceptance computed with spot in 638 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s132 1), p2:(EQ s29 0), p1:(AND (EQ s75 1) (EQ s118 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-09 finished in 900 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0) U p1))||p2)))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 162 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 157 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 157 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 157 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 155 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 155 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 154 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 154 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 153 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 153 transition count 161
Applied a total of 32 rules in 13 ms. Remains 153 /175 variables (removed 22) and now considering 161/171 (removed 10) transitions.
// Phase 1: matrix 161 rows 153 cols
[2022-05-16 23:50:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:20] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 161 rows 153 cols
[2022-05-16 23:50:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:20] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 153 cols
[2022-05-16 23:50:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:20] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/175 places, 161/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/175 places, 161/171 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s33 0), p1:(EQ s33 1), p0:(AND (EQ s57 1) (EQ s138 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]]
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Computed a total of 153 stabilizing places and 161 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 153 transition count 161
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 (NOT p1) (NOT p0)), (X p2), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM319-PT-none-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-12 finished in 1030 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Graph (complete) has 205 edges and 175 vertex of which 43 are kept as prefixes of interest. Removing 132 places using SCC suffix rule.1 ms
Discarding 132 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 40 transition count 14
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 12 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 10 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 62 place count 10 transition count 8
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 68 place count 7 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 73 place count 5 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 74 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 74 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 76 place count 3 transition count 4
Applied a total of 76 rules in 3 ms. Remains 3 /175 variables (removed 172) and now considering 4/171 (removed 167) transitions.
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:50:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:50:21] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:50:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:50:21] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-16 23:50:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2022-05-16 23:50:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:50:21] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/175 places, 4/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/175 places, 4/171 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-13 finished in 116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1) U X((F(p2)&&p3))))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 162 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 157 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 157 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 157 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 155 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 155 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 154 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 154 transition count 162
Applied a total of 30 rules in 11 ms. Remains 154 /175 variables (removed 21) and now considering 162/171 (removed 9) transitions.
// Phase 1: matrix 162 rows 154 cols
[2022-05-16 23:50:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:21] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 162 rows 154 cols
[2022-05-16 23:50:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:21] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 154 cols
[2022-05-16 23:50:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:50:21] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/175 places, 162/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/175 places, 162/171 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 0}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p2:(AND (EQ s85 1) (EQ s102 1)), p3:(OR (EQ s26 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-14 finished in 344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(p0) U G((F(X(p2))&&p1))))'
Support contains 6 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 171/171 transitions.
Graph (complete) has 205 edges and 175 vertex of which 142 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 133 transition count 56
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 96 rules applied. Total rules applied 185 place count 46 transition count 47
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 192 place count 40 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 193 place count 39 transition count 46
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 193 place count 39 transition count 33
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 221 place count 24 transition count 33
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 223 place count 23 transition count 32
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 226 place count 22 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 227 place count 21 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 227 place count 21 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 229 place count 20 transition count 29
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 243 place count 13 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 247 place count 13 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 251 place count 11 transition count 19
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 254 place count 11 transition count 16
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 257 place count 11 transition count 13
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 260 place count 11 transition count 13
Applied a total of 260 rules in 19 ms. Remains 11 /175 variables (removed 164) and now considering 13/171 (removed 158) transitions.
// Phase 1: matrix 13 rows 11 cols
[2022-05-16 23:50:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 23:50:21] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-16 23:50:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 23:50:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-16 23:50:21] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-16 23:50:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 23:50:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/175 places, 13/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/175 places, 13/171 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s9 1)), p0:(AND (EQ s6 1) (EQ s7 1)), p2:(AND (EQ s2 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-15 finished in 218 ms.
All properties solved by simple procedures.
Total runtime 14948 ms.

BK_STOP 1652745022282

--------------------
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="IBM319-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 IBM319-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-165271820400076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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