fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r263-smll-167863538200404
Last Updated
May 14, 2023

About the Execution of LoLa+red for ParamProductionCell-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
471.951 63957.00 100455.00 756.80 FFTFFTFTFTFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r263-smll-167863538200404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ParamProductionCell-PT-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538200404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.2K Feb 26 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 17:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1678781550204

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:12:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 08:12:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:12:34] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2023-03-14 08:12:34] [INFO ] Transformed 231 places.
[2023-03-14 08:12:34] [INFO ] Transformed 202 transitions.
[2023-03-14 08:12:34] [INFO ] Found NUPN structural information;
[2023-03-14 08:12:34] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-5-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 79 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2023-03-14 08:12:34] [INFO ] Computed 59 place invariants in 28 ms
[2023-03-14 08:12:35] [INFO ] Implicit Places using invariants in 795 ms returned [15, 16, 18, 19, 24, 35, 36, 42, 47, 59, 64, 65, 73, 79, 113, 118, 119, 160, 162, 164, 165, 190, 191, 194, 195, 200, 201, 205, 216]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 858 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 196/231 places, 196/202 transitions.
Applied a total of 0 rules in 19 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 957 ms. Remains : 196/231 places, 196/202 transitions.
Support contains 47 out of 196 places after structural reductions.
[2023-03-14 08:12:35] [INFO ] Flatten gal took : 81 ms
[2023-03-14 08:12:35] [INFO ] Flatten gal took : 38 ms
[2023-03-14 08:12:35] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 26) seen :24
Finished Best-First random walk after 1708 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=68 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 9 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-14 08:12:37] [INFO ] Computed 30 place invariants in 9 ms
[2023-03-14 08:12:37] [INFO ] Implicit Places using invariants in 379 ms returned [26, 34, 38, 65, 84, 85, 87, 99, 101, 142]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 382 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/196 places, 196/196 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 18 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-14 08:12:37] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-14 08:12:37] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-14 08:12:37] [INFO ] Invariant cache hit.
[2023-03-14 08:12:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:12:38] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1212 ms. Remains : 184/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s84 0) (EQ s121 0)), p1:(AND (EQ s84 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 20 reset in 551 ms.
Stack based approach found an accepted trace after 522 steps with 2 reset with depth 229 and stack size 229 in 4 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-01 finished in 2213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 196 transition count 163
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 163 transition count 163
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 66 place count 163 transition count 152
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 152 transition count 152
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 134 place count 129 transition count 129
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 138 place count 127 transition count 127
Applied a total of 138 rules in 59 ms. Remains 127 /196 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 127 cols
[2023-03-14 08:12:39] [INFO ] Computed 30 place invariants in 5 ms
[2023-03-14 08:12:39] [INFO ] Implicit Places using invariants in 234 ms returned [14, 19, 22, 39, 50, 53, 65, 67, 97]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 237 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/196 places, 127/196 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 118 transition count 124
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 113 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 113 transition count 122
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 34 place count 101 transition count 110
Applied a total of 34 rules in 24 ms. Remains 101 /118 variables (removed 17) and now considering 110/127 (removed 17) transitions.
// Phase 1: matrix 110 rows 101 cols
[2023-03-14 08:12:39] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 08:12:39] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-14 08:12:39] [INFO ] Invariant cache hit.
[2023-03-14 08:12:39] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:40] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/196 places, 110/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 724 ms. Remains : 101/196 places, 110/196 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-03 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:(AND (EQ s38 1) (EQ s55 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]]
Product exploration explored 100000 steps with 247 reset in 226 ms.
Stack based approach found an accepted trace after 256 steps with 7 reset with depth 156 and stack size 156 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-03 finished in 1060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(!p1)))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 6 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-14 08:12:40] [INFO ] Computed 30 place invariants in 6 ms
[2023-03-14 08:12:40] [INFO ] Implicit Places using invariants in 199 ms returned [26, 38, 65, 84, 85, 87, 99, 101, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 205 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/196 places, 196/196 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 8 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:12:40] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:12:40] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-14 08:12:40] [INFO ] Invariant cache hit.
[2023-03-14 08:12:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:12:41] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 706 ms. Remains : 185/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 163 ms :[p1, p1, p1, true, p0]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s31 1) (EQ s33 1) (EQ s47 1)), p1:(AND (EQ s149 1) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Product exploration explored 100000 steps with 50000 reset in 368 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 p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 7 factoid took 195 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-5-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-5-LTLFireability-05 finished in 1828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(p0))||G(p1))) U p2))'
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 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 31 place count 196 transition count 165
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 165 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 164 transition count 164
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 64 place count 164 transition count 154
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 84 place count 154 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 3 with 46 rules applied. Total rules applied 130 place count 131 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 3 with 4 rules applied. Total rules applied 134 place count 129 transition count 129
Applied a total of 134 rules in 26 ms. Remains 129 /196 variables (removed 67) and now considering 129/196 (removed 67) transitions.
// Phase 1: matrix 129 rows 129 cols
[2023-03-14 08:12:42] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-14 08:12:42] [INFO ] Implicit Places using invariants in 160 ms returned [14, 20, 23, 41, 53, 67, 69, 99]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 165 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/196 places, 129/196 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 120 transition count 128
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 120 transition count 125
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 117 transition count 125
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 30 place count 106 transition count 114
Applied a total of 30 rules in 13 ms. Remains 106 /121 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 106 cols
[2023-03-14 08:12:42] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:12:42] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-14 08:12:42] [INFO ] Invariant cache hit.
[2023-03-14 08:12:42] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:42] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/196 places, 114/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 612 ms. Remains : 106/196 places, 114/196 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (EQ s4 1) (EQ s29 1)) (AND (EQ s40 1) (EQ s46 1) (EQ s87 1))), p0:(AND (EQ s40 1) (EQ s46 1) (EQ s87 1)), p1:(AND (EQ s42 1) (EQ s45 1) (EQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 156 reset in 272 ms.
Stack based approach found an accepted trace after 96 steps with 0 reset with depth 97 and stack size 97 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-06 finished in 1079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((!p0||F(!p1)))) U (p0||F(p2)))))'
Support contains 6 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 196 transition count 164
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 164 transition count 164
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 64 place count 164 transition count 154
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 154 transition count 154
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 126 place count 133 transition count 133
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 130 place count 131 transition count 131
Applied a total of 130 rules in 31 ms. Remains 131 /196 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 131 cols
[2023-03-14 08:12:43] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-14 08:12:43] [INFO ] Implicit Places using invariants in 217 ms returned [15, 20, 23, 40, 53, 54, 56, 68, 70, 100]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 218 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/196 places, 131/196 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 120 transition count 130
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 120 transition count 126
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 116 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 114 transition count 124
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 114 transition count 124
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 64 place count 89 transition count 99
Applied a total of 64 rules in 21 ms. Remains 89 /121 variables (removed 32) and now considering 99/131 (removed 32) transitions.
// Phase 1: matrix 99 rows 89 cols
[2023-03-14 08:12:43] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:12:43] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-14 08:12:43] [INFO ] Invariant cache hit.
[2023-03-14 08:12:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:43] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/196 places, 99/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 733 ms. Remains : 89/196 places, 99/196 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 p1), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p2) p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s35 1)), p2:(AND (EQ s77 1) (EQ s81 1)), p1:(AND (EQ s41 1) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1418 reset in 239 ms.
Product exploration explored 100000 steps with 1425 reset in 166 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 p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 507 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 p1), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 08:12:45] [INFO ] Invariant cache hit.
[2023-03-14 08:12:45] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-14 08:12:45] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:12:45] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 08:12:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-14 08:12:45] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:12:45] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 08:12:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:45] [INFO ] After 32ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 08:12:45] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 6 ms to minimize.
[2023-03-14 08:12:46] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2023-03-14 08:12:46] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2023-03-14 08:12:46] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2023-03-14 08:12:46] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2023-03-14 08:12:46] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-14 08:12:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2023-03-14 08:12:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 507 ms
[2023-03-14 08:12:46] [INFO ] After 549ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-14 08:12:46] [INFO ] After 697ms SMT Verify possible using all constraints in natural 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 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2)]
Knowledge based reduction with 9 factoid took 631 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-14 08:12:47] [INFO ] Invariant cache hit.
[2023-03-14 08:12:47] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-14 08:12:47] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:47] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-14 08:12:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:12:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-14 08:12:47] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:47] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-14 08:12:47] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:47] [INFO ] [Nat]Added 66 Read/Feed constraints in 21 ms returned sat
[2023-03-14 08:12:47] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 5 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-14 08:12:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1020 ms
[2023-03-14 08:12:48] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-14 08:12:49] [INFO ] Added : 74 causal constraints over 15 iterations in 305 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 99/99 transitions.
Applied a total of 0 rules in 9 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-14 08:12:49] [INFO ] Invariant cache hit.
[2023-03-14 08:12:49] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-14 08:12:49] [INFO ] Invariant cache hit.
[2023-03-14 08:12:49] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:49] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-14 08:12:49] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 08:12:49] [INFO ] Invariant cache hit.
[2023-03-14 08:12:49] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 634 ms. Remains : 89/89 places, 99/99 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 p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-14 08:12:50] [INFO ] Invariant cache hit.
[2023-03-14 08:12:50] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-14 08:12:50] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:50] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-03-14 08:12:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:12:50] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-14 08:12:50] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:51] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-14 08:12:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:51] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 4 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2023-03-14 08:12:51] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-14 08:12:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
[2023-03-14 08:12:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 983 ms
[2023-03-14 08:12:52] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-14 08:12:52] [INFO ] Added : 74 causal constraints over 15 iterations in 285 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2369 reset in 239 ms.
Product exploration explored 100000 steps with 2352 reset in 271 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 99/99 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 98
Applied a total of 2 rules in 14 ms. Remains 88 /89 variables (removed 1) and now considering 98/99 (removed 1) transitions.
// Phase 1: matrix 98 rows 88 cols
[2023-03-14 08:12:52] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-14 08:12:53] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-14 08:12:53] [INFO ] Invariant cache hit.
[2023-03-14 08:12:53] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:53] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-14 08:12:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 08:12:53] [INFO ] Invariant cache hit.
[2023-03-14 08:12:53] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/89 places, 98/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 567 ms. Remains : 88/89 places, 98/99 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-07 finished in 10385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-14 08:12:53] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-14 08:12:53] [INFO ] Implicit Places using invariants in 247 ms returned [26, 65, 84, 85, 87, 99, 101, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 248 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 196/196 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 12 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-14 08:12:53] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-14 08:12:54] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-14 08:12:54] [INFO ] Invariant cache hit.
[2023-03-14 08:12:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:12:54] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 899 ms. Remains : 186/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (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: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s13 1) (EQ s71 1) (EQ s33 1) (EQ s47 1)), p1:(OR (EQ s35 0) (EQ s37 0) (EQ s46 0))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-08 finished in 1132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(p1)))))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-14 08:12:54] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-14 08:12:55] [INFO ] Implicit Places using invariants in 236 ms returned [26, 34, 38, 65, 84, 85, 87, 99, 101]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 239 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/196 places, 196/196 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
[2023-03-14 08:12:55] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 08:12:55] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-14 08:12:55] [INFO ] Invariant cache hit.
[2023-03-14 08:12:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:12:55] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 860 ms. Remains : 185/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-09 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s131 1) (EQ s132 1) (EQ s153 1)), p0:(NEQ s59 1)], 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 25000 reset in 384 ms.
Product exploration explored 100000 steps with 25000 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) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Finished Best-First random walk after 385 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=192 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-14 08:12:57] [INFO ] Invariant cache hit.
[2023-03-14 08:12:57] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-14 08:12:57] [INFO ] Invariant cache hit.
[2023-03-14 08:12:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:12:57] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-14 08:12:57] [INFO ] Invariant cache hit.
[2023-03-14 08:12:58] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 699 ms. Remains : 185/185 places, 194/194 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 p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Finished Best-First random walk after 535 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=267 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 227 ms.
Product exploration explored 100000 steps with 25000 reset in 294 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 185 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 35 place count 185 transition count 196
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 48 place count 185 transition count 196
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 56 place count 177 transition count 187
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 64 place count 177 transition count 187
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 104 place count 177 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 128 place count 153 transition count 163
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 152 place count 153 transition count 163
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 152 rules in 29 ms. Remains 153 /185 variables (removed 32) and now considering 163/194 (removed 31) transitions.
[2023-03-14 08:12:59] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 163 rows 153 cols
[2023-03-14 08:12:59] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:13:00] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/185 places, 163/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 153/185 places, 163/194 transitions.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:13:00] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:13:00] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-14 08:13:00] [INFO ] Invariant cache hit.
[2023-03-14 08:13:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:13:00] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-14 08:13:00] [INFO ] Invariant cache hit.
[2023-03-14 08:13:00] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 6036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 196 transition count 163
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 163 transition count 163
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 66 place count 163 transition count 152
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 152 transition count 152
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 134 place count 129 transition count 129
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 138 place count 127 transition count 127
Applied a total of 138 rules in 17 ms. Remains 127 /196 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 127 cols
[2023-03-14 08:13:00] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-14 08:13:00] [INFO ] Implicit Places using invariants in 134 ms returned [14, 19, 22, 39, 50, 51, 53, 65, 67, 97]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 135 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/196 places, 127/196 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 116 transition count 126
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 116 transition count 122
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 112 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 110 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 110 transition count 120
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 66 place count 84 transition count 94
Applied a total of 66 rules in 12 ms. Remains 84 /117 variables (removed 33) and now considering 94/127 (removed 33) transitions.
// Phase 1: matrix 94 rows 84 cols
[2023-03-14 08:13:00] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:13:01] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-14 08:13:01] [INFO ] Invariant cache hit.
[2023-03-14 08:13:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:01] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/196 places, 94/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 443 ms. Remains : 84/196 places, 94/196 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stack based approach found an accepted trace after 234 steps with 0 reset with depth 235 and stack size 235 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-10 finished in 645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-14 08:13:01] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-14 08:13:01] [INFO ] Implicit Places using invariants in 151 ms returned [26, 34, 38, 65, 84, 85, 99, 101, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 153 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/196 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 187/196 places, 196/196 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s81 1) (EQ s84 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-11 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-14 08:13:01] [INFO ] Invariant cache hit.
[2023-03-14 08:13:01] [INFO ] Implicit Places using invariants in 159 ms returned [26, 34, 38, 65, 84, 85, 87, 99, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 161 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/196 places, 196/196 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 7 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:13:01] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:13:01] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-14 08:13:01] [INFO ] Invariant cache hit.
[2023-03-14 08:13:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:13:02] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 591 ms. Remains : 185/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s92 0) (EQ s113 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 333 ms.
Product exploration explored 100000 steps with 25000 reset in 367 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-14 08:13:04] [INFO ] Invariant cache hit.
[2023-03-14 08:13:04] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-14 08:13:04] [INFO ] Invariant cache hit.
[2023-03-14 08:13:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:13:04] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-14 08:13:04] [INFO ] Invariant cache hit.
[2023-03-14 08:13:04] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 831 ms. Remains : 185/185 places, 194/194 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 335 ms.
Product exploration explored 100000 steps with 25000 reset in 367 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 185 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 38 place count 185 transition count 196
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 51 place count 185 transition count 196
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 175 transition count 185
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 175 transition count 185
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 110 place count 175 transition count 185
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 133 place count 152 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 156 place count 152 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 156 rules in 28 ms. Remains 152 /185 variables (removed 33) and now considering 162/194 (removed 32) transitions.
[2023-03-14 08:13:07] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 162 rows 152 cols
[2023-03-14 08:13:07] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 08:13:07] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/185 places, 162/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 152/185 places, 162/194 transitions.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:13:07] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:13:07] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-14 08:13:07] [INFO ] Invariant cache hit.
[2023-03-14 08:13:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:13:08] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-14 08:13:08] [INFO ] Invariant cache hit.
[2023-03-14 08:13:08] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1009 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-12 finished in 6625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 196 transition count 164
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 164 transition count 164
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 64 place count 164 transition count 153
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 86 place count 153 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 2 with 46 rules applied. Total rules applied 132 place count 130 transition count 130
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 136 place count 128 transition count 128
Applied a total of 136 rules in 20 ms. Remains 128 /196 variables (removed 68) and now considering 128/196 (removed 68) transitions.
// Phase 1: matrix 128 rows 128 cols
[2023-03-14 08:13:08] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-14 08:13:08] [INFO ] Implicit Places using invariants in 209 ms returned [14, 20, 23, 40, 52, 54, 66, 68, 98]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 211 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/196 places, 128/196 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 118 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 118 transition count 125
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 6 place count 116 transition count 125
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 52 place count 93 transition count 102
Applied a total of 52 rules in 13 ms. Remains 93 /119 variables (removed 26) and now considering 102/128 (removed 26) transitions.
// Phase 1: matrix 102 rows 93 cols
[2023-03-14 08:13:08] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:13:08] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-14 08:13:08] [INFO ] Invariant cache hit.
[2023-03-14 08:13:08] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:09] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/196 places, 102/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 731 ms. Remains : 93/196 places, 102/196 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-13 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s12 1), p1:(OR (EQ s40 0) (EQ s44 0) (EQ s75 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2229 reset in 215 ms.
Product exploration explored 100000 steps with 2237 reset in 246 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 p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 363 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1171 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=195 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 364 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 08:13:11] [INFO ] Invariant cache hit.
[2023-03-14 08:13:11] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-14 08:13:11] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:13:11] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-14 08:13:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:13:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-14 08:13:11] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-14 08:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:13:11] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-14 08:13:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:11] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2023-03-14 08:13:11] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-03-14 08:13:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2023-03-14 08:13:11] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2023-03-14 08:13:11] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-03-14 08:13:11] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-14 08:13:12] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2023-03-14 08:13:13] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2023-03-14 08:13:13] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2023-03-14 08:13:13] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2023-03-14 08:13:13] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2023-03-14 08:13:13] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1685 ms
[2023-03-14 08:13:13] [INFO ] Computed and/alt/rep : 99/245/99 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-14 08:13:13] [INFO ] Added : 79 causal constraints over 16 iterations in 319 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-14 08:13:13] [INFO ] Invariant cache hit.
[2023-03-14 08:13:13] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-14 08:13:13] [INFO ] Invariant cache hit.
[2023-03-14 08:13:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:14] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-14 08:13:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:13:14] [INFO ] Invariant cache hit.
[2023-03-14 08:13:14] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 93/93 places, 102/102 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 p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2647 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=240 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 386 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 08:13:15] [INFO ] Invariant cache hit.
[2023-03-14 08:13:15] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-14 08:13:15] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:13:15] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-14 08:13:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:13:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 18 ms returned sat
[2023-03-14 08:13:15] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:13:16] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-14 08:13:16] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 23 ms returned sat
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2023-03-14 08:13:16] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2023-03-14 08:13:17] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1575 ms
[2023-03-14 08:13:17] [INFO ] Computed and/alt/rep : 99/245/99 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-14 08:13:17] [INFO ] Added : 79 causal constraints over 16 iterations in 219 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2240 reset in 127 ms.
Product exploration explored 100000 steps with 2249 reset in 174 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-14 08:13:18] [INFO ] Invariant cache hit.
[2023-03-14 08:13:18] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-14 08:13:18] [INFO ] Invariant cache hit.
[2023-03-14 08:13:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:18] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-14 08:13:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:13:18] [INFO ] Invariant cache hit.
[2023-03-14 08:13:19] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 677 ms. Remains : 93/93 places, 102/102 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-13 finished in 10761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((X(p0) U p1) U p2)) U !F(p1)))'
Support contains 6 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-14 08:13:19] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-14 08:13:19] [INFO ] Implicit Places using invariants in 251 ms returned [26, 34, 38, 65, 84, 87, 101, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 252 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 196/196 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 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-14 08:13:19] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:13:19] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-14 08:13:19] [INFO ] Invariant cache hit.
[2023-03-14 08:13:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:13:19] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 781 ms. Remains : 186/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 299 ms :[p1, (NOT p2), false, (OR (NOT p0) (NOT p1)), true, (AND (NOT p0) p1), p1]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s80 1) (EQ s83 1)), p2:(AND (EQ s92 1) (EQ s111 1)), p0:(AND (EQ s14 1) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 107 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-14 finished in 1112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((p1||G(p2))))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-14 08:13:20] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-14 08:13:20] [INFO ] Implicit Places using invariants in 208 ms returned [34, 38, 84, 85, 87, 99, 101, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 224 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 196/196 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 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-14 08:13:20] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-14 08:13:20] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-14 08:13:20] [INFO ] Invariant cache hit.
[2023-03-14 08:13:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:13:21] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 876 ms. Remains : 186/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s63 1) (EQ s70 1) (EQ s26 1) (EQ s28 1)), p1:(AND (EQ s174 1) (EQ s181 1)), p2:(AND (EQ s26 1) (EQ s28 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][false, false, 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-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-15 finished in 1198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((!p0||F(!p1)))) U (p0||F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(p1)))))))'
Found a Shortening insensitive property : ParamProductionCell-PT-5-LTLFireability-09
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 196 transition count 166
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 166 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 164 transition count 164
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 64 place count 164 transition count 154
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 84 place count 154 transition count 154
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 126 place count 133 transition count 133
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 130 place count 131 transition count 131
Applied a total of 130 rules in 20 ms. Remains 131 /196 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 131 cols
[2023-03-14 08:13:21] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-14 08:13:22] [INFO ] Implicit Places using invariants in 247 ms returned [15, 20, 23, 40, 52, 53, 55, 67, 69]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 249 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 122/196 places, 131/196 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 122 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 121 transition count 130
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2 place count 121 transition count 123
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 114 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 112 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 112 transition count 121
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 62 place count 91 transition count 100
Applied a total of 62 rules in 15 ms. Remains 91 /122 variables (removed 31) and now considering 100/131 (removed 31) transitions.
// Phase 1: matrix 100 rows 91 cols
[2023-03-14 08:13:22] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:13:22] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-14 08:13:22] [INFO ] Invariant cache hit.
[2023-03-14 08:13:22] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:22] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 91/196 places, 100/196 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 730 ms. Remains : 91/196 places, 100/196 transitions.
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-09 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s64 1) (EQ s65 1) (EQ s76 1)), p0:(NEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 259 ms.
Product exploration explored 100000 steps with 25000 reset in 289 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2419 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=241 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 08:13:24] [INFO ] Invariant cache hit.
[2023-03-14 08:13:24] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-14 08:13:24] [INFO ] Invariant cache hit.
[2023-03-14 08:13:24] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:24] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-14 08:13:24] [INFO ] Invariant cache hit.
[2023-03-14 08:13:24] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 91/91 places, 100/100 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 p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4377 steps, including 1 resets, run visited all 2 properties in 13 ms. (steps per millisecond=336 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 151 ms.
Product exploration explored 100000 steps with 25000 reset in 171 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 08:13:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:13:26] [INFO ] Invariant cache hit.
[2023-03-14 08:13:26] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 91/91 places, 100/100 transitions.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 08:13:26] [INFO ] Invariant cache hit.
[2023-03-14 08:13:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-14 08:13:26] [INFO ] Invariant cache hit.
[2023-03-14 08:13:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:26] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-14 08:13:26] [INFO ] Invariant cache hit.
[2023-03-14 08:13:26] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 91/91 places, 100/100 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 5112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ParamProductionCell-PT-5-LTLFireability-12
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 196 transition count 163
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 163 transition count 163
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 66 place count 163 transition count 152
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 152 transition count 152
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 134 place count 129 transition count 129
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 138 place count 127 transition count 127
Applied a total of 138 rules in 9 ms. Remains 127 /196 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 127 cols
[2023-03-14 08:13:26] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-14 08:13:27] [INFO ] Implicit Places using invariants in 168 ms returned [14, 19, 22, 39, 50, 51, 53, 65, 97]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 170 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 118/196 places, 127/196 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 118 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 117 transition count 126
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 117 transition count 122
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 113 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 111 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 111 transition count 120
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 58 place count 89 transition count 98
Applied a total of 58 rules in 8 ms. Remains 89 /118 variables (removed 29) and now considering 98/127 (removed 29) transitions.
// Phase 1: matrix 98 rows 89 cols
[2023-03-14 08:13:27] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 08:13:27] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-14 08:13:27] [INFO ] Invariant cache hit.
[2023-03-14 08:13:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:27] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 89/196 places, 98/196 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 458 ms. Remains : 89/196 places, 98/196 transitions.
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s46 0) (EQ s57 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 162 ms.
Product exploration explored 100000 steps with 25000 reset in 185 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-14 08:13:28] [INFO ] Invariant cache hit.
[2023-03-14 08:13:28] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-14 08:13:28] [INFO ] Invariant cache hit.
[2023-03-14 08:13:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:29] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-14 08:13:29] [INFO ] Invariant cache hit.
[2023-03-14 08:13:29] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 89/89 places, 98/98 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 244 ms.
Product exploration explored 100000 steps with 25000 reset in 279 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-14 08:13:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:13:31] [INFO ] Invariant cache hit.
[2023-03-14 08:13:31] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 89/89 places, 98/98 transitions.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-14 08:13:31] [INFO ] Invariant cache hit.
[2023-03-14 08:13:31] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-14 08:13:31] [INFO ] Invariant cache hit.
[2023-03-14 08:13:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:13:31] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-14 08:13:31] [INFO ] Invariant cache hit.
[2023-03-14 08:13:31] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 89/89 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-12 finished in 5111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2023-03-14 08:13:31] [INFO ] Flatten gal took : 16 ms
[2023-03-14 08:13:31] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 08:13:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 196 places, 196 transitions and 700 arcs took 4 ms.
Total runtime 58252 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ParamProductionCell-PT-5
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA ParamProductionCell-PT-5-LTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-5-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-5-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-5-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678781614161

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:427
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ParamProductionCell-PT-5-LTLFireability-07
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ParamProductionCell-PT-5-LTLFireability-07
lola: result : true
lola: markings : 115484
lola: fired transitions : 258868
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 ParamProductionCell-PT-5-LTLFireability-12
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ParamProductionCell-PT-5-LTLFireability-12
lola: result : true
lola: markings : 44
lola: fired transitions : 85
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ParamProductionCell-PT-5-LTLFireability-09
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ParamProductionCell-PT-5-LTLFireability-09
lola: result : true
lola: markings : 44
lola: fired transitions : 85
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 12 (type EXCL) for 9 ParamProductionCell-PT-5-LTLFireability-13
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 12 (type EXCL) for ParamProductionCell-PT-5-LTLFireability-13
lola: result : true
lola: markings : 4952
lola: fired transitions : 8229
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 9 ParamProductionCell-PT-5-LTLFireability-13
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for ParamProductionCell-PT-5-LTLFireability-13
lola: result : false
lola: markings : 1069
lola: fired transitions : 1226
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-5-LTLFireability-07: LTL true LTL model checker
ParamProductionCell-PT-5-LTLFireability-09: LTL true LTL model checker
ParamProductionCell-PT-5-LTLFireability-12: LTL true LTL model checker
ParamProductionCell-PT-5-LTLFireability-13: CONJ false LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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