Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:13 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.5K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:14 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 149K 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-0-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678780081131

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 07:48:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 07:48:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:48:03] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2023-03-14 07:48:03] [INFO ] Transformed 198 places.
[2023-03-14 07:48:03] [INFO ] Transformed 176 transitions.
[2023-03-14 07:48:03] [INFO ] Found NUPN structural information;
[2023-03-14 07:48:03] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-0-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 193 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 193 transition count 171
Applied a total of 10 rules in 47 ms. Remains 193 /198 variables (removed 5) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 193 cols
[2023-03-14 07:48:04] [INFO ] Computed 49 place invariants in 21 ms
[2023-03-14 07:48:04] [INFO ] Implicit Places using invariants in 424 ms returned [16, 19, 35, 36, 41, 42, 46, 47, 59, 64, 73, 79, 98, 118, 119, 160, 165]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 467 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/198 places, 171/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 176 /176 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 525 ms. Remains : 176/198 places, 171/176 transitions.
Support contains 58 out of 176 places after structural reductions.
[2023-03-14 07:48:04] [INFO ] Flatten gal took : 63 ms
[2023-03-14 07:48:04] [INFO ] Flatten gal took : 52 ms
[2023-03-14 07:48:04] [INFO ] Input system was already deterministic with 171 transitions.
Support contains 56 out of 176 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 33) seen :31
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 171 rows 176 cols
[2023-03-14 07:48:05] [INFO ] Computed 32 place invariants in 7 ms
[2023-03-14 07:48:05] [INFO ] [Real]Absence check using 25 positive place invariants in 25 ms returned sat
[2023-03-14 07:48:05] [INFO ] [Real]Absence check using 25 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-14 07:48:05] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ParamProductionCell-PT-0-LTLFireability-01 FALSE 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' '!(F(G(p0)))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 176 transition count 162
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 167 transition count 162
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 18 place count 167 transition count 148
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 153 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 152 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 152 transition count 147
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 96 place count 127 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 96 place count 127 transition count 123
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 126 transition count 123
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 2 with 2 rules applied. Total rules applied 100 place count 125 transition count 122
Applied a total of 100 rules in 62 ms. Remains 125 /176 variables (removed 51) and now considering 122/171 (removed 49) transitions.
// Phase 1: matrix 122 rows 125 cols
[2023-03-14 07:48:06] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-14 07:48:06] [INFO ] Implicit Places using invariants in 206 ms returned [0, 1, 9, 11, 15, 20, 42, 55, 67, 68, 70, 103, 105, 106]
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 : 111/176 places, 122/171 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 111 transition count 119
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 108 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 106 transition count 117
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 106 transition count 117
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 2 with 36 rules applied. Total rules applied 46 place count 88 transition count 99
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 2 with 2 rules applied. Total rules applied 48 place count 87 transition count 98
Applied a total of 48 rules in 20 ms. Remains 87 /111 variables (removed 24) and now considering 98/122 (removed 24) transitions.
// Phase 1: matrix 98 rows 87 cols
[2023-03-14 07:48:06] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-14 07:48:06] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-14 07:48:06] [INFO ] Invariant cache hit.
[2023-03-14 07:48:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:06] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/176 places, 98/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 574 ms. Remains : 87/176 places, 98/171 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-00 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 (OR (EQ s37 0) (EQ s77 0)) (OR (EQ s22 0) (EQ s23 0)))], 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 433 ms.
Stack based approach found an accepted trace after 117 steps with 0 reset with depth 118 and stack size 118 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-00 finished in 1273 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||F((p1||X((G(p3)&&p2))))))))'
Support contains 9 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 7 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-14 07:48:07] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-14 07:48:07] [INFO ] Implicit Places using invariants in 164 ms returned [15, 22, 55, 67, 86, 100, 101, 103, 144, 146, 148]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 166 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/176 places, 170/171 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 164/176 places, 170/171 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s27 1) (EQ s30 1)), p1:(AND (EQ s80 1) (EQ s83 1) (EQ s110 1)), p2:(AND (EQ s80 1) (EQ s83 1) (EQ s152 1)), p3:(AND (EQ s16 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 249 ms.
Stack based approach found an accepted trace after 188 steps with 0 reset with depth 189 and stack size 189 in 16 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-02 finished in 677 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((X(p1)||p0))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 9 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
[2023-03-14 07:48:07] [INFO ] Invariant cache hit.
[2023-03-14 07:48:08] [INFO ] Implicit Places using invariants in 170 ms returned [15, 17, 22, 29, 55, 67, 88, 100, 101, 103, 146, 148]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 171 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 8 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2023-03-14 07:48:08] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-14 07:48:08] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-14 07:48:08] [INFO ] Invariant cache hit.
[2023-03-14 07:48:08] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:08] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 625 ms. Remains : 161/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s84 1) (EQ s147 1)), p0:(OR (AND (EQ s80 1) (EQ s103 1)) (AND (EQ s133 1) (EQ s140 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-05 finished in 786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U (p1||G(!p0)))) U (X(G(p3))&&p2)))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 7 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-14 07:48:08] [INFO ] Computed 32 place invariants in 4 ms
[2023-03-14 07:48:08] [INFO ] Implicit Places using invariants in 214 ms returned [15, 17, 29, 55, 67, 86, 88, 100, 103, 144, 146, 148]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 216 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 6 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2023-03-14 07:48:08] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-14 07:48:09] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-14 07:48:09] [INFO ] Invariant cache hit.
[2023-03-14 07:48:09] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:09] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 590 ms. Remains : 161/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p1) p0), (NOT p3), true, (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 p3) (AND (NOT p0) p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s20 1) (EQ s24 1)), p1:(AND (NOT (AND (EQ s32 1) (EQ s38 1))) (NOT (AND (EQ s20 1) (EQ s24 1)))), p0:(AND (EQ s20 1) (EQ s24 1)), p3:(AND (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33416 reset in 264 ms.
Product exploration explored 100000 steps with 33434 reset in 266 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p3)), (X (NOT p2)), (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p3))), true, (X (X (NOT p2))), (X (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 p3) (AND (NOT p0) p3))))), (X (X (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 1231 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), true, (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 07:48:11] [INFO ] Invariant cache hit.
[2023-03-14 07:48:11] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p3)), (X (NOT p2)), (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p3))), true, (X (X (NOT p2))), (X (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 p3) (AND (NOT p0) p3))))), (X (X (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p3) (NOT p0) (NOT p1))))), (F (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)))), (F p3), (F (AND p2 p3 p0 (NOT p1))), (F (OR (AND p3 (NOT p0)) (AND p3 p1))), (F (OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1)))), (F (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p3 p0 (NOT p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (F (OR (AND p2 p3) (AND p2 (NOT p0)) (AND p2 p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1) (AND (NOT p3) (NOT p0) (NOT p1))))), (F (AND (NOT p3) p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p3) p0 (NOT p1)))
Knowledge based reduction with 23 factoid took 758 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-06 finished in 3914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 3 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-14 07:48:12] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-14 07:48:12] [INFO ] Implicit Places using invariants in 153 ms returned [15, 17, 22, 29, 55, 67, 86, 88, 100, 101, 103, 144, 146, 148]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 155 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 159 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 159 transition count 168
Applied a total of 4 rules in 3 ms. Remains 159 /161 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 159 cols
[2023-03-14 07:48:12] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-14 07:48:12] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-14 07:48:12] [INFO ] Invariant cache hit.
[2023-03-14 07:48:13] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:13] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 159/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 525 ms. Remains : 159/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Product exploration explored 100000 steps with 50000 reset in 220 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 : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-07 finished in 1109 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(p1)||X(F((X(p3)&&p2)))||p0)))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 4 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-14 07:48:13] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-14 07:48:13] [INFO ] Implicit Places using invariants in 154 ms returned [15, 17, 22, 29, 55, 67, 86, 88, 100, 101, 103, 144, 148]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 155 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 3 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2023-03-14 07:48:13] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-14 07:48:14] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-14 07:48:14] [INFO ] Invariant cache hit.
[2023-03-14 07:48:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:14] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 544 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (EQ s133 1) (EQ s154 1)), p3:(AND (EQ s133 1) (EQ s154 1)), p0:(OR (EQ s90 0) (EQ s96 0)), p1:(AND (EQ s131 1) (EQ s138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 253 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-09 finished in 1570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1 U X(p2)))||p0))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 4 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-14 07:48:15] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-14 07:48:15] [INFO ] Implicit Places using invariants in 146 ms returned [15, 17, 22, 29, 55, 67, 88, 100, 101, 103, 144, 146, 148]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 151 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 5 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2023-03-14 07:48:15] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-14 07:48:15] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-14 07:48:15] [INFO ] Invariant cache hit.
[2023-03-14 07:48:15] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:15] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 554 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s79 0) (EQ s128 0)), p1:(AND (EQ s79 1) (EQ s128 1)), p2:(AND (EQ s80 1) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 321 reset in 144 ms.
Product exploration explored 100000 steps with 302 reset in 174 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 436 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 6) seen :4
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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 07:48:17] [INFO ] Invariant cache hit.
[2023-03-14 07:48:17] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 07:48:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-14 07:48:17] [INFO ] After 75ms SMT Verify possible using all constraints in natural 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 578 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 168/168 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 160 transition count 139
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 131 transition count 139
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 58 place count 131 transition count 131
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 74 place count 123 transition count 131
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 142 place count 88 transition count 98
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 142 place count 88 transition count 97
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 144 place count 87 transition count 97
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 2 with 2 rules applied. Total rules applied 146 place count 86 transition count 96
Applied a total of 146 rules in 19 ms. Remains 86 /160 variables (removed 74) and now considering 96/168 (removed 72) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-14 07:48:18] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-14 07:48:18] [INFO ] Implicit Places using invariants in 76 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/160 places, 96/168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 94
Applied a total of 4 rules in 9 ms. Remains 82 /84 variables (removed 2) and now considering 94/96 (removed 2) transitions.
// Phase 1: matrix 94 rows 82 cols
[2023-03-14 07:48:18] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-14 07:48:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-14 07:48:18] [INFO ] Invariant cache hit.
[2023-03-14 07:48:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:18] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/160 places, 94/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 82/160 places, 94/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 46 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 742 reset in 131 ms.
Product exploration explored 100000 steps with 735 reset in 154 ms.
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-14 07:48:19] [INFO ] Invariant cache hit.
[2023-03-14 07:48:19] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-14 07:48:19] [INFO ] Invariant cache hit.
[2023-03-14 07:48:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:19] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-14 07:48:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 07:48:19] [INFO ] Invariant cache hit.
[2023-03-14 07:48:19] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 82/82 places, 94/94 transitions.
Treatment of property ParamProductionCell-PT-0-LTLFireability-10 finished in 4429 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 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 176 transition count 162
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 167 transition count 162
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 18 place count 167 transition count 148
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 46 place count 153 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 152 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 152 transition count 147
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 104 place count 123 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 123 transition count 119
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 122 transition count 119
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 2 with 2 rules applied. Total rules applied 108 place count 121 transition count 118
Applied a total of 108 rules in 25 ms. Remains 121 /176 variables (removed 55) and now considering 118/171 (removed 53) transitions.
// Phase 1: matrix 118 rows 121 cols
[2023-03-14 07:48:19] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-14 07:48:19] [INFO ] Implicit Places using invariants in 139 ms returned [0, 1, 9, 11, 15, 20, 34, 40, 51, 53, 64, 65, 100, 102, 103]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 142 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/176 places, 118/171 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 106 transition count 115
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 103 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 103 transition count 113
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 101 transition count 113
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 70 place count 71 transition count 83
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 2 with 2 rules applied. Total rules applied 72 place count 70 transition count 82
Applied a total of 72 rules in 13 ms. Remains 70 /106 variables (removed 36) and now considering 82/118 (removed 36) transitions.
// Phase 1: matrix 82 rows 70 cols
[2023-03-14 07:48:19] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-14 07:48:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-14 07:48:20] [INFO ] Invariant cache hit.
[2023-03-14 07:48:20] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:20] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/176 places, 82/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 389 ms. Remains : 70/176 places, 82/171 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-11 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 s37 1) (EQ s39 1) (EQ s43 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 130 ms.
Stack based approach found an accepted trace after 95 steps with 0 reset with depth 96 and stack size 96 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-11 finished in 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0)||F(p1)) U p0)||G(p2)))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 4 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-14 07:48:20] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-14 07:48:20] [INFO ] Implicit Places using invariants in 174 ms returned [17, 22, 29, 55, 67, 86, 88, 101, 103, 144, 146, 148]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 176 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 3 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2023-03-14 07:48:20] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 07:48:20] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-14 07:48:20] [INFO ] Invariant cache hit.
[2023-03-14 07:48:20] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:20] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 571 ms. Remains : 161/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s92 1) (EQ s95 1)), p2:(AND (EQ s4 1) (EQ s15 1)), p1:(AND (EQ s92 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 786 reset in 130 ms.
Product exploration explored 100000 steps with 772 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 647 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 167 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 686 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-14 07:48:23] [INFO ] Invariant cache hit.
[2023-03-14 07:48:23] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-14 07:48:23] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-14 07:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:48:23] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-14 07:48:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:48:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 07:48:23] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 07:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:48:23] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-14 07:48:23] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:23] [INFO ] [Nat]Added 59 Read/Feed constraints in 12 ms returned sat
[2023-03-14 07:48:23] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 6 ms to minimize.
[2023-03-14 07:48:23] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-14 07:48:24] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-14 07:48:24] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2023-03-14 07:48:24] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2023-03-14 07:48:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 379 ms
[2023-03-14 07:48:24] [INFO ] Computed and/alt/rep : 167/284/167 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-14 07:48:24] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2023-03-14 07:48:24] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2023-03-14 07:48:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-03-14 07:48:24] [INFO ] Added : 165 causal constraints over 34 iterations in 812 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 161 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 168/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-14 07:48:24] [INFO ] Invariant cache hit.
[2023-03-14 07:48:25] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-14 07:48:25] [INFO ] Invariant cache hit.
[2023-03-14 07:48:25] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:25] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-14 07:48:25] [INFO ] Invariant cache hit.
[2023-03-14 07:48:25] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 161/161 places, 168/168 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 343 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 167 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 298 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-14 07:48:26] [INFO ] Invariant cache hit.
[2023-03-14 07:48:26] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 07:48:26] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-14 07:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:48:26] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-14 07:48:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:48:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 07:48:27] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-14 07:48:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:48:27] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-14 07:48:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:27] [INFO ] [Nat]Added 59 Read/Feed constraints in 14 ms returned sat
[2023-03-14 07:48:27] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-14 07:48:27] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2023-03-14 07:48:27] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2023-03-14 07:48:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2023-03-14 07:48:27] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2023-03-14 07:48:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 313 ms
[2023-03-14 07:48:27] [INFO ] Computed and/alt/rep : 167/284/167 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-14 07:48:28] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2023-03-14 07:48:28] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2023-03-14 07:48:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-14 07:48:28] [INFO ] Added : 165 causal constraints over 34 iterations in 750 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 778 reset in 130 ms.
Product exploration explored 100000 steps with 775 reset in 152 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 168/168 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 161 transition count 168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 27 place count 161 transition count 168
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 37 place count 161 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 157 transition count 164
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 157 transition count 164
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 87 place count 157 transition count 164
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 109 place count 135 transition count 142
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 131 place count 135 transition count 142
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 131 rules in 38 ms. Remains 135 /161 variables (removed 26) and now considering 142/168 (removed 26) transitions.
[2023-03-14 07:48:29] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 142 rows 135 cols
[2023-03-14 07:48:29] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 07:48:29] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/161 places, 142/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 135/161 places, 142/168 transitions.
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 161 cols
[2023-03-14 07:48:29] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 07:48:29] [INFO ] Implicit Places using invariants in 116 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/161 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 160/161 places, 168/168 transitions.
Treatment of property ParamProductionCell-PT-0-LTLFireability-13 finished in 9025 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 (!p1&&G(F((!p2||G(!p3)))))))'
Support contains 8 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 176 transition count 165
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 170 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 169 transition count 164
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 14 place count 169 transition count 149
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 44 place count 154 transition count 149
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 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 94 place count 128 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 94 place count 128 transition count 124
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 96 place count 127 transition count 124
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 98 place count 126 transition count 123
Applied a total of 98 rules in 21 ms. Remains 126 /176 variables (removed 50) and now considering 123/171 (removed 48) transitions.
// Phase 1: matrix 123 rows 126 cols
[2023-03-14 07:48:29] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-14 07:48:29] [INFO ] Implicit Places using invariants in 120 ms returned [0, 1, 9, 11, 15, 20, 34, 66, 67, 69, 104, 106, 107]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 122 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/176 places, 123/171 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 113 transition count 120
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 110 transition count 120
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 40 place count 93 transition count 103
Applied a total of 40 rules in 8 ms. Remains 93 /113 variables (removed 20) and now considering 103/123 (removed 20) transitions.
// Phase 1: matrix 103 rows 93 cols
[2023-03-14 07:48:29] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-14 07:48:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-14 07:48:29] [INFO ] Invariant cache hit.
[2023-03-14 07:48:29] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:29] [INFO ] Implicit Places using invariants and state equation in 180 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 : 93/176 places, 103/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 422 ms. Remains : 93/176 places, 103/171 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR p1 (AND p2 p3)), true, (NOT p0), (AND p3 p2), (AND p3 p2)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p3 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND p3 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s37 1) (EQ s38 1)), p0:(EQ s54 1), p3:(AND (EQ s24 1) (EQ s26 1) (EQ s31 1)), p2:(AND (EQ s39 1) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 176 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 p3) (NOT p2)), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p3 p2))), true, (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 746 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
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-14 07:48:31] [INFO ] Invariant cache hit.
[2023-03-14 07:48:31] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-14 07:48:31] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 07:48:31] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p3 p2))), true, (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2)))), (G (NOT (AND p2 p3)))]
False Knowledge obtained : [(F (AND p2 (NOT p3)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p2 p3)))
Knowledge based reduction with 17 factoid took 462 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-14 finished in 2356 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 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 5 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-14 07:48:31] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-14 07:48:31] [INFO ] Implicit Places using invariants in 178 ms returned [15, 17, 22, 29, 55, 67, 86, 88, 100, 101, 103, 144, 146]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 189 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 5 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2023-03-14 07:48:31] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-14 07:48:32] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-14 07:48:32] [INFO ] Invariant cache hit.
[2023-03-14 07:48:32] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:48:32] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 567 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-15 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 (NEQ s132 1) (NEQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 185 ms.
Product exploration explored 100000 steps with 33333 reset in 206 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 45 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-0-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-15 finished in 1121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1 U X(p2)))||p0))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-0-LTLFireability-10
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 176 transition count 162
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 167 transition count 162
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 18 place count 167 transition count 148
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 46 place count 153 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 152 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 152 transition count 147
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 125 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 100 place count 125 transition count 121
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 102 place count 124 transition count 121
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 2 with 2 rules applied. Total rules applied 104 place count 123 transition count 120
Applied a total of 104 rules in 15 ms. Remains 123 /176 variables (removed 53) and now considering 120/171 (removed 51) transitions.
// Phase 1: matrix 120 rows 123 cols
[2023-03-14 07:48:33] [INFO ] Computed 30 place invariants in 0 ms
[2023-03-14 07:48:33] [INFO ] Implicit Places using invariants in 172 ms returned [0, 1, 9, 11, 15, 20, 34, 40, 53, 65, 66, 68, 101, 103, 104]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 174 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 108/176 places, 120/171 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 108 transition count 117
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 105 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 103 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 103 transition count 115
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 50 place count 83 transition count 95
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 2 with 2 rules applied. Total rules applied 52 place count 82 transition count 94
Applied a total of 52 rules in 8 ms. Remains 82 /108 variables (removed 26) and now considering 94/120 (removed 26) transitions.
// Phase 1: matrix 94 rows 82 cols
[2023-03-14 07:48:33] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-14 07:48:33] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-14 07:48:33] [INFO ] Invariant cache hit.
[2023-03-14 07:48:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:33] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 82/176 places, 94/171 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 460 ms. Remains : 82/176 places, 94/171 transitions.
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s31 0) (EQ s64 0)), p1:(AND (EQ s31 1) (EQ s64 1)), p2:(AND (EQ s32 1) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 719 reset in 137 ms.
Product exploration explored 100000 steps with 756 reset in 154 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 434 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 07:48:34] [INFO ] Invariant cache hit.
[2023-03-14 07:48:34] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 07:48:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 07:48:34] [INFO ] After 51ms SMT Verify possible using all constraints in natural 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 586 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-14 07:48:35] [INFO ] Invariant cache hit.
[2023-03-14 07:48:35] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-14 07:48:35] [INFO ] Invariant cache hit.
[2023-03-14 07:48:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:36] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-14 07:48:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 07:48:36] [INFO ] Invariant cache hit.
[2023-03-14 07:48:36] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 82/82 places, 94/94 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 46 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 713 reset in 132 ms.
Product exploration explored 100000 steps with 703 reset in 150 ms.
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-14 07:48:36] [INFO ] Invariant cache hit.
[2023-03-14 07:48:37] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-14 07:48:37] [INFO ] Invariant cache hit.
[2023-03-14 07:48:37] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:37] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-14 07:48:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 07:48:37] [INFO ] Invariant cache hit.
[2023-03-14 07:48:37] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 82/82 places, 94/94 transitions.
Treatment of property ParamProductionCell-PT-0-LTLFireability-10 finished in 4486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0)||F(p1)) U p0)||G(p2)))'
Found a Lengthening insensitive property : ParamProductionCell-PT-0-LTLFireability-13
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 176 transition count 162
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 167 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 18 place count 167 transition count 149
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 44 place count 154 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 153 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 153 transition count 148
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 98 place count 126 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 98 place count 126 transition count 122
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 100 place count 125 transition count 122
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 2 with 2 rules applied. Total rules applied 102 place count 124 transition count 121
Applied a total of 102 rules in 15 ms. Remains 124 /176 variables (removed 52) and now considering 121/171 (removed 50) transitions.
// Phase 1: matrix 121 rows 124 cols
[2023-03-14 07:48:37] [INFO ] Computed 30 place invariants in 0 ms
[2023-03-14 07:48:37] [INFO ] Implicit Places using invariants in 168 ms returned [0, 1, 11, 16, 21, 36, 42, 53, 55, 67, 69, 102, 104, 105]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 169 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 110/176 places, 121/171 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 110 transition count 119
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 108 transition count 116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 105 transition count 116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 105 transition count 113
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 16 place count 102 transition count 113
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 70 place count 75 transition count 86
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 72 place count 74 transition count 85
Applied a total of 72 rules in 11 ms. Remains 74 /110 variables (removed 36) and now considering 85/121 (removed 36) transitions.
// Phase 1: matrix 85 rows 74 cols
[2023-03-14 07:48:37] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-14 07:48:37] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-14 07:48:37] [INFO ] Invariant cache hit.
[2023-03-14 07:48:38] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:38] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 74/176 places, 85/171 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 430 ms. Remains : 74/176 places, 85/171 transitions.
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s43 1) (EQ s44 1)), p2:(AND (EQ s0 1) (EQ s4 1)), p1:(AND (EQ s43 1) (EQ s53 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1679 reset in 125 ms.
Product exploration explored 100000 steps with 1686 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 p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 634 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 82 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 671 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-14 07:48:40] [INFO ] Invariant cache hit.
[2023-03-14 07:48:40] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-14 07:48:40] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 07:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:48:40] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-14 07:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:48:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 07:48:40] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-14 07:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:48:40] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-14 07:48:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:40] [INFO ] [Nat]Added 58 Read/Feed constraints in 10 ms returned sat
[2023-03-14 07:48:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-14 07:48:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-14 07:48:40] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-14 07:48:40] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-14 07:48:40] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2023-03-14 07:48:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 196 ms
[2023-03-14 07:48:40] [INFO ] Computed and/alt/rep : 84/204/84 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-14 07:48:40] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2023-03-14 07:48:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-14 07:48:40] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2023-03-14 07:48:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 128 ms
[2023-03-14 07:48:40] [INFO ] Added : 76 causal constraints over 17 iterations in 319 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 85/85 transitions.
Applied a total of 0 rules in 0 ms. Remains 74 /74 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-14 07:48:40] [INFO ] Invariant cache hit.
[2023-03-14 07:48:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-14 07:48:40] [INFO ] Invariant cache hit.
[2023-03-14 07:48:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:41] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-14 07:48:41] [INFO ] Invariant cache hit.
[2023-03-14 07:48:41] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 74/74 places, 85/85 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 82 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-14 07:48:42] [INFO ] Invariant cache hit.
[2023-03-14 07:48:42] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 07:48:42] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-14 07:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:48:42] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-14 07:48:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:48:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 07:48:42] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 07:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:48:42] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-14 07:48:42] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:48:42] [INFO ] [Nat]Added 58 Read/Feed constraints in 10 ms returned sat
[2023-03-14 07:48:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-14 07:48:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-14 07:48:42] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
[2023-03-14 07:48:42] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-14 07:48:42] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2023-03-14 07:48:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 193 ms
[2023-03-14 07:48:42] [INFO ] Computed and/alt/rep : 84/204/84 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-14 07:48:42] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2023-03-14 07:48:42] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2023-03-14 07:48:42] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2023-03-14 07:48:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 128 ms
[2023-03-14 07:48:42] [INFO ] Added : 76 causal constraints over 17 iterations in 309 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1686 reset in 123 ms.
Product exploration explored 100000 steps with 1679 reset in 144 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 85/85 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-14 07:48:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 85 rows 74 cols
[2023-03-14 07:48:43] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-14 07:48:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/74 places, 85/85 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 74/74 places, 85/85 transitions.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 85/85 transitions.
Applied a total of 0 rules in 0 ms. Remains 74 /74 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 74 cols
[2023-03-14 07:48:43] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-14 07:48:43] [INFO ] Implicit Places using invariants in 78 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/74 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 73/74 places, 85/85 transitions.
Treatment of property ParamProductionCell-PT-0-LTLFireability-13 finished in 6373 ms.
[2023-03-14 07:48:43] [INFO ] Flatten gal took : 15 ms
[2023-03-14 07:48:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-14 07:48:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 171 transitions and 632 arcs took 3 ms.
Total runtime 40406 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ParamProductionCell-PT-0
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA ParamProductionCell-PT-0-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678780169443

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ParamProductionCell-PT-0-LTLFireability-13
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-0-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-0-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 6/32 ParamProductionCell-PT-0-LTLFireability-13 770622 m, 154124 m/sec, 3388437 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-0-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-0-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 9/32 ParamProductionCell-PT-0-LTLFireability-13 1337314 m, 113338 m/sec, 6832512 t fired, .

Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-0-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-0-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 12/32 ParamProductionCell-PT-0-LTLFireability-13 1743503 m, 81237 m/sec, 10342123 t fired, .

Time elapsed: 15 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-0-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-0-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 14/32 ParamProductionCell-PT-0-LTLFireability-13 2116312 m, 74561 m/sec, 13824105 t fired, .

Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 4 (type EXCL) for ParamProductionCell-PT-0-LTLFireability-13
lola: result : true
lola: markings : 2200213
lola: fired transitions : 14683403
lola: time used : 22.000000
lola: memory pages used : 15
lola: LAUNCH task # 1 (type EXCL) for 0 ParamProductionCell-PT-0-LTLFireability-10
lola: time limit : 3578 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-0-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-0-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 3/3578 5/32 ParamProductionCell-PT-0-LTLFireability-10 654792 m, 130958 m/sec, 2081821 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-0-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-0-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 8/3578 10/32 ParamProductionCell-PT-0-LTLFireability-10 1353161 m, 139673 m/sec, 4896079 t fired, .

Time elapsed: 30 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-0-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-0-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 13/3578 14/32 ParamProductionCell-PT-0-LTLFireability-10 1980878 m, 125543 m/sec, 7795222 t fired, .

Time elapsed: 35 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-0-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-0-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 18/3578 18/32 ParamProductionCell-PT-0-LTLFireability-10 2575758 m, 118976 m/sec, 10647011 t fired, .

Time elapsed: 40 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 1 (type EXCL) for ParamProductionCell-PT-0-LTLFireability-10
lola: result : true
lola: markings : 2776320
lola: fired transitions : 13179242
lola: time used : 23.000000
lola: memory pages used : 19
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-0-LTLFireability-10: LTL true LTL model checker
ParamProductionCell-PT-0-LTLFireability-13: LTL true LTL model checker


Time elapsed: 45 secs. Pages in use: 19

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ParamProductionCell-PT-0, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538100364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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