About the Execution of LTSMin+red for ShieldPPPt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 967.428 | 141005.00 | 202447.00 | 84.60 | FFTTFFFFF?FFT?FF | 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.r393-oct2-167903717300676.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPt-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300676
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 7.8K Feb 25 21:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 21:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 21:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 21:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 337K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679469512268
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:18:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:18:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:18:35] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-22 07:18:35] [INFO ] Transformed 1253 places.
[2023-03-22 07:18:35] [INFO ] Transformed 903 transitions.
[2023-03-22 07:18:35] [INFO ] Found NUPN structural information;
[2023-03-22 07:18:35] [INFO ] Parsed PT model containing 1253 places and 903 transitions and 3606 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 286 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2023-03-22 07:18:36] [INFO ] Computed 551 place invariants in 56 ms
[2023-03-22 07:18:37] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2023-03-22 07:18:37] [INFO ] Invariant cache hit.
[2023-03-22 07:18:40] [INFO ] Implicit Places using invariants and state equation in 2529 ms returned []
Implicit Place search using SMT with State Equation took 4052 ms to find 0 implicit places.
[2023-03-22 07:18:40] [INFO ] Invariant cache hit.
[2023-03-22 07:18:41] [INFO ] Dead Transitions using invariants and state equation in 1267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5612 ms. Remains : 1253/1253 places, 902/902 transitions.
Support contains 55 out of 1253 places after structural reductions.
[2023-03-22 07:18:42] [INFO ] Flatten gal took : 209 ms
[2023-03-22 07:18:42] [INFO ] Flatten gal took : 151 ms
[2023-03-22 07:18:42] [INFO ] Input system was already deterministic with 902 transitions.
Support contains 54 out of 1253 places (down from 55) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 701 ms. (steps per millisecond=14 ) properties (out of 29) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-22 07:18:44] [INFO ] Invariant cache hit.
[2023-03-22 07:18:45] [INFO ] [Real]Absence check using 551 positive place invariants in 349 ms returned sat
[2023-03-22 07:18:49] [INFO ] After 3236ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:24
[2023-03-22 07:18:49] [INFO ] After 3410ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:25
[2023-03-22 07:18:49] [INFO ] After 5708ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:25
[2023-03-22 07:18:50] [INFO ] [Nat]Absence check using 551 positive place invariants in 160 ms returned sat
[2023-03-22 07:18:56] [INFO ] After 4810ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :25
[2023-03-22 07:19:00] [INFO ] After 8906ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :25
Attempting to minimize the solution found.
Minimization took 2895 ms.
[2023-03-22 07:19:03] [INFO ] After 14105ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :25
Fused 26 Parikh solutions to 24 different solutions.
Finished Parikh walk after 1108 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=85 )
Parikh walk visited 25 properties in 2378 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((F(p2)&&p1))))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 129 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2023-03-22 07:19:06] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-22 07:19:07] [INFO ] Implicit Places using invariants in 955 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 976 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 65 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2023-03-22 07:19:07] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-22 07:19:08] [INFO ] Implicit Places using invariants in 915 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 941 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 81 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2023-03-22 07:19:08] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-22 07:19:09] [INFO ] Implicit Places using invariants in 945 ms returned []
[2023-03-22 07:19:09] [INFO ] Invariant cache hit.
[2023-03-22 07:19:12] [INFO ] Implicit Places using invariants and state equation in 2476 ms returned []
Implicit Place search using SMT with State Equation took 3441 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5633 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s737 0) (EQ s739 0)), p1:(AND (EQ s117 1) (EQ s119 1)), p2:(AND (EQ s956 1) (EQ s971 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 920 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-01 finished in 6970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(G((p1 U !p2)))&&p0)))))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 20 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2023-03-22 07:19:13] [INFO ] Computed 551 place invariants in 9 ms
[2023-03-22 07:19:15] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2023-03-22 07:19:15] [INFO ] Invariant cache hit.
[2023-03-22 07:19:16] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 3251 ms to find 0 implicit places.
[2023-03-22 07:19:16] [INFO ] Invariant cache hit.
[2023-03-22 07:19:17] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4162 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s704 1) (EQ s723 1)), p2:(AND (EQ s704 1) (EQ s723 1) (EQ s440 1) (EQ s474 1)), p1:(EQ s1049 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-04 finished in 4384 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 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 20 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2023-03-22 07:19:18] [INFO ] Invariant cache hit.
[2023-03-22 07:19:18] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-22 07:19:18] [INFO ] Invariant cache hit.
[2023-03-22 07:19:21] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3368 ms to find 0 implicit places.
[2023-03-22 07:19:21] [INFO ] Invariant cache hit.
[2023-03-22 07:19:22] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4210 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1038 1) (EQ s1052 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-05 finished in 4348 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)&&(p1 U X(!p2))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 20 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2023-03-22 07:19:22] [INFO ] Invariant cache hit.
[2023-03-22 07:19:23] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-22 07:19:23] [INFO ] Invariant cache hit.
[2023-03-22 07:19:25] [INFO ] Implicit Places using invariants and state equation in 2395 ms returned []
Implicit Place search using SMT with State Equation took 3170 ms to find 0 implicit places.
[2023-03-22 07:19:25] [INFO ] Invariant cache hit.
[2023-03-22 07:19:26] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3908 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) p2), p2, (NOT p0), p2, true]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-08 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=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s515 1) (EQ s549 1)), p0:(AND (EQ s507 1) (EQ s509 1)), p2:(AND (EQ s358 1) (EQ s375 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 915 ms.
Stack based approach found an accepted trace after 16 steps with 1 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-08 finished in 5085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)||X(X(F(p2)))))))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 106 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2023-03-22 07:19:27] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-22 07:19:28] [INFO ] Implicit Places using invariants in 1085 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1097 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 42 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2023-03-22 07:19:28] [INFO ] Computed 550 place invariants in 3 ms
[2023-03-22 07:19:29] [INFO ] Implicit Places using invariants in 877 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 878 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 60 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2023-03-22 07:19:29] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-22 07:19:30] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2023-03-22 07:19:30] [INFO ] Invariant cache hit.
[2023-03-22 07:19:33] [INFO ] Implicit Places using invariants and state equation in 2511 ms returned []
Implicit Place search using SMT with State Equation took 3659 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5843 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s676 1), p1:(OR (NEQ s392 1) (NEQ s394 1)), p2:(AND (EQ s220 1) (EQ s235 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 799 ms.
Product exploration explored 100000 steps with 0 reset in 1128 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 734 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Finished probabilistic random walk after 36202 steps, run visited all 2 properties in 615 ms. (steps per millisecond=58 )
Probabilistic random walk after 36202 steps, saw 35546 distinct states, run finished after 618 ms. (steps per millisecond=58 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 866 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter insensitive) to 4 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1244 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 45 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2023-03-22 07:19:39] [INFO ] Invariant cache hit.
[2023-03-22 07:19:40] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2023-03-22 07:19:40] [INFO ] Invariant cache hit.
[2023-03-22 07:19:42] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
[2023-03-22 07:19:42] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-22 07:19:42] [INFO ] Invariant cache hit.
[2023-03-22 07:19:42] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3836 ms. Remains : 1244/1244 places, 896/896 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter insensitive) to 4 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Finished probabilistic random walk after 36202 steps, run visited all 2 properties in 626 ms. (steps per millisecond=57 )
Probabilistic random walk after 36202 steps, saw 35546 distinct states, run finished after 629 ms. (steps per millisecond=57 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p2)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter insensitive) to 4 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 731 ms.
Product exploration explored 100000 steps with 0 reset in 1043 ms.
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 28 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2023-03-22 07:19:47] [INFO ] Invariant cache hit.
[2023-03-22 07:19:48] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2023-03-22 07:19:48] [INFO ] Invariant cache hit.
[2023-03-22 07:19:50] [INFO ] Implicit Places using invariants and state equation in 2564 ms returned []
Implicit Place search using SMT with State Equation took 3738 ms to find 0 implicit places.
[2023-03-22 07:19:51] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-22 07:19:51] [INFO ] Invariant cache hit.
[2023-03-22 07:19:52] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5282 ms. Remains : 1244/1244 places, 896/896 transitions.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-09 finished in 25174 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||G(p1)))))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 86 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2023-03-22 07:19:52] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-22 07:19:53] [INFO ] Implicit Places using invariants in 866 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 868 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 34 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2023-03-22 07:19:53] [INFO ] Computed 550 place invariants in 5 ms
[2023-03-22 07:19:54] [INFO ] Implicit Places using invariants in 939 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 959 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 63 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2023-03-22 07:19:54] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-22 07:19:55] [INFO ] Implicit Places using invariants in 1240 ms returned []
[2023-03-22 07:19:56] [INFO ] Invariant cache hit.
[2023-03-22 07:19:57] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned []
Implicit Place search using SMT with State Equation took 3246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5269 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s986 0) (EQ s996 0)), p0:(EQ s524 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 824 ms.
Stack based approach found an accepted trace after 70829 steps with 0 reset with depth 70830 and stack size 39559 in 723 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-10 finished in 6942 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 U (G(!p0)||(X(!p0)&&p1)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 45 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2023-03-22 07:19:59] [INFO ] Computed 551 place invariants in 16 ms
[2023-03-22 07:20:00] [INFO ] Implicit Places using invariants in 922 ms returned []
[2023-03-22 07:20:00] [INFO ] Invariant cache hit.
[2023-03-22 07:20:02] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 2380 ms to find 0 implicit places.
[2023-03-22 07:20:02] [INFO ] Invariant cache hit.
[2023-03-22 07:20:02] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3289 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s1211 1) (EQ s1221 1))) (NOT (AND (EQ s106 1) (EQ s121 1)))), p0:(AND (EQ s1211 1) (EQ s1221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3152 ms.
Product exploration explored 100000 steps with 50000 reset in 3246 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 9 factoid took 488 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLFireability-12 finished in 10309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1) U p2)))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 125 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2023-03-22 07:20:10] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-22 07:20:11] [INFO ] Implicit Places using invariants in 921 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 935 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 28 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2023-03-22 07:20:11] [INFO ] Computed 550 place invariants in 2 ms
[2023-03-22 07:20:11] [INFO ] Implicit Places using invariants in 832 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 850 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 56 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2023-03-22 07:20:11] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:20:13] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2023-03-22 07:20:13] [INFO ] Invariant cache hit.
[2023-03-22 07:20:15] [INFO ] Implicit Places using invariants and state equation in 2187 ms returned []
Implicit Place search using SMT with State Equation took 3369 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5363 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s482 0) (EQ s484 0)), p2:(AND (EQ s406 1) (EQ s421 1)), p1:(EQ s824 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 776 ms.
Product exploration explored 100000 steps with 1 reset in 1075 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1181 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Finished probabilistic random walk after 34691 steps, run visited all 9 properties in 1130 ms. (steps per millisecond=30 )
Probabilistic random walk after 34691 steps, saw 34046 distinct states, run finished after 1132 ms. (steps per millisecond=30 ) properties seen :9
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 19 factoid took 1557 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 30 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2023-03-22 07:20:23] [INFO ] Invariant cache hit.
[2023-03-22 07:20:24] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2023-03-22 07:20:24] [INFO ] Invariant cache hit.
[2023-03-22 07:20:26] [INFO ] Implicit Places using invariants and state equation in 2098 ms returned []
Implicit Place search using SMT with State Equation took 3126 ms to find 0 implicit places.
[2023-03-22 07:20:26] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 07:20:26] [INFO ] Invariant cache hit.
[2023-03-22 07:20:27] [INFO ] Dead Transitions using invariants and state equation in 941 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4141 ms. Remains : 1244/1244 places, 896/896 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1294 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Finished probabilistic random walk after 34691 steps, run visited all 9 properties in 1294 ms. (steps per millisecond=26 )
Probabilistic random walk after 34691 steps, saw 34046 distinct states, run finished after 1296 ms. (steps per millisecond=26 ) properties seen :9
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 19 factoid took 1739 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3 reset in 943 ms.
Product exploration explored 100000 steps with 0 reset in 1168 ms.
Support contains 5 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 29 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2023-03-22 07:20:36] [INFO ] Invariant cache hit.
[2023-03-22 07:20:37] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2023-03-22 07:20:37] [INFO ] Invariant cache hit.
[2023-03-22 07:20:40] [INFO ] Implicit Places using invariants and state equation in 2464 ms returned []
Implicit Place search using SMT with State Equation took 3639 ms to find 0 implicit places.
[2023-03-22 07:20:40] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 07:20:40] [INFO ] Invariant cache hit.
[2023-03-22 07:20:40] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4576 ms. Remains : 1244/1244 places, 896/896 transitions.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-13 finished in 31051 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(((!p1 U p2)&&X(X(F(p3)))&&p0)))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2023-03-22 07:20:41] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-22 07:20:41] [INFO ] Implicit Places using invariants in 952 ms returned []
[2023-03-22 07:20:41] [INFO ] Invariant cache hit.
[2023-03-22 07:20:44] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned []
Implicit Place search using SMT with State Equation took 3088 ms to find 0 implicit places.
[2023-03-22 07:20:44] [INFO ] Invariant cache hit.
[2023-03-22 07:20:45] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4071 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s630 1) (EQ s647 1)), p2:(AND (EQ s543 1) (EQ s550 1)), p1:(AND (EQ s630 1) (EQ s647 1)), p3:(AND (EQ s516 1) (EQ s527 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-14 finished in 4402 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) U (F(X(p1)) U p2)))'
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 84 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2023-03-22 07:20:45] [INFO ] Computed 551 place invariants in 18 ms
[2023-03-22 07:20:46] [INFO ] Implicit Places using invariants in 1163 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 29 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2023-03-22 07:20:46] [INFO ] Computed 550 place invariants in 6 ms
[2023-03-22 07:20:47] [INFO ] Implicit Places using invariants in 988 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1003 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 43 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2023-03-22 07:20:47] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-22 07:20:48] [INFO ] Implicit Places using invariants in 910 ms returned []
[2023-03-22 07:20:48] [INFO ] Invariant cache hit.
[2023-03-22 07:20:50] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2743 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5071 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (EQ s695 1) (EQ s710 1)) (AND (EQ s1036 1) (EQ s1046 1)) (AND (EQ s581 1) (EQ s596 1))), p0:(AND (EQ s581 1) (EQ s596 1)), p1:(AND (EQ s840 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 811 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-15 finished in 6114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)||X(X(F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1) U p2)))'
[2023-03-22 07:20:51] [INFO ] Flatten gal took : 157 ms
[2023-03-22 07:20:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 07:20:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1253 places, 902 transitions and 3604 arcs took 10 ms.
Total runtime 136657 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1503/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1503/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-050A-LTLFireability-09
Could not compute solution for formula : ShieldPPPt-PT-050A-LTLFireability-13
BK_STOP 1679469653273
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPt-PT-050A-LTLFireability-09
ltl formula formula --ltl=/tmp/1503/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1253 places, 902 transitions and 3604 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.070 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1503/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1503/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1503/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1503/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldPPPt-PT-050A-LTLFireability-13
ltl formula formula --ltl=/tmp/1503/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1253 places, 902 transitions and 3604 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.060 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1503/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1503/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1503/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1503/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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="ShieldPPPt-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717300676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050A.tgz
mv ShieldPPPt-PT-050A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;