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.r265-smll-167863540000388.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 ltsminxred
Input is ParamProductionCell-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540000388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:15 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.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 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-3-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678989172918

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 17:52:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 17:52:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:52:55] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-16 17:52:55] [INFO ] Transformed 231 places.
[2023-03-16 17:52:55] [INFO ] Transformed 202 transitions.
[2023-03-16 17:52:55] [INFO ] Found NUPN structural information;
[2023-03-16 17:52:55] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-3-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 49 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-16 17:52:55] [INFO ] Computed 59 place invariants in 20 ms
[2023-03-16 17:52:56] [INFO ] Implicit Places using invariants in 444 ms returned [15, 16, 24, 35, 36, 42, 59, 64, 65, 73, 79, 99, 114, 119, 120, 161, 162, 164, 166, 167, 192, 193, 197, 202, 203]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 486 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/231 places, 198/202 transitions.
Applied a total of 0 rules in 12 ms. Remains 202 /202 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 548 ms. Remains : 202/231 places, 198/202 transitions.
Support contains 56 out of 202 places after structural reductions.
[2023-03-16 17:52:56] [INFO ] Flatten gal took : 72 ms
[2023-03-16 17:52:56] [INFO ] Flatten gal took : 27 ms
[2023-03-16 17:52:56] [INFO ] Input system was already deterministic with 198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 202 cols
[2023-03-16 17:52:57] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-16 17:52:57] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:52:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-16 17:52:57] [INFO ] [Nat]Absence check using 18 positive and 16 generalized place invariants in 10 ms returned sat
[2023-03-16 17:52:57] [INFO ] After 107ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ParamProductionCell-PT-3-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(X(G(p0))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 197
Applied a total of 2 rules in 16 ms. Remains 201 /202 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 201 cols
[2023-03-16 17:52:58] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-16 17:52:58] [INFO ] Implicit Places using invariants in 237 ms returned [16, 17, 28, 36, 40, 41, 68, 89, 102, 104, 173, 181, 192]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 239 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 197/198 transitions.
Applied a total of 0 rules in 6 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 262 ms. Remains : 188/202 places, 197/198 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s80 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-00 finished in 611 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((G(F(p0))&&F(p1))))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 16 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-16 17:52:58] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-16 17:52:58] [INFO ] Implicit Places using invariants in 205 ms returned [16, 17, 28, 40, 41, 68, 87, 89, 101, 103, 172, 180, 191]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 207 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 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-16 17:52:58] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 17:52:59] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-16 17:52:59] [INFO ] Invariant cache hit.
[2023-03-16 17:52:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:52:59] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 707 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (EQ s85 0) (EQ s122 0)) (OR (EQ s33 0) (EQ s46 0))), p1:(AND (EQ s85 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 59 reset in 373 ms.
Stack based approach found an accepted trace after 362 steps with 0 reset with depth 363 and stack size 363 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-01 finished in 1451 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&&(p1||(!p2 U p3))))))'
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 202 transition count 178
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 182 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 180 transition count 176
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 44 place count 180 transition count 160
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 76 place count 164 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 162 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 162 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 162 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 161 transition count 157
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 146 place count 129 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 128 transition count 124
Applied a total of 148 rules in 55 ms. Remains 128 /202 variables (removed 74) and now considering 124/198 (removed 74) transitions.
// Phase 1: matrix 124 rows 128 cols
[2023-03-16 17:53:00] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-16 17:53:00] [INFO ] Implicit Places using invariants in 151 ms returned [10, 11, 19, 25, 29, 30, 48, 59, 60, 70, 111, 121]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 152 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/202 places, 124/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 121
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 121
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 113 transition count 117
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 14 place count 109 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 107 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 107 transition count 115
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 46 place count 93 transition count 101
Applied a total of 46 rules in 16 ms. Remains 93 /116 variables (removed 23) and now considering 101/124 (removed 23) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-16 17:53:00] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-16 17:53:00] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-16 17:53:00] [INFO ] Invariant cache hit.
[2023-03-16 17:53:00] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:00] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/202 places, 101/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 534 ms. Remains : 93/202 places, 101/198 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0) (AND p1 p0) (AND p0 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) p2) (AND (NOT p3) (NOT p0) p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(AND (EQ s47 1) (EQ s55 1) (EQ s59 1)), p0:(OR (EQ s44 0) (EQ s48 0)), p1:(AND (EQ s44 1) (EQ s48 1)), p2:(AND (EQ s83 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1415 reset in 334 ms.
Stack based approach found an accepted trace after 6210 steps with 88 reset with depth 95 and stack size 95 in 30 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-02 finished in 1037 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||X(X((p1||G(p2))))))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 13 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-16 17:53:01] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-16 17:53:01] [INFO ] Implicit Places using invariants in 180 ms returned [16, 17, 28, 36, 41, 68, 87, 89, 101, 103, 172, 180, 191]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 184 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 11 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 17:53:01] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 17:53:01] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-16 17:53:01] [INFO ] Invariant cache hit.
[2023-03-16 17:53:01] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:01] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 661 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ 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 s36 1) (EQ s44 1)), p1:(AND (EQ s132 1) (EQ s155 1)), p2:(OR (EQ s6 0) (EQ s115 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, 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 23 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-04 finished in 1049 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(F(p0))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 9 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-16 17:53:02] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-16 17:53:02] [INFO ] Implicit Places using invariants in 169 ms returned [16, 28, 36, 40, 41, 68, 87, 89, 101, 103, 172, 180, 191]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 173 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 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-16 17:53:02] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 17:53:02] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-16 17:53:02] [INFO ] Invariant cache hit.
[2023-03-16 17:53:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:02] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 707 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-05 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: 1}]], initial=2, aps=[p0:(OR (EQ s16 0) (EQ s17 0) (EQ s23 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Product exploration explored 100000 steps with 33333 reset in 327 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, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLFireability-05 finished in 1486 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 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 202 transition count 174
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 178 transition count 174
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 48 place count 178 transition count 160
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 76 place count 164 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 162 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 162 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 162 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 161 transition count 157
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 144 place count 130 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 129 transition count 125
Applied a total of 146 rules in 32 ms. Remains 129 /202 variables (removed 73) and now considering 125/198 (removed 73) transitions.
// Phase 1: matrix 125 rows 129 cols
[2023-03-16 17:53:03] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-16 17:53:03] [INFO ] Implicit Places using invariants in 208 ms returned [10, 11, 19, 25, 29, 30, 48, 59, 60, 70, 72, 112, 115, 122]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 210 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/202 places, 125/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 112 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 112 transition count 118
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 14 place count 108 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 106 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 106 transition count 116
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 60 place count 85 transition count 95
Applied a total of 60 rules in 19 ms. Remains 85 /115 variables (removed 30) and now considering 95/125 (removed 30) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-16 17:53:03] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-16 17:53:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-16 17:53:04] [INFO ] Invariant cache hit.
[2023-03-16 17:53:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:04] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/202 places, 95/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 606 ms. Remains : 85/202 places, 95/198 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-06 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 s66 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 138 ms.
Stack based approach found an accepted trace after 153 steps with 0 reset with depth 154 and stack size 154 in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-06 finished in 794 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 (G(X(p1)) U p2)))'
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 4 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-16 17:53:04] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-16 17:53:04] [INFO ] Implicit Places using invariants in 198 ms returned [16, 17, 28, 36, 40, 41, 68, 87, 89, 103, 180, 191]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 200 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 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-16 17:53:04] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-16 17:53:04] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-16 17:53:04] [INFO ] Invariant cache hit.
[2023-03-16 17:53:05] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:05] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 689 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s159 1) (EQ s160 1) (EQ s169 1)), p0:(OR (AND (EQ s108 1) (EQ s112 1)) (AND (EQ s159 1) (EQ s160 1) (EQ s169 1))), p1:(AND (EQ s91 1) (EQ s110...], 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 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-07 finished in 978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(((G(p1)||X(X(G(p2)))) U p0)))))'
Support contains 2 out of 202 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 : 202/202 places, 198/198 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 202 transition count 174
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 178 transition count 174
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 48 place count 178 transition count 161
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 165 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 163 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 163 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 163 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 162 transition count 158
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 128 place count 138 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 137 transition count 133
Applied a total of 130 rules in 70 ms. Remains 137 /202 variables (removed 65) and now considering 133/198 (removed 65) transitions.
// Phase 1: matrix 133 rows 137 cols
[2023-03-16 17:53:05] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-16 17:53:05] [INFO ] Implicit Places using invariants in 189 ms returned [11, 12, 20, 26, 30, 31, 49, 60, 72, 74, 120, 123, 130]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 193 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/202 places, 133/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 131
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 122 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 121 transition count 130
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 121 transition count 128
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 10 place count 119 transition count 128
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 48 place count 100 transition count 109
Applied a total of 48 rules in 20 ms. Remains 100 /124 variables (removed 24) and now considering 109/133 (removed 24) transitions.
// Phase 1: matrix 109 rows 100 cols
[2023-03-16 17:53:05] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:53:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-16 17:53:05] [INFO ] Invariant cache hit.
[2023-03-16 17:53:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:06] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/202 places, 109/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 612 ms. Remains : 100/202 places, 109/198 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1328 reset in 133 ms.
Product exploration explored 100000 steps with 1322 reset in 153 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-16 17:53:06] [INFO ] Invariant cache hit.
[2023-03-16 17:53:06] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-16 17:53:06] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:07] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-16 17:53:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-16 17:53:07] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:53:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:07] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-16 17:53:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:07] [INFO ] [Nat]Added 67 Read/Feed constraints in 19 ms returned sat
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 6 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-16 17:53:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 609 ms
[2023-03-16 17:53:07] [INFO ] Computed and/alt/rep : 100/241/100 causal constraints (skipped 7 transitions) in 10 ms.
[2023-03-16 17:53:08] [INFO ] Added : 84 causal constraints over 17 iterations in 244 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 100 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 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-16 17:53:08] [INFO ] Invariant cache hit.
[2023-03-16 17:53:08] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-16 17:53:08] [INFO ] Invariant cache hit.
[2023-03-16 17:53:08] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:08] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-16 17:53:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:53:08] [INFO ] Invariant cache hit.
[2023-03-16 17:53:08] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 419 ms. Remains : 100/100 places, 109/109 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 93 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=31 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-16 17:53:08] [INFO ] Invariant cache hit.
[2023-03-16 17:53:09] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 17:53:09] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:53:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:09] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-16 17:53:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 17:53:09] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:53:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:09] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-16 17:53:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:09] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2023-03-16 17:53:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 501 ms
[2023-03-16 17:53:09] [INFO ] Computed and/alt/rep : 100/241/100 causal constraints (skipped 7 transitions) in 10 ms.
[2023-03-16 17:53:10] [INFO ] Added : 84 causal constraints over 17 iterations in 223 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1323 reset in 137 ms.
Product exploration explored 100000 steps with 1323 reset in 151 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 109/109 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 100 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 98 transition count 107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 90 transition count 99
Applied a total of 20 rules in 10 ms. Remains 90 /100 variables (removed 10) and now considering 99/109 (removed 10) transitions.
// Phase 1: matrix 99 rows 90 cols
[2023-03-16 17:53:10] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-16 17:53:10] [INFO ] Implicit Places using invariants in 125 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/100 places, 99/109 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 85 transition count 95
Applied a total of 8 rules in 5 ms. Remains 85 /89 variables (removed 4) and now considering 95/99 (removed 4) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-16 17:53:10] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 17:53:10] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-16 17:53:10] [INFO ] Invariant cache hit.
[2023-03-16 17:53:10] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:10] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/100 places, 95/109 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 85/100 places, 95/109 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-08 finished in 5351 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(F((X(G((p1||X(F(p2)))))&&p0)))))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 197
Applied a total of 2 rules in 5 ms. Remains 201 /202 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 201 cols
[2023-03-16 17:53:10] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-16 17:53:11] [INFO ] Implicit Places using invariants in 166 ms returned [16, 17, 28, 36, 40, 41, 68, 87, 101, 103, 173, 181, 192]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 168 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 197/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 188/202 places, 197/198 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s85 1) (EQ s108 1)), p1:(AND (EQ s81 1) (EQ s130 1)), p2:(OR (EQ s85 0) (EQ s143 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 128 ms.
Stack based approach found an accepted trace after 218 steps with 0 reset with depth 219 and stack size 219 in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-10 finished in 597 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(((G(F(!p0))||G(p1)) U X(p2))))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 6 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-16 17:53:11] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-16 17:53:11] [INFO ] Implicit Places using invariants in 198 ms returned [16, 17, 28, 36, 40, 68, 87, 89, 101, 103, 172, 180]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 200 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 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 7 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-16 17:53:11] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 17:53:11] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-16 17:53:11] [INFO ] Invariant cache hit.
[2023-03-16 17:53:11] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:12] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 680 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p1) p0 (NOT p2)), p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s162 1) (EQ s177 1) (EQ s183 1) (EQ s36 1) (EQ s43 1)), p0:(AND (EQ s162 1) (EQ s177 1) (EQ s183 1)), p2:(AND (EQ s36 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 778 reset in 128 ms.
Product exploration explored 100000 steps with 779 reset in 149 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 795 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), p0, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 17:53:14] [INFO ] Invariant cache hit.
[2023-03-16 17:53:14] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 17 factoid took 1000 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-16 17:53:15] [INFO ] Invariant cache hit.
[2023-03-16 17:53:15] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-16 17:53:15] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 17:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:15] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2023-03-16 17:53:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-16 17:53:16] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 17:53:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:16] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-03-16 17:53:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:16] [INFO ] [Nat]Added 68 Read/Feed constraints in 19 ms returned sat
[2023-03-16 17:53:16] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:53:16] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-16 17:53:16] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2023-03-16 17:53:16] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-16 17:53:16] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-16 17:53:16] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 4 ms to minimize.
[2023-03-16 17:53:16] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2023-03-16 17:53:16] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-16 17:53:17] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2023-03-16 17:53:17] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-16 17:53:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 837 ms
[2023-03-16 17:53:17] [INFO ] Computed and/alt/rep : 191/311/191 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-16 17:53:17] [INFO ] Added : 180 causal constraints over 36 iterations in 798 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 186 transition count 157
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 149 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 148 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 76 place count 148 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 100 place count 136 transition count 144
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 184 place count 94 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 93 transition count 101
Applied a total of 186 rules in 16 ms. Remains 93 /186 variables (removed 93) and now considering 101/194 (removed 93) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-16 17:53:17] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-16 17:53:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-16 17:53:18] [INFO ] Invariant cache hit.
[2023-03-16 17:53:18] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:18] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-16 17:53:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:53:18] [INFO ] Invariant cache hit.
[2023-03-16 17:53:18] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/186 places, 101/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 93/186 places, 101/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 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 333 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), p0, p0]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 8 factoid took 410 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-16 17:53:19] [INFO ] Invariant cache hit.
[2023-03-16 17:53:19] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-16 17:53:19] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:53:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:19] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-16 17:53:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-16 17:53:19] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:53:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:19] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-16 17:53:19] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:19] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-16 17:53:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 4 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:53:20] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:53:21] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2023-03-16 17:53:21] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:53:21] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2023-03-16 17:53:21] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1240 ms
[2023-03-16 17:53:21] [INFO ] Computed and/alt/rep : 99/225/99 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 17:53:21] [INFO ] Added : 91 causal constraints over 19 iterations in 249 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), p0, p0]
Product exploration explored 100000 steps with 1790 reset in 144 ms.
Product exploration explored 100000 steps with 1714 reset in 167 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-16 17:53:21] [INFO ] Invariant cache hit.
[2023-03-16 17:53:22] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-16 17:53:22] [INFO ] Invariant cache hit.
[2023-03-16 17:53:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:22] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-16 17:53:22] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 17:53:22] [INFO ] Invariant cache hit.
[2023-03-16 17:53:22] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 487 ms. Remains : 93/93 places, 101/101 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-11 finished in 10994 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 G((p0||G(p1))))||X(G(p2)))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 5 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-16 17:53:22] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-16 17:53:22] [INFO ] Implicit Places using invariants in 195 ms returned [16, 17, 36, 40, 41, 68, 87, 101, 103, 172, 180, 191]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 196 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 204 ms. Remains : 188/202 places, 196/198 transitions.
Stuttering acceptance computed with spot in 622 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), false, p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(NOT p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 11}, { cond=(AND p0 p2), acceptance={} source=3 dest: 12}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 13}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 14}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 15}, { cond=(AND p0 p2), acceptance={} source=5 dest: 16}], [{ cond=p0, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(OR p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={1} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}, { cond=p0, acceptance={} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(AND p0 p1), acceptance={} source=9 dest: 13}], [{ cond=p0, acceptance={} source=10 dest: 15}], [{ cond=true, acceptance={0, 1} source=11 dest: 11}], [{ cond=(NOT p2), acceptance={} source=12 dest: 11}, { cond=p2, acceptance={} source=12 dest: 12}], [{ cond=(NOT p1), acceptance={} source=13 dest: 11}, { cond=p1, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 12}, { cond=(AND p1 (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(AND p1 p2), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 13}, { cond=p0, acceptance={} source=15 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=16 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=16 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=16 dest: 13}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=16 dest: 14}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s28 1)), p1:(AND (EQ s80 1) (EQ s130 1)), p2:(AND (EQ s80 1) (EQ s82 1) (EQ s107 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25015 reset in 230 ms.
Product exploration explored 100000 steps with 24911 reset in 247 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) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 917 ms. Reduced automaton from 17 states, 55 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 188 cols
[2023-03-16 17:53:25] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 17:53:25] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-16 17:53:25] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 17:53:25] [INFO ] After 100ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 17:53:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:25] [INFO ] After 29ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:53:25] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:53:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-16 17:53:25] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 17:53:25] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 17:53:25] [INFO ] After 25ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 17:53:25] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 3 ms to minimize.
[2023-03-16 17:53:25] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2023-03-16 17:53:25] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2023-03-16 17:53:25] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-16 17:53:25] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2023-03-16 17:53:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 306 ms
[2023-03-16 17:53:25] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-16 17:53:25] [INFO ] After 503ms 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 p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F p0), (F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 959 ms. Reduced automaton from 8 states, 24 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-16 17:53:27] [INFO ] Invariant cache hit.
[2023-03-16 17:53:27] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-16 17:53:27] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 17:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:27] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2023-03-16 17:53:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-16 17:53:27] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 17:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:27] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2023-03-16 17:53:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:27] [INFO ] [Nat]Added 68 Read/Feed constraints in 21 ms returned sat
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2023-03-16 17:53:28] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2023-03-16 17:53:29] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2023-03-16 17:53:29] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:53:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1107 ms
[2023-03-16 17:53:29] [INFO ] Computed and/alt/rep : 186/327/186 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-16 17:53:29] [INFO ] Added : 180 causal constraints over 36 iterations in 728 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-16 17:53:29] [INFO ] Invariant cache hit.
[2023-03-16 17:53:29] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-16 17:53:29] [INFO ] Invariant cache hit.
[2023-03-16 17:53:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:30] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-03-16 17:53:30] [INFO ] Invariant cache hit.
[2023-03-16 17:53:30] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 652 ms. Remains : 188/188 places, 196/196 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 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 543 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Finished random walk after 175 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))), (F (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 783 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-16 17:53:32] [INFO ] Invariant cache hit.
[2023-03-16 17:53:32] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-16 17:53:32] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:32] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2023-03-16 17:53:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-16 17:53:32] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 17:53:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:33] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2023-03-16 17:53:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:33] [INFO ] [Nat]Added 68 Read/Feed constraints in 21 ms returned sat
[2023-03-16 17:53:33] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-16 17:53:33] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2023-03-16 17:53:33] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:53:33] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-16 17:53:33] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:53:33] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-16 17:53:33] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-03-16 17:53:33] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2023-03-16 17:53:33] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2023-03-16 17:53:34] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-16 17:53:34] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:53:34] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2023-03-16 17:53:34] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:53:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1111 ms
[2023-03-16 17:53:34] [INFO ] Computed and/alt/rep : 186/327/186 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-16 17:53:35] [INFO ] Added : 180 causal constraints over 36 iterations in 711 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33295 reset in 239 ms.
Product exploration explored 100000 steps with 33205 reset in 258 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 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 188 transition count 196
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 35 place count 188 transition count 198
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 49 place count 188 transition count 198
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 179 transition count 188
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 179 transition count 188
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 110 place count 179 transition count 188
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 135 place count 154 transition count 163
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 160 place count 154 transition count 163
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 160 rules in 45 ms. Remains 154 /188 variables (removed 34) and now considering 163/196 (removed 33) transitions.
[2023-03-16 17:53:36] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 163 rows 154 cols
[2023-03-16 17:53:36] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 17:53:36] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/188 places, 163/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 154/188 places, 163/196 transitions.
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 188 cols
[2023-03-16 17:53:36] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-16 17:53:36] [INFO ] Implicit Places using invariants in 141 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/188 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 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 17:53:36] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:53:36] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-16 17:53:36] [INFO ] Invariant cache hit.
[2023-03-16 17:53:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:36] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/188 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 588 ms. Remains : 185/188 places, 194/196 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-13 finished in 14545 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 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 10 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-16 17:53:37] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-16 17:53:37] [INFO ] Implicit Places using invariants in 161 ms returned [16, 17, 28, 40, 41, 68, 87, 89, 101, 103, 180, 191]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 162 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 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 6 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-16 17:53:37] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 17:53:37] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-16 17:53:37] [INFO ] Invariant cache hit.
[2023-03-16 17:53:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:53:37] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 688 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-14 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:(OR (AND (EQ s160 1) (EQ s168 1)) (AND (EQ s32 1) (EQ s33 1) (EQ s38 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-3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-14 finished in 792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(((G(p1)||X(X(G(p2)))) U p0)))))'
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(((G(F(!p0))||G(p1)) U X(p2))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-3-LTLFireability-11
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p1) p0 (NOT p2)), p0, p0, (AND p0 (NOT p1))]
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 202 transition count 176
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 180 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 179 transition count 175
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 46 place count 179 transition count 161
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 74 place count 165 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 163 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 163 transition count 159
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 163 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 162 transition count 158
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 144 place count 130 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 129 transition count 125
Applied a total of 146 rules in 21 ms. Remains 129 /202 variables (removed 73) and now considering 125/198 (removed 73) transitions.
// Phase 1: matrix 125 rows 129 cols
[2023-03-16 17:53:38] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-16 17:53:38] [INFO ] Implicit Places using invariants in 303 ms returned [10, 11, 19, 25, 29, 48, 59, 60, 70, 72, 111, 114]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 305 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/202 places, 125/198 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 124
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 124
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 120
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 120
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 110 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 110 transition count 118
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 93 transition count 101
Applied a total of 48 rules in 11 ms. Remains 93 /117 variables (removed 24) and now considering 101/125 (removed 24) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-16 17:53:38] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-16 17:53:38] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-16 17:53:38] [INFO ] Invariant cache hit.
[2023-03-16 17:53:38] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:38] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 93/202 places, 101/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 619 ms. Remains : 93/202 places, 101/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s81 1) (EQ s87 1) (EQ s90 1) (EQ s19 1) (EQ s25 1)), p0:(AND (EQ s81 1) (EQ s87 1) (EQ s90 1)), p2:(AND (EQ s19 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1867 reset in 137 ms.
Product exploration explored 100000 steps with 1905 reset in 158 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 746 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), p0, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 17:53:40] [INFO ] Invariant cache hit.
[2023-03-16 17:53:40] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 17 factoid took 976 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-16 17:53:41] [INFO ] Invariant cache hit.
[2023-03-16 17:53:41] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-16 17:53:41] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:41] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-16 17:53:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-16 17:53:41] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:42] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-16 17:53:42] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:42] [INFO ] [Nat]Added 67 Read/Feed constraints in 9 ms returned sat
[2023-03-16 17:53:42] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-16 17:53:42] [INFO ] Computed and/alt/rep : 99/225/99 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 17:53:42] [INFO ] Added : 9 causal constraints over 2 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-16 17:53:42] [INFO ] Invariant cache hit.
[2023-03-16 17:53:42] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-16 17:53:42] [INFO ] Invariant cache hit.
[2023-03-16 17:53:42] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:42] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-16 17:53:42] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 17:53:42] [INFO ] Invariant cache hit.
[2023-03-16 17:53:42] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 93/93 places, 101/101 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 p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 375 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), p0, p0]
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 8 factoid took 404 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-16 17:53:43] [INFO ] Invariant cache hit.
[2023-03-16 17:53:43] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-16 17:53:43] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:44] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-16 17:53:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-16 17:53:44] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:53:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:44] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-16 17:53:44] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:44] [INFO ] [Nat]Added 67 Read/Feed constraints in 10 ms returned sat
[2023-03-16 17:53:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-16 17:53:44] [INFO ] Computed and/alt/rep : 99/225/99 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 17:53:44] [INFO ] Added : 9 causal constraints over 2 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), p0, p0]
Product exploration explored 100000 steps with 1760 reset in 135 ms.
Product exploration explored 100000 steps with 1676 reset in 158 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-16 17:53:44] [INFO ] Invariant cache hit.
[2023-03-16 17:53:44] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-16 17:53:44] [INFO ] Invariant cache hit.
[2023-03-16 17:53:44] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:45] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-16 17:53:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 17:53:45] [INFO ] Invariant cache hit.
[2023-03-16 17:53:45] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 428 ms. Remains : 93/93 places, 101/101 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-11 finished in 7277 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 G((p0||G(p1))))||X(G(p2)))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-3-LTLFireability-13
Stuttering acceptance computed with spot in 605 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), false, p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 202 transition count 174
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 178 transition count 174
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 48 place count 178 transition count 160
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 76 place count 164 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 162 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 162 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 162 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 161 transition count 157
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 130 place count 137 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 136 transition count 132
Applied a total of 132 rules in 18 ms. Remains 136 /202 variables (removed 66) and now considering 132/198 (removed 66) transitions.
// Phase 1: matrix 132 rows 136 cols
[2023-03-16 17:53:45] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-16 17:53:46] [INFO ] Implicit Places using invariants in 129 ms returned [10, 11, 25, 29, 30, 48, 59, 71, 73, 119, 122, 129]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 130 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/202 places, 132/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 130
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 122 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 121 transition count 129
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 126
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 118 transition count 126
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 48 place count 100 transition count 108
Applied a total of 48 rules in 6 ms. Remains 100 /124 variables (removed 24) and now considering 108/132 (removed 24) transitions.
// Phase 1: matrix 108 rows 100 cols
[2023-03-16 17:53:46] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 17:53:46] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-16 17:53:46] [INFO ] Invariant cache hit.
[2023-03-16 17:53:46] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:46] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 100/202 places, 108/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 474 ms. Remains : 100/202 places, 108/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(NOT p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 11}, { cond=(AND p0 p2), acceptance={} source=3 dest: 12}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 13}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 14}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 15}, { cond=(AND p0 p2), acceptance={} source=5 dest: 16}], [{ cond=p0, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(OR p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={1} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}, { cond=p0, acceptance={} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(AND p0 p1), acceptance={} source=9 dest: 13}], [{ cond=p0, acceptance={} source=10 dest: 15}], [{ cond=true, acceptance={0, 1} source=11 dest: 11}], [{ cond=(NOT p2), acceptance={} source=12 dest: 11}, { cond=p2, acceptance={} source=12 dest: 12}], [{ cond=(NOT p1), acceptance={} source=13 dest: 11}, { cond=p1, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 12}, { cond=(AND p1 (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(AND p1 p2), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 13}, { cond=p0, acceptance={} source=15 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=16 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=16 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=16 dest: 13}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=16 dest: 14}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s15 1)), p1:(AND (EQ s40 1) (EQ s71 1)), p2:(AND (EQ s40 1) (EQ s41 1) (EQ s58 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25042 reset in 183 ms.
Product exploration explored 100000 steps with 24920 reset in 203 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) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 825 ms. Reduced automaton from 17 states, 55 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 17:53:48] [INFO ] Invariant cache hit.
[2023-03-16 17:53:48] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-16 17:53:48] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:53:48] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:53:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-16 17:53:48] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:53:48] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 17:53:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:48] [INFO ] After 16ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 17:53:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:53:48] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-16 17:53:48] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-16 17:53:48] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2023-03-16 17:53:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 200 ms
[2023-03-16 17:53:48] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-16 17:53:48] [INFO ] After 319ms 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 p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F p0), (F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 932 ms. Reduced automaton from 8 states, 24 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-16 17:53:49] [INFO ] Invariant cache hit.
[2023-03-16 17:53:49] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-03-16 17:53:49] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:49] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-16 17:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-16 17:53:50] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:50] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-16 17:53:50] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:50] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-16 17:53:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 594 ms
[2023-03-16 17:53:50] [INFO ] Computed and/alt/rep : 99/242/99 causal constraints (skipped 7 transitions) in 9 ms.
[2023-03-16 17:53:50] [INFO ] Added : 85 causal constraints over 17 iterations in 210 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-16 17:53:50] [INFO ] Invariant cache hit.
[2023-03-16 17:53:51] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-16 17:53:51] [INFO ] Invariant cache hit.
[2023-03-16 17:53:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:51] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-16 17:53:51] [INFO ] Invariant cache hit.
[2023-03-16 17:53:51] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 100/100 places, 108/108 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 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 529 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Finished random walk after 90 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))), (F (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 760 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-16 17:53:53] [INFO ] Invariant cache hit.
[2023-03-16 17:53:53] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-16 17:53:53] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:53] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-16 17:53:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:53:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-16 17:53:53] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:53:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:53:53] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-16 17:53:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:53:53] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-16 17:53:53] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:53:53] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-16 17:53:53] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2023-03-16 17:53:53] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-16 17:53:53] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-16 17:53:53] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:53:54] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2023-03-16 17:53:54] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:53:54] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:53:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:53:54] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2023-03-16 17:53:54] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2023-03-16 17:53:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-16 17:53:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 602 ms
[2023-03-16 17:53:54] [INFO ] Computed and/alt/rep : 99/242/99 causal constraints (skipped 7 transitions) in 9 ms.
[2023-03-16 17:53:54] [INFO ] Added : 85 causal constraints over 17 iterations in 211 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33340 reset in 184 ms.
Product exploration explored 100000 steps with 33436 reset in 199 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 108/108 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 100 transition count 108
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-16 17:53:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 108 rows 100 cols
[2023-03-16 17:53:55] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 17:53:55] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 108/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 100/100 places, 108/108 transitions.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 100 cols
[2023-03-16 17:53:55] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-16 17:53:55] [INFO ] Implicit Places using invariants in 118 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/100 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 99/100 places, 108/108 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-13 finished in 10438 ms.
[2023-03-16 17:53:55] [INFO ] Flatten gal took : 18 ms
[2023-03-16 17:53:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-16 17:53:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 202 places, 198 transitions and 714 arcs took 3 ms.
Total runtime 60258 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2976/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2976/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2976/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ParamProductionCell-PT-3-LTLFireability-08
Could not compute solution for formula : ParamProductionCell-PT-3-LTLFireability-11
Could not compute solution for formula : ParamProductionCell-PT-3-LTLFireability-13

BK_STOP 1678989237615

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ParamProductionCell-PT-3-LTLFireability-08
ltl formula formula --ltl=/tmp/2976/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 202 places, 198 transitions and 714 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2976/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2976/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2976/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2976/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55fc099e63f4]
1: pnml2lts-mc(+0xa2496) [0x55fc099e6496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f26fd63d140]
3: pnml2lts-mc(+0x405be5) [0x55fc09d49be5]
4: pnml2lts-mc(+0x16b3f9) [0x55fc09aaf3f9]
5: pnml2lts-mc(+0x164ac4) [0x55fc09aa8ac4]
6: pnml2lts-mc(+0x272e0a) [0x55fc09bb6e0a]
7: pnml2lts-mc(+0xb61f0) [0x55fc099fa1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f26fd4904d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f26fd49067a]
10: pnml2lts-mc(+0xa1581) [0x55fc099e5581]
11: pnml2lts-mc(+0xa1910) [0x55fc099e5910]
12: pnml2lts-mc(+0xa32a2) [0x55fc099e72a2]
13: pnml2lts-mc(+0xa50f4) [0x55fc099e90f4]
14: pnml2lts-mc(+0x3f34b3) [0x55fc09d374b3]
15: pnml2lts-mc(+0x7c63d) [0x55fc099c063d]
16: pnml2lts-mc(+0x67d86) [0x55fc099abd86]
17: pnml2lts-mc(+0x60a8a) [0x55fc099a4a8a]
18: pnml2lts-mc(+0x5eb15) [0x55fc099a2b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f26fd478d0a]
20: pnml2lts-mc(+0x6075e) [0x55fc099a475e]
ltl formula name ParamProductionCell-PT-3-LTLFireability-11
ltl formula formula --ltl=/tmp/2976/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 202 places, 198 transitions and 714 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2976/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2976/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2976/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2976/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ParamProductionCell-PT-3-LTLFireability-13
ltl formula formula --ltl=/tmp/2976/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 202 places, 198 transitions and 714 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2976/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2976/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2976/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2976/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 18 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ParamProductionCell-PT-3, 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 r265-smll-167863540000388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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