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.r150-smll-165276998600292.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 ParamProductionCell-PT-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998600292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 7.8K Apr 29 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 17:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 17:37 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 4.0K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-5-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653050956276

Running Version 202205111006
[2022-05-20 12:49:18] [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-20 12:49:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:49:18] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2022-05-20 12:49:18] [INFO ] Transformed 231 places.
[2022-05-20 12:49:18] [INFO ] Transformed 202 transitions.
[2022-05-20 12:49:18] [INFO ] Found NUPN structural information;
[2022-05-20 12:49:18] [INFO ] Parsed PT model containing 231 places and 202 transitions in 445 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ParamProductionCell-PT-5-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 70 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2022-05-20 12:49:18] [INFO ] Computed 59 place invariants in 27 ms
[2022-05-20 12:49:19] [INFO ] Implicit Places using invariants in 843 ms returned [15, 16, 18, 19, 24, 31, 35, 42, 46, 47, 59, 65, 73, 79, 101, 114, 115, 117, 119, 120, 160, 161, 191, 192, 201, 202, 206, 217]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 902 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/231 places, 197/202 transitions.
Applied a total of 0 rules in 23 ms. Remains 198 /198 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 198/231 places, 197/202 transitions.
Support contains 46 out of 198 places after structural reductions.
[2022-05-20 12:49:20] [INFO ] Flatten gal took : 69 ms
[2022-05-20 12:49:20] [INFO ] Flatten gal took : 34 ms
[2022-05-20 12:49:20] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 45 out of 198 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 25) seen :23
Finished Best-First random walk after 1174 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=130 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!((X(p1)&&p0) U G((p2 U p3)))||p2))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 16 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2022-05-20 12:49:21] [INFO ] Computed 31 place invariants in 4 ms
[2022-05-20 12:49:21] [INFO ] Implicit Places using invariants in 229 ms returned [29, 34, 53, 65, 84, 85, 140, 143, 170, 171]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 243 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 11 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:21] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-20 12:49:21] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:21] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-20 12:49:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:49:22] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 438 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND p1 (NOT p2) p3)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s47 1)), p3:(AND (EQ s134 1) (EQ s150 1)), p0:(AND (EQ s84 1) (EQ s141 1)), p1:(AND (EQ s84 1) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 498 ms.
Product exploration explored 100000 steps with 50000 reset in 489 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p0)))
Knowledge based reduction with 6 factoid took 196 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ParamProductionCell-PT-5-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-5-LTLFireability-00 finished in 2506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F((F(p0) U p1))&&(G(p0)||p0)))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 198 transition count 171
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 172 transition count 171
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 52 place count 172 transition count 153
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 88 place count 154 transition count 153
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 142 place count 127 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 125 transition count 124
Applied a total of 146 rules in 62 ms. Remains 125 /198 variables (removed 73) and now considering 124/197 (removed 73) transitions.
// Phase 1: matrix 124 rows 125 cols
[2022-05-20 12:49:23] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:49:24] [INFO ] Implicit Places using invariants in 230 ms returned [15, 18, 31, 39, 50, 86, 87, 88, 110, 111]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 232 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/198 places, 124/197 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 92 transition count 101
Applied a total of 46 rules in 14 ms. Remains 92 /115 variables (removed 23) and now considering 101/124 (removed 23) transitions.
// Phase 1: matrix 101 rows 92 cols
[2022-05-20 12:49:24] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:49:24] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 101 rows 92 cols
[2022-05-20 12:49:24] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-20 12:49:24] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:49:24] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/198 places, 101/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 92/198 places, 101/197 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s46 1)), p1:(AND (EQ s24 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1464 reset in 250 ms.
Stack based approach found an accepted trace after 836 steps with 15 reset with depth 93 and stack size 93 in 3 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-01 finished in 1135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!G(p1)&&p0) U (F(p1)||p2))))'
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 14 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2022-05-20 12:49:24] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:49:25] [INFO ] Implicit Places using invariants in 195 ms returned [29, 53, 65, 84, 85, 140, 142, 143, 170, 171]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 198 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 16 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:25] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:49:25] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:25] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-20 12:49:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:49:25] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s79 1) (EQ s122 1)), p2:(AND (EQ s51 1) (EQ s58 1)), p0:(AND (EQ s31 1) (EQ s33 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 91 reset in 208 ms.
Stack based approach found an accepted trace after 455 steps with 1 reset with depth 267 and stack size 267 in 7 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-03 finished in 1031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(X(p2)&&p1))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 7 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2022-05-20 12:49:25] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:49:26] [INFO ] Implicit Places using invariants in 244 ms returned [34, 53, 65, 84, 85, 140, 142, 170, 171]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 246 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 17 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:49:26] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:49:26] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:49:26] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:49:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:49:26] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/198 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 186/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (EQ s79 1) (EQ s88 1)), p2:(OR (EQ s133 0) (EQ s135 0)), p0:(OR (EQ s7 0) (EQ s29 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Stack based approach found an accepted trace after 215 steps with 0 reset with depth 216 and stack size 216 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-05 finished in 1443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G(p1)))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 198 transition count 171
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 172 transition count 171
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 52 place count 172 transition count 155
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 84 place count 156 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 155 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 155 transition count 154
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 132 place count 132 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 136 place count 130 transition count 129
Applied a total of 136 rules in 24 ms. Remains 130 /198 variables (removed 68) and now considering 129/197 (removed 68) transitions.
// Phase 1: matrix 129 rows 130 cols
[2022-05-20 12:49:27] [INFO ] Computed 31 place invariants in 3 ms
[2022-05-20 12:49:27] [INFO ] Implicit Places using invariants in 187 ms returned [17, 20, 33, 41, 51, 90, 91, 92, 115, 116]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 191 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/198 places, 129/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 127
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 34 place count 103 transition count 112
Applied a total of 34 rules in 10 ms. Remains 103 /120 variables (removed 17) and now considering 112/129 (removed 17) transitions.
// Phase 1: matrix 112 rows 103 cols
[2022-05-20 12:49:27] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 12:49:27] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 112 rows 103 cols
[2022-05-20 12:49:27] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:49:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:49:27] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/198 places, 112/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/198 places, 112/197 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s40 1) (EQ s68 1)), p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 193 ms.
Stack based approach found an accepted trace after 247 steps with 0 reset with depth 248 and stack size 248 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-07 finished in 929 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 8 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2022-05-20 12:49:28] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:49:28] [INFO ] Implicit Places using invariants in 326 ms returned [29, 34, 53, 65, 84, 85, 140, 142, 143, 171]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 333 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 9 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:28] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:49:28] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:28] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:49:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:49:29] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-08 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:(AND (EQ s159 1) (EQ s167 1) (OR (EQ s118 1) (EQ s29 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 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-08 finished in 1194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 6 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2022-05-20 12:49:29] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:49:29] [INFO ] Implicit Places using invariants in 317 ms returned [29, 34, 53, 65, 84, 85, 140, 142, 143, 170, 171]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 318 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 8 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:49:29] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:49:29] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:49:30] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-20 12:49:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:49:30] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/198 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 184/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-09 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:(AND (EQ s60 1) (EQ s66 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 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 1035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p1))||p0))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 21 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2022-05-20 12:49:30] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:49:30] [INFO ] Implicit Places using invariants in 179 ms returned [29, 34, 65, 84, 85, 140, 142, 143, 170, 171]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 182 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:30] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:49:30] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:30] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:49:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:49:31] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s84 1) (EQ s122 1)), p0:(OR (EQ s50 0) (EQ s51 0) (EQ s56 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ParamProductionCell-PT-5-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-5-LTLFireability-10 finished in 1586 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U G((!(p0 U p1)&&F(p0)))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 7 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2022-05-20 12:49:32] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:49:32] [INFO ] Implicit Places using invariants in 404 ms returned [29, 34, 65, 84, 85, 140, 142, 143, 170, 171]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 413 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 5 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:32] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:49:32] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:49:32] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:49:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:49:33] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1), p1]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s84 1) (EQ s146 1)), p1:(AND (EQ s51 1) (EQ s55 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 205 ms.
Stack based approach found an accepted trace after 547 steps with 0 reset with depth 548 and stack size 548 in 3 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-11 finished in 1587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((p0 U p1)||p2)))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 198 transition count 177
Reduce places removed 20 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 23 rules applied. Total rules applied 43 place count 178 transition count 174
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 175 transition count 174
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 46 place count 175 transition count 154
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 86 place count 155 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 154 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 154 transition count 153
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 142 place count 127 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 126 transition count 125
Applied a total of 144 rules in 37 ms. Remains 126 /198 variables (removed 72) and now considering 125/197 (removed 72) transitions.
// Phase 1: matrix 125 rows 126 cols
[2022-05-20 12:49:33] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:49:33] [INFO ] Implicit Places using invariants in 212 ms returned [16, 32, 51, 52, 87, 88, 89, 111, 112]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 214 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/198 places, 125/197 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 93 transition count 101
Applied a total of 48 rules in 12 ms. Remains 93 /117 variables (removed 24) and now considering 101/125 (removed 24) transitions.
// Phase 1: matrix 101 rows 93 cols
[2022-05-20 12:49:33] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:49:34] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 101 rows 93 cols
[2022-05-20 12:49:34] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-20 12:49:34] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:49:34] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/198 places, 101/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 93/198 places, 101/197 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s46 1) (EQ s56 1)), p1:(AND (EQ s36 1) (EQ s38 1)), p0:(AND (EQ s18 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Stack based approach found an accepted trace after 174 steps with 0 reset with depth 175 and stack size 175 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-13 finished in 1147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 172
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 173 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 171 transition count 170
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 54 place count 171 transition count 154
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 86 place count 155 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 154 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 154 transition count 153
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 134 place count 131 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 129 transition count 128
Applied a total of 138 rules in 34 ms. Remains 129 /198 variables (removed 69) and now considering 128/197 (removed 69) transitions.
// Phase 1: matrix 128 rows 129 cols
[2022-05-20 12:49:34] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:49:35] [INFO ] Implicit Places using invariants in 206 ms returned [15, 18, 31, 39, 49, 50, 87, 88, 111]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 207 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/198 places, 128/197 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 120 transition count 126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 118 transition count 126
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 46 place count 97 transition count 105
Applied a total of 46 rules in 18 ms. Remains 97 /120 variables (removed 23) and now considering 105/128 (removed 23) transitions.
// Phase 1: matrix 105 rows 97 cols
[2022-05-20 12:49:35] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:49:35] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 105 rows 97 cols
[2022-05-20 12:49:35] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-20 12:49:35] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:49:35] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/198 places, 105/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 97/198 places, 105/197 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s62 1) (EQ s71 1) (EQ s75 1)), p0:(AND (EQ s80 1) (EQ s81 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, null][true, true]]
Product exploration explored 100000 steps with 894 reset in 248 ms.
Product exploration explored 100000 steps with 890 reset in 291 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 81 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 464 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 105 rows 97 cols
[2022-05-20 12:49:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:49:37] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-20 12:49:37] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-20 12:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:49:37] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-20 12:49:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:49:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-20 12:49:37] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 12:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:49:37] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-20 12:49:37] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:49:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2022-05-20 12:49:37] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 4 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2022-05-20 12:49:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 968 ms
[2022-05-20 12:49:38] [INFO ] Computed and/alt/rep : 102/234/102 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-20 12:49:39] [INFO ] Added : 94 causal constraints over 19 iterations in 373 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 105 rows 97 cols
[2022-05-20 12:49:39] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:49:39] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-05-20 12:49:39] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2022-05-20 12:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:49:39] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-05-20 12:49:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:49:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2022-05-20 12:49:39] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-20 12:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:49:39] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-20 12:49:39] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:49:39] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2022-05-20 12:49:39] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-20 12:49:39] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2022-05-20 12:49:39] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2022-05-20 12:49:39] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:49:40] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:49:40] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2022-05-20 12:49:40] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2022-05-20 12:49:40] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2022-05-20 12:49:40] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2022-05-20 12:49:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 589 ms
[2022-05-20 12:49:40] [INFO ] Computed and/alt/rep : 102/234/102 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-20 12:49:40] [INFO ] Added : 72 causal constraints over 15 iterations in 239 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 105/105 transitions.
Applied a total of 0 rules in 9 ms. Remains 97 /97 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 97 cols
[2022-05-20 12:49:40] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:49:40] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 105 rows 97 cols
[2022-05-20 12:49:40] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:49:40] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:49:41] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2022-05-20 12:49:41] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 105 rows 97 cols
[2022-05-20 12:49:41] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:49:41] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 105/105 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 80 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 396 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 105 rows 97 cols
[2022-05-20 12:49:42] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:49:42] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2022-05-20 12:49:42] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 12:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:49:42] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-05-20 12:49:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:49:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2022-05-20 12:49:42] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-20 12:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:49:42] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-20 12:49:42] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:49:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2022-05-20 12:49:42] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:49:42] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:49:42] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 10 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2022-05-20 12:49:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 863 ms
[2022-05-20 12:49:43] [INFO ] Computed and/alt/rep : 102/234/102 causal constraints (skipped 0 transitions) in 46 ms.
[2022-05-20 12:49:43] [INFO ] Added : 94 causal constraints over 19 iterations in 400 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 105 rows 97 cols
[2022-05-20 12:49:44] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:49:44] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-20 12:49:44] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2022-05-20 12:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:49:44] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-20 12:49:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:49:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2022-05-20 12:49:44] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-20 12:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:49:44] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-20 12:49:44] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:49:44] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2022-05-20 12:49:44] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-20 12:49:44] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-05-20 12:49:44] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-20 12:49:44] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2022-05-20 12:49:44] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2022-05-20 12:49:44] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2022-05-20 12:49:44] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2022-05-20 12:49:44] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2022-05-20 12:49:44] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2022-05-20 12:49:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 504 ms
[2022-05-20 12:49:44] [INFO ] Computed and/alt/rep : 102/234/102 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-20 12:49:45] [INFO ] Added : 72 causal constraints over 15 iterations in 233 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 892 reset in 146 ms.
Product exploration explored 100000 steps with 888 reset in 167 ms.
Built C files in :
/tmp/ltsmin13203269592880538193
[2022-05-20 12:49:45] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2022-05-20 12:49:45] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:49:45] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2022-05-20 12:49:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:49:45] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2022-05-20 12:49:45] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:49:45] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13203269592880538193
Running compilation step : cd /tmp/ltsmin13203269592880538193;'/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 490 ms.
Running link step : cd /tmp/ltsmin13203269592880538193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin13203269592880538193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10471732056923688423.hoa' '--buchi-type=spotba'
LTSmin run took 2106 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-14 finished in 13556 ms.
All properties solved by simple procedures.
Total runtime 30327 ms.

BK_STOP 1653050988501

--------------------
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="ParamProductionCell-PT-5"
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 ParamProductionCell-PT-5, 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 r150-smll-165276998600292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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