About the Execution of LoLa+red for DES-PT-01a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 407.060 | 19127.00 | 28380.00 | 465.50 | TFFFTFFFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478200363.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 DES-PT-01a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478200363
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 15:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 32K Mar 5 18:22 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 DES-PT-01a-LTLCardinality-00
FORMULA_NAME DES-PT-01a-LTLCardinality-01
FORMULA_NAME DES-PT-01a-LTLCardinality-02
FORMULA_NAME DES-PT-01a-LTLCardinality-03
FORMULA_NAME DES-PT-01a-LTLCardinality-04
FORMULA_NAME DES-PT-01a-LTLCardinality-05
FORMULA_NAME DES-PT-01a-LTLCardinality-06
FORMULA_NAME DES-PT-01a-LTLCardinality-07
FORMULA_NAME DES-PT-01a-LTLCardinality-08
FORMULA_NAME DES-PT-01a-LTLCardinality-09
FORMULA_NAME DES-PT-01a-LTLCardinality-10
FORMULA_NAME DES-PT-01a-LTLCardinality-11
FORMULA_NAME DES-PT-01a-LTLCardinality-12
FORMULA_NAME DES-PT-01a-LTLCardinality-13
FORMULA_NAME DES-PT-01a-LTLCardinality-14
FORMULA_NAME DES-PT-01a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678247393854
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-01a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:49:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 03:49:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:49:55] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-08 03:49:55] [INFO ] Transformed 119 places.
[2023-03-08 03:49:55] [INFO ] Transformed 76 transitions.
[2023-03-08 03:49:55] [INFO ] Found NUPN structural information;
[2023-03-08 03:49:55] [INFO ] Parsed PT model containing 119 places and 76 transitions and 381 arcs in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-01a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 62/62 transitions.
Applied a total of 0 rules in 11 ms. Remains 119 /119 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 119 cols
[2023-03-08 03:49:55] [INFO ] Computed 59 place invariants in 14 ms
[2023-03-08 03:49:55] [INFO ] Implicit Places using invariants in 257 ms returned [1, 16, 36, 40, 44, 46, 48, 50, 52, 54, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 285 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/119 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 300 ms. Remains : 99/119 places, 62/62 transitions.
Support contains 29 out of 99 places after structural reductions.
[2023-03-08 03:49:56] [INFO ] Flatten gal took : 25 ms
[2023-03-08 03:49:56] [INFO ] Flatten gal took : 10 ms
[2023-03-08 03:49:56] [INFO ] Input system was already deterministic with 62 transitions.
Finished random walk after 3615 steps, including 150 resets, run visited all 18 properties in 82 ms. (steps per millisecond=44 )
FORMULA DES-PT-01a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-01a-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 13 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 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 98 transition count 52
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 87 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 86 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 86 transition count 51
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 49 place count 68 transition count 42
Applied a total of 49 rules in 26 ms. Remains 68 /99 variables (removed 31) and now considering 42/62 (removed 20) transitions.
// Phase 1: matrix 42 rows 68 cols
[2023-03-08 03:49:56] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-08 03:49:56] [INFO ] Implicit Places using invariants in 63 ms returned [40, 46, 49, 53, 56]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 64 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/99 places, 42/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 61 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 61 transition count 39
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 6 place count 60 transition count 38
Applied a total of 6 rules in 9 ms. Remains 60 /63 variables (removed 3) and now considering 38/42 (removed 4) transitions.
// Phase 1: matrix 38 rows 60 cols
[2023-03-08 03:49:56] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-08 03:49:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 03:49:56] [INFO ] Invariant cache hit.
[2023-03-08 03:49:56] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [7, 27, 55]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 138 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/99 places, 38/62 transitions.
Graph (complete) has 139 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 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 3 place count 52 transition count 34
Applied a total of 3 rules in 6 ms. Remains 52 /57 variables (removed 5) and now considering 34/38 (removed 4) transitions.
// Phase 1: matrix 34 rows 52 cols
[2023-03-08 03:49:56] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-08 03:49:56] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 03:49:56] [INFO ] Invariant cache hit.
[2023-03-08 03:49:56] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 52/99 places, 34/62 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 336 ms. Remains : 52/99 places, 34/62 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-01 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 s36 0) (EQ s38 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 2 ms.
FORMULA DES-PT-01a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-01 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 61
Applied a total of 2 rules in 16 ms. Remains 98 /99 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 98 cols
[2023-03-08 03:49:57] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-08 03:49:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 03:49:57] [INFO ] Invariant cache hit.
[2023-03-08 03:49:57] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [8, 28, 32, 46, 93]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 148 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/99 places, 61/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 93/99 places, 61/62 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s64 1), p1:(OR (EQ s23 0) (EQ s49 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA DES-PT-01a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-03 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 99 transition count 52
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 89 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 88 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 88 transition count 51
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 58 place count 63 transition count 40
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 60 place count 62 transition count 39
Applied a total of 60 rules in 15 ms. Remains 62 /99 variables (removed 37) and now considering 39/62 (removed 23) transitions.
// Phase 1: matrix 39 rows 62 cols
[2023-03-08 03:49:57] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-08 03:49:57] [INFO ] Implicit Places using invariants in 46 ms returned [43, 47, 50]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/99 places, 39/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 57 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 57 transition count 36
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 6 place count 56 transition count 35
Applied a total of 6 rules in 7 ms. Remains 56 /59 variables (removed 3) and now considering 35/39 (removed 4) transitions.
// Phase 1: matrix 35 rows 56 cols
[2023-03-08 03:49:57] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-08 03:49:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 03:49:57] [INFO ] Invariant cache hit.
[2023-03-08 03:49:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:49:57] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [8, 28, 32, 39, 51]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 137 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/99 places, 35/62 transitions.
Graph (complete) has 145 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 49 transition count 33
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 3 place count 48 transition count 33
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 45 transition count 30
Applied a total of 9 rules in 3 ms. Remains 45 /51 variables (removed 6) and now considering 30/35 (removed 5) transitions.
// Phase 1: matrix 30 rows 45 cols
[2023-03-08 03:49:57] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-08 03:49:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 03:49:57] [INFO ] Invariant cache hit.
[2023-03-08 03:49:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 45/99 places, 30/62 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 284 ms. Remains : 45/99 places, 30/62 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s20 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DES-PT-01a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-06 finished in 324 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 U X(p1)))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 61
Applied a total of 2 rules in 5 ms. Remains 98 /99 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 98 cols
[2023-03-08 03:49:57] [INFO ] Computed 39 place invariants in 5 ms
[2023-03-08 03:49:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 03:49:57] [INFO ] Invariant cache hit.
[2023-03-08 03:49:58] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [8, 28, 32, 46, 93]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 135 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/99 places, 61/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 93/99 places, 61/62 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s56 1)), p1:(OR (EQ s13 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 29762 reset in 264 ms.
Product exploration explored 100000 steps with 29665 reset in 183 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 221 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 337 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1159 steps, including 48 resets, run visited all 4 properties in 20 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 389 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 93 cols
[2023-03-08 03:49:59] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-08 03:49:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 03:49:59] [INFO ] Invariant cache hit.
[2023-03-08 03:49:59] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 03:49:59] [INFO ] Invariant cache hit.
[2023-03-08 03:49:59] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 93/93 places, 61/61 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 221 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 306 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 2785 steps, including 107 resets, run visited all 4 properties in 13 ms. (steps per millisecond=214 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 381 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 29459 reset in 166 ms.
Product exploration explored 100000 steps with 29522 reset in 159 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-08 03:50:01] [INFO ] Invariant cache hit.
[2023-03-08 03:50:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 03:50:01] [INFO ] Invariant cache hit.
[2023-03-08 03:50:01] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 03:50:01] [INFO ] Invariant cache hit.
[2023-03-08 03:50:01] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 93/93 places, 61/61 transitions.
Treatment of property DES-PT-01a-LTLCardinality-08 finished in 3799 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((F(G(p0)) U (F((p1&&X(p2))) U p3)))))'
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 99 cols
[2023-03-08 03:50:01] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-08 03:50:01] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 03:50:01] [INFO ] Invariant cache hit.
[2023-03-08 03:50:01] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [8, 28, 32, 94]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 170 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/99 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 95/99 places, 62/62 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-01a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s30 1), p1:(OR (EQ s43 0) (EQ s53 1)), p0:(EQ s76 1), p2:(OR (EQ s27 0) (EQ s88 1))], 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]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA DES-PT-01a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-09 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 99 transition count 52
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 89 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 88 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 88 transition count 51
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 58 place count 63 transition count 40
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 60 place count 62 transition count 39
Applied a total of 60 rules in 13 ms. Remains 62 /99 variables (removed 37) and now considering 39/62 (removed 23) transitions.
// Phase 1: matrix 39 rows 62 cols
[2023-03-08 03:50:02] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-08 03:50:02] [INFO ] Implicit Places using invariants in 54 ms returned [43, 47, 50]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/99 places, 39/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 57 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 57 transition count 36
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 0 with 2 rules applied. Total rules applied 6 place count 56 transition count 35
Applied a total of 6 rules in 8 ms. Remains 56 /59 variables (removed 3) and now considering 35/39 (removed 4) transitions.
// Phase 1: matrix 35 rows 56 cols
[2023-03-08 03:50:02] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-08 03:50:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 03:50:02] [INFO ] Invariant cache hit.
[2023-03-08 03:50:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:50:02] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [8, 28, 32, 39, 51]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 99 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/99 places, 35/62 transitions.
Graph (complete) has 145 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 49 transition count 33
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 3 place count 48 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 46 transition count 31
Applied a total of 7 rules in 4 ms. Remains 46 /51 variables (removed 5) and now considering 31/35 (removed 4) transitions.
// Phase 1: matrix 31 rows 46 cols
[2023-03-08 03:50:02] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-08 03:50:02] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 03:50:02] [INFO ] Invariant cache hit.
[2023-03-08 03:50:02] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 46/99 places, 31/62 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 266 ms. Remains : 46/99 places, 31/62 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DES-PT-01a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-10 finished in 443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(p0)||G(p1))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 61
Applied a total of 2 rules in 3 ms. Remains 98 /99 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 98 cols
[2023-03-08 03:50:02] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-08 03:50:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 03:50:02] [INFO ] Invariant cache hit.
[2023-03-08 03:50:02] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [8, 28, 32, 46, 93]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 138 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/99 places, 61/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 93/99 places, 61/62 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s41 0) (EQ s21 1)), p0:(OR (EQ s15 0) (EQ s6 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 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 221 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-01a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01a-LTLCardinality-11 finished in 791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 98 transition count 52
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 88 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 87 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 87 transition count 51
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 35 rules applied. Total rules applied 56 place count 63 transition count 40
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 61 transition count 39
Applied a total of 59 rules in 15 ms. Remains 61 /99 variables (removed 38) and now considering 39/62 (removed 23) transitions.
// Phase 1: matrix 39 rows 61 cols
[2023-03-08 03:50:03] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-08 03:50:03] [INFO ] Implicit Places using invariants in 44 ms returned [40, 46, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/99 places, 39/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 56 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 56 transition count 36
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 6 place count 55 transition count 35
Applied a total of 6 rules in 3 ms. Remains 55 /58 variables (removed 3) and now considering 35/39 (removed 4) transitions.
// Phase 1: matrix 35 rows 55 cols
[2023-03-08 03:50:03] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-08 03:50:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 03:50:03] [INFO ] Invariant cache hit.
[2023-03-08 03:50:03] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [7, 27, 37, 50]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 88 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/99 places, 35/62 transitions.
Graph (complete) has 129 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 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 3 place count 46 transition count 31
Applied a total of 3 rules in 3 ms. Remains 46 /51 variables (removed 5) and now considering 31/35 (removed 4) transitions.
// Phase 1: matrix 31 rows 46 cols
[2023-03-08 03:50:03] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-08 03:50:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 03:50:03] [INFO ] Invariant cache hit.
[2023-03-08 03:50:03] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 46/99 places, 31/62 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 229 ms. Remains : 46/99 places, 31/62 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s28 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 55 steps with 1 reset in 0 ms.
FORMULA DES-PT-01a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-12 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 99 cols
[2023-03-08 03:50:03] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-08 03:50:03] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 03:50:03] [INFO ] Invariant cache hit.
[2023-03-08 03:50:03] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [8, 32, 46, 94]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 151 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/99 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 95 /95 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 95/99 places, 62/62 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s88 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 103 steps with 2 reset in 1 ms.
FORMULA DES-PT-01a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-13 finished in 247 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 U X(p1)))))'
Found a Lengthening insensitive property : DES-PT-01a-LTLCardinality-08
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 99/99 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 98 transition count 52
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 87 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 20 place count 87 transition count 51
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 22 place count 86 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 85 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 85 transition count 50
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 50 place count 67 transition count 42
Applied a total of 50 rules in 11 ms. Remains 67 /99 variables (removed 32) and now considering 42/62 (removed 20) transitions.
// Phase 1: matrix 42 rows 67 cols
[2023-03-08 03:50:04] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-08 03:50:04] [INFO ] Implicit Places using invariants in 47 ms returned [39, 44, 47, 55]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 63/99 places, 42/62 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 62 transition count 41
Applied a total of 2 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 62 cols
[2023-03-08 03:50:04] [INFO ] Computed 23 place invariants in 0 ms
[2023-03-08 03:50:04] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 03:50:04] [INFO ] Invariant cache hit.
[2023-03-08 03:50:04] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [7, 27, 57]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 95 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 59/99 places, 41/62 transitions.
Graph (complete) has 149 edges and 59 vertex of which 57 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 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 3 place count 54 transition count 37
Applied a total of 3 rules in 3 ms. Remains 54 /59 variables (removed 5) and now considering 37/41 (removed 4) transitions.
// Phase 1: matrix 37 rows 54 cols
[2023-03-08 03:50:04] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-08 03:50:04] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 03:50:04] [INFO ] Invariant cache hit.
[2023-03-08 03:50:04] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 54/99 places, 37/62 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 250 ms. Remains : 54/99 places, 37/62 transitions.
Running random walk in product with property : DES-PT-01a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s44 0) (EQ s37 1)), p1:(OR (EQ s10 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 16330 reset in 148 ms.
Product exploration explored 100000 steps with 16250 reset in 168 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 209 steps, including 12 resets, run visited all 4 properties in 5 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) p0)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 398 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-08 03:50:05] [INFO ] Invariant cache hit.
[2023-03-08 03:50:05] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 03:50:05] [INFO ] Invariant cache hit.
[2023-03-08 03:50:05] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-08 03:50:05] [INFO ] Invariant cache hit.
[2023-03-08 03:50:05] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 54/54 places, 37/37 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 637 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Finished Best-First random walk after 1399 steps, including 22 resets, run visited all 1 properties in 4 ms. (steps per millisecond=349 )
Knowledge obtained : [(AND p0 p1), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p1) p0)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 362 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16217 reset in 142 ms.
Product exploration explored 100000 steps with 16210 reset in 141 ms.
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-08 03:50:07] [INFO ] Invariant cache hit.
[2023-03-08 03:50:07] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 03:50:07] [INFO ] Invariant cache hit.
[2023-03-08 03:50:07] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-08 03:50:07] [INFO ] Invariant cache hit.
[2023-03-08 03:50:07] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 54/54 places, 37/37 transitions.
Treatment of property DES-PT-01a-LTLCardinality-08 finished in 3616 ms.
[2023-03-08 03:50:07] [INFO ] Flatten gal took : 7 ms
[2023-03-08 03:50:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 03:50:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 62 transitions and 256 arcs took 1 ms.
Total runtime 12293 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-01a
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality
FORMULA DES-PT-01a-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678247412981
--------------------
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 LTLCardinality -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.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: LAUNCH task # 1 (type EXCL) for 0 DES-PT-01a-LTLCardinality-08
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DES-PT-01a-LTLCardinality-08
lola: result : false
lola: markings : 729000
lola: fired transitions : 5598231
lola: time used : 4.000000
lola: memory pages used : 5
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-01a-LTLCardinality-08: LTL false LTL model checker
Time elapsed: 4 secs. Pages in use: 5
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="DES-PT-01a"
export BK_EXAMINATION="LTLCardinality"
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 DES-PT-01a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478200363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01a.tgz
mv DES-PT-01a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;