About the Execution of LTSMin+red for ShieldPPPt-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 625.044 | 45996.00 | 74764.00 | 45.20 | TT?FFTFFTFFFFTF? | 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-167903717200619.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-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717200619
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 21:05 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.2K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 21:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 185K 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-010B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679462991952
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:29:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 05:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:29:54] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-22 05:29:54] [INFO ] Transformed 783 places.
[2023-03-22 05:29:54] [INFO ] Transformed 713 transitions.
[2023-03-22 05:29:54] [INFO ] Found NUPN structural information;
[2023-03-22 05:29:54] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 108 places :
Symmetric choice reduction at 0 with 108 rule applications. Total rules 108 place count 675 transition count 605
Iterating global reduction 0 with 108 rules applied. Total rules applied 216 place count 675 transition count 605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 217 place count 674 transition count 604
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 673 transition count 603
Applied a total of 220 rules in 216 ms. Remains 673 /783 variables (removed 110) and now considering 603/713 (removed 110) transitions.
// Phase 1: matrix 603 rows 673 cols
[2023-03-22 05:29:54] [INFO ] Computed 111 place invariants in 19 ms
[2023-03-22 05:29:55] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-22 05:29:55] [INFO ] Invariant cache hit.
[2023-03-22 05:29:56] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2023-03-22 05:29:56] [INFO ] Invariant cache hit.
[2023-03-22 05:29:56] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 673/783 places, 603/713 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1791 ms. Remains : 673/783 places, 603/713 transitions.
Support contains 21 out of 673 places after structural reductions.
[2023-03-22 05:29:56] [INFO ] Flatten gal took : 75 ms
[2023-03-22 05:29:56] [INFO ] Flatten gal took : 26 ms
[2023-03-22 05:29:56] [INFO ] Input system was already deterministic with 603 transitions.
Finished random walk after 8376 steps, including 2 resets, run visited all 16 properties in 284 ms. (steps per millisecond=29 )
Computed a total of 158 stabilizing places and 158 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 34 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
// Phase 1: matrix 601 rows 671 cols
[2023-03-22 05:29:57] [INFO ] Computed 111 place invariants in 16 ms
[2023-03-22 05:29:57] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-22 05:29:57] [INFO ] Invariant cache hit.
[2023-03-22 05:29:58] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2023-03-22 05:29:58] [INFO ] Invariant cache hit.
[2023-03-22 05:29:58] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1156 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s343 1), p1:(AND (EQ s668 0) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4137 reset in 304 ms.
Product exploration explored 100000 steps with 4215 reset in 333 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Detected a total of 158/671 stabilizing places and 158/601 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-22 05:30:00] [INFO ] Invariant cache hit.
[2023-03-22 05:30:00] [INFO ] [Real]Absence check using 111 positive place invariants in 48 ms returned sat
[2023-03-22 05:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:30:01] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2023-03-22 05:30:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:30:02] [INFO ] [Nat]Absence check using 111 positive place invariants in 120 ms returned sat
[2023-03-22 05:30:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:30:03] [INFO ] [Nat]Absence check using state equation in 1343 ms returned sat
[2023-03-22 05:30:03] [INFO ] Computed and/alt/rep : 600/891/600 causal constraints (skipped 0 transitions) in 40 ms.
[2023-03-22 05:30:10] [INFO ] Added : 600 causal constraints over 121 iterations in 6872 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 671 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 671/671 places, 601/601 transitions.
Applied a total of 0 rules in 12 ms. Remains 671 /671 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2023-03-22 05:30:10] [INFO ] Invariant cache hit.
[2023-03-22 05:30:10] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-22 05:30:10] [INFO ] Invariant cache hit.
[2023-03-22 05:30:11] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-03-22 05:30:11] [INFO ] Invariant cache hit.
[2023-03-22 05:30:11] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1093 ms. Remains : 671/671 places, 601/601 transitions.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Detected a total of 158/671 stabilizing places and 158/601 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-22 05:30:12] [INFO ] Invariant cache hit.
[2023-03-22 05:30:12] [INFO ] [Real]Absence check using 111 positive place invariants in 50 ms returned sat
[2023-03-22 05:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:30:13] [INFO ] [Real]Absence check using state equation in 1080 ms returned sat
[2023-03-22 05:30:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:30:14] [INFO ] [Nat]Absence check using 111 positive place invariants in 114 ms returned sat
[2023-03-22 05:30:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:30:15] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2023-03-22 05:30:15] [INFO ] Computed and/alt/rep : 600/891/600 causal constraints (skipped 0 transitions) in 31 ms.
[2023-03-22 05:30:21] [INFO ] Added : 600 causal constraints over 121 iterations in 5988 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4205 reset in 200 ms.
Product exploration explored 100000 steps with 4255 reset in 194 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 671 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 671/671 places, 601/601 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 671 transition count 601
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 139 place count 671 transition count 641
Deduced a syphon composed of 190 places in 0 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 190 place count 671 transition count 641
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 376 places in 0 ms
Iterating global reduction 1 with 186 rules applied. Total rules applied 376 place count 671 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 377 place count 671 transition count 640
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 447 place count 601 transition count 570
Deduced a syphon composed of 306 places in 1 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 517 place count 601 transition count 570
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 307 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 518 place count 601 transition count 570
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 520 place count 599 transition count 568
Deduced a syphon composed of 305 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 522 place count 599 transition count 568
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -160
Deduced a syphon composed of 343 places in 1 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 560 place count 599 transition count 728
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 598 place count 561 transition count 652
Deduced a syphon composed of 305 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 636 place count 561 transition count 652
Deduced a syphon composed of 305 places in 1 ms
Applied a total of 636 rules in 241 ms. Remains 561 /671 variables (removed 110) and now considering 652/601 (removed -51) transitions.
[2023-03-22 05:30:22] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 652 rows 561 cols
[2023-03-22 05:30:22] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-22 05:30:22] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/671 places, 652/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 561/671 places, 652/601 transitions.
Support contains 3 out of 671 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 671/671 places, 601/601 transitions.
Applied a total of 0 rules in 11 ms. Remains 671 /671 variables (removed 0) and now considering 601/601 (removed 0) transitions.
// Phase 1: matrix 601 rows 671 cols
[2023-03-22 05:30:22] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 05:30:23] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-22 05:30:23] [INFO ] Invariant cache hit.
[2023-03-22 05:30:23] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2023-03-22 05:30:23] [INFO ] Invariant cache hit.
[2023-03-22 05:30:23] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1028 ms. Remains : 671/671 places, 601/601 transitions.
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-02 finished in 26430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 672 transition count 464
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 534 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 533 transition count 463
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 278 place count 533 transition count 385
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 434 place count 455 transition count 385
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 436 place count 453 transition count 383
Iterating global reduction 3 with 2 rules applied. Total rules applied 438 place count 453 transition count 383
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 438 place count 453 transition count 381
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 442 place count 451 transition count 381
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 776 place count 284 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 284 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 779 place count 283 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 837 place count 254 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 839 place count 252 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 840 place count 251 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 840 place count 251 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 844 place count 249 transition count 208
Applied a total of 844 rules in 81 ms. Remains 249 /673 variables (removed 424) and now considering 208/603 (removed 395) transitions.
// Phase 1: matrix 208 rows 249 cols
[2023-03-22 05:30:24] [INFO ] Computed 110 place invariants in 1 ms
[2023-03-22 05:30:24] [INFO ] Implicit Places using invariants in 166 ms returned [232, 236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 168 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/673 places, 208/603 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 245 transition count 206
Applied a total of 4 rules in 8 ms. Remains 245 /247 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 245 cols
[2023-03-22 05:30:24] [INFO ] Computed 108 place invariants in 1 ms
[2023-03-22 05:30:24] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-22 05:30:24] [INFO ] Invariant cache hit.
[2023-03-22 05:30:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:30:24] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 245/673 places, 206/603 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 682 ms. Remains : 245/673 places, 206/603 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 294 ms.
Stack based approach found an accepted trace after 654 steps with 0 reset with depth 655 and stack size 652 in 4 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-04 finished in 1043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((p1||G(p2)))&&p0))))'
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 23 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
// Phase 1: matrix 601 rows 671 cols
[2023-03-22 05:30:25] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 05:30:25] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-22 05:30:25] [INFO ] Invariant cache hit.
[2023-03-22 05:30:25] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2023-03-22 05:30:25] [INFO ] Invariant cache hit.
[2023-03-22 05:30:26] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s426 0) (EQ s171 1)), p1:(AND (EQ s426 0) (EQ s171 1)), p2:(OR (EQ s494 0) (EQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 41 reset in 291 ms.
Stack based approach found an accepted trace after 292 steps with 0 reset with depth 293 and stack size 293 in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-06 finished in 1635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 50 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
[2023-03-22 05:30:26] [INFO ] Invariant cache hit.
[2023-03-22 05:30:26] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-22 05:30:26] [INFO ] Invariant cache hit.
[2023-03-22 05:30:27] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2023-03-22 05:30:27] [INFO ] Invariant cache hit.
[2023-03-22 05:30:27] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1279 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s596 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 424 reset in 225 ms.
Stack based approach found an accepted trace after 3532 steps with 15 reset with depth 243 and stack size 243 in 9 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-09 finished in 1661 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)) U (G(p1) U G(p2))))'
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 672 transition count 464
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 534 transition count 464
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 276 place count 534 transition count 385
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 434 place count 455 transition count 385
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 436 place count 453 transition count 383
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 453 transition count 383
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 438 place count 453 transition count 381
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 442 place count 451 transition count 381
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 330 rules applied. Total rules applied 772 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 773 place count 286 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 775 place count 285 transition count 214
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 831 place count 257 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 833 place count 255 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 834 place count 254 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 834 place count 254 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 838 place count 252 transition count 210
Applied a total of 838 rules in 87 ms. Remains 252 /673 variables (removed 421) and now considering 210/603 (removed 393) transitions.
// Phase 1: matrix 210 rows 252 cols
[2023-03-22 05:30:28] [INFO ] Computed 110 place invariants in 1 ms
[2023-03-22 05:30:28] [INFO ] Implicit Places using invariants in 189 ms returned [235, 239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 190 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/673 places, 210/603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 248 transition count 208
Applied a total of 4 rules in 8 ms. Remains 248 /250 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 248 cols
[2023-03-22 05:30:28] [INFO ] Computed 108 place invariants in 1 ms
[2023-03-22 05:30:28] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-22 05:30:28] [INFO ] Invariant cache hit.
[2023-03-22 05:30:28] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 248/673 places, 208/603 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 636 ms. Remains : 248/673 places, 208/603 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s131 1) (OR (EQ s22 0) (EQ s57 1))), p1:(OR (EQ s22 0) (EQ s57 1)), p0:(NEQ s131 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1293 reset in 319 ms.
Stack based approach found an accepted trace after 6819 steps with 70 reset with depth 662 and stack size 606 in 31 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-11 finished in 1229 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(((p1||(!p2 U (p3||G(!p2))))&&p0))))'
Support contains 5 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Applied a total of 0 rules in 15 ms. Remains 673 /673 variables (removed 0) and now considering 603/603 (removed 0) transitions.
// Phase 1: matrix 603 rows 673 cols
[2023-03-22 05:30:29] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 05:30:29] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-22 05:30:29] [INFO ] Invariant cache hit.
[2023-03-22 05:30:30] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2023-03-22 05:30:30] [INFO ] Invariant cache hit.
[2023-03-22 05:30:30] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1000 ms. Remains : 673/673 places, 603/603 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (AND (NOT p3) p2), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p3:(AND (NEQ s636 1) (NOT (OR (EQ s395 0) (EQ s26 1)))), p2:(OR (EQ s395 0) (EQ s26 1)), p0:(AND (EQ s26 0) (EQ s395 1)), p1:(AND (EQ s462 0) (EQ s143 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-12 finished in 1252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 672 transition count 464
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 534 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 533 transition count 463
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 278 place count 533 transition count 386
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 432 place count 456 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 434 place count 454 transition count 384
Iterating global reduction 3 with 2 rules applied. Total rules applied 436 place count 454 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 436 place count 454 transition count 382
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 440 place count 452 transition count 382
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 770 place count 287 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 771 place count 287 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 773 place count 286 transition count 215
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 829 place count 258 transition count 215
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 831 place count 256 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 832 place count 255 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 832 place count 255 transition count 211
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 836 place count 253 transition count 211
Applied a total of 836 rules in 77 ms. Remains 253 /673 variables (removed 420) and now considering 211/603 (removed 392) transitions.
// Phase 1: matrix 211 rows 253 cols
[2023-03-22 05:30:30] [INFO ] Computed 110 place invariants in 1 ms
[2023-03-22 05:30:31] [INFO ] Implicit Places using invariants in 332 ms returned [236, 240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 334 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/673 places, 211/603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 249 transition count 209
Applied a total of 4 rules in 14 ms. Remains 249 /251 variables (removed 2) and now considering 209/211 (removed 2) transitions.
// Phase 1: matrix 209 rows 249 cols
[2023-03-22 05:30:31] [INFO ] Computed 108 place invariants in 0 ms
[2023-03-22 05:30:31] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-22 05:30:31] [INFO ] Invariant cache hit.
[2023-03-22 05:30:31] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 249/673 places, 209/603 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 775 ms. Remains : 249/673 places, 209/603 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-15 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 s182 0) (EQ s165 1)), p0:(OR (EQ s53 0) (EQ s80 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 93 reset in 298 ms.
Product exploration explored 100000 steps with 90 reset in 330 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1003 steps, including 0 resets, run visited all 2 properties in 65 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 348 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 209/209 transitions.
Applied a total of 0 rules in 9 ms. Remains 249 /249 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2023-03-22 05:30:33] [INFO ] Invariant cache hit.
[2023-03-22 05:30:33] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-22 05:30:33] [INFO ] Invariant cache hit.
[2023-03-22 05:30:33] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-22 05:30:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:30:33] [INFO ] Invariant cache hit.
[2023-03-22 05:30:33] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 539 ms. Remains : 249/249 places, 209/209 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 529 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 85 reset in 332 ms.
Product exploration explored 100000 steps with 80 reset in 316 ms.
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 209/209 transitions.
Applied a total of 0 rules in 4 ms. Remains 249 /249 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2023-03-22 05:30:35] [INFO ] Invariant cache hit.
[2023-03-22 05:30:35] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-22 05:30:35] [INFO ] Invariant cache hit.
[2023-03-22 05:30:35] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-22 05:30:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 05:30:35] [INFO ] Invariant cache hit.
[2023-03-22 05:30:35] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 565 ms. Remains : 249/249 places, 209/209 transitions.
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-15 finished in 4958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Found a Shortening insensitive property : ShieldPPPt-PT-010B-LTLCardinality-02
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 672 transition count 465
Reduce places removed 137 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 276 place count 535 transition count 463
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 278 place count 533 transition count 463
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 278 place count 533 transition count 385
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 434 place count 455 transition count 385
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 436 place count 453 transition count 383
Iterating global reduction 3 with 2 rules applied. Total rules applied 438 place count 453 transition count 383
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 438 place count 453 transition count 381
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 442 place count 451 transition count 381
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 772 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 773 place count 286 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 775 place count 285 transition count 214
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 831 place count 257 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 833 place count 255 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 834 place count 254 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 834 place count 254 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 838 place count 252 transition count 210
Applied a total of 838 rules in 87 ms. Remains 252 /673 variables (removed 421) and now considering 210/603 (removed 393) transitions.
// Phase 1: matrix 210 rows 252 cols
[2023-03-22 05:30:36] [INFO ] Computed 110 place invariants in 1 ms
[2023-03-22 05:30:36] [INFO ] Implicit Places using invariants in 178 ms returned [233, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 192 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 250/673 places, 210/603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 248 transition count 208
Applied a total of 4 rules in 5 ms. Remains 248 /250 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 248 cols
[2023-03-22 05:30:36] [INFO ] Computed 108 place invariants in 0 ms
[2023-03-22 05:30:36] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-22 05:30:36] [INFO ] Invariant cache hit.
[2023-03-22 05:30:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 05:30:36] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 248/673 places, 208/603 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 740 ms. Remains : 248/673 places, 208/603 transitions.
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s129 1), p1:(AND (EQ s247 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20826 reset in 224 ms.
Stack based approach found an accepted trace after 849 steps with 184 reset with depth 13 and stack size 13 in 3 ms.
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-02 finished in 1218 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2023-03-22 05:30:37] [INFO ] Flatten gal took : 23 ms
[2023-03-22 05:30:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 05:30:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 673 places, 603 transitions and 1566 arcs took 4 ms.
Total runtime 42809 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1067/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1067/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-010B-LTLCardinality-02
Could not compute solution for formula : ShieldPPPt-PT-010B-LTLCardinality-15
BK_STOP 1679463037948
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPt-PT-010B-LTLCardinality-02
ltl formula formula --ltl=/tmp/1067/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 673 places, 603 transitions and 1566 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1067/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1067/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1067/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.040 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1067/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 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-010B-LTLCardinality-15
ltl formula formula --ltl=/tmp/1067/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
pnml2lts-mc( 0/ 4): Petri net has 673 places, 603 transitions and 1566 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.030 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1067/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1067/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1067/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1067/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
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-010B"
export BK_EXAMINATION="LTLCardinality"
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-010B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717200619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;