Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025500620.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025500620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 13:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 13:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 185K May 10 09:34 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-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653020816745

Running Version 202205111006
[2022-05-20 04:26:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 04:26:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 04:26:58] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-05-20 04:26:58] [INFO ] Transformed 783 places.
[2022-05-20 04:26:58] [INFO ] Transformed 713 transitions.
[2022-05-20 04:26:58] [INFO ] Found NUPN structural information;
[2022-05-20 04:26:58] [INFO ] Parsed PT model containing 783 places and 713 transitions in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-010B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 103 places :
Symmetric choice reduction at 0 with 103 rule applications. Total rules 103 place count 680 transition count 610
Iterating global reduction 0 with 103 rules applied. Total rules applied 206 place count 680 transition count 610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 207 place count 679 transition count 609
Iterating global reduction 0 with 1 rules applied. Total rules applied 208 place count 679 transition count 609
Applied a total of 208 rules in 158 ms. Remains 679 /783 variables (removed 104) and now considering 609/713 (removed 104) transitions.
// Phase 1: matrix 609 rows 679 cols
[2022-05-20 04:26:58] [INFO ] Computed 111 place invariants in 26 ms
[2022-05-20 04:26:58] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 609 rows 679 cols
[2022-05-20 04:26:58] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:26:59] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
// Phase 1: matrix 609 rows 679 cols
[2022-05-20 04:26:59] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:26:59] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 679/783 places, 609/713 transitions.
Finished structural reductions, in 1 iterations. Remains : 679/783 places, 609/713 transitions.
Support contains 30 out of 679 places after structural reductions.
[2022-05-20 04:26:59] [INFO ] Flatten gal took : 70 ms
[2022-05-20 04:26:59] [INFO ] Flatten gal took : 33 ms
[2022-05-20 04:26:59] [INFO ] Input system was already deterministic with 609 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 609 rows 679 cols
[2022-05-20 04:27:00] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-20 04:27:00] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-20 04:27:00] [INFO ] After 197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 04:27:00] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 6 ms to minimize.
[2022-05-20 04:27:01] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2022-05-20 04:27:01] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2022-05-20 04:27:01] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2022-05-20 04:27:01] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-20 04:27:01] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2022-05-20 04:27:01] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2022-05-20 04:27:01] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2022-05-20 04:27:02] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2022-05-20 04:27:02] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2022-05-20 04:27:02] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2022-05-20 04:27:02] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2022-05-20 04:27:02] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2022-05-20 04:27:02] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-20 04:27:02] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2022-05-20 04:27:02] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2022-05-20 04:27:02] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2383 ms
[2022-05-20 04:27:02] [INFO ] After 2607ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:27:02] [INFO ] After 2746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:27:03] [INFO ] [Nat]Absence check using 111 positive place invariants in 32 ms returned sat
[2022-05-20 04:27:03] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:27:03] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2022-05-20 04:27:03] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2022-05-20 04:27:03] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2022-05-20 04:27:03] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2022-05-20 04:27:03] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-20 04:27:04] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2022-05-20 04:27:04] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2022-05-20 04:27:04] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2022-05-20 04:27:04] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
[2022-05-20 04:27:04] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2022-05-20 04:27:04] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2022-05-20 04:27:04] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2022-05-20 04:27:05] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2022-05-20 04:27:05] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2022-05-20 04:27:05] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2022-05-20 04:27:05] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-05-20 04:27:05] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-20 04:27:05] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 1 ms to minimize.
[2022-05-20 04:27:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2412 ms
[2022-05-20 04:27:05] [INFO ] After 2632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 04:27:05] [INFO ] After 2798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 679 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 679/679 places, 609/609 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 679 transition count 469
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 539 transition count 469
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 280 place count 539 transition count 392
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 434 place count 462 transition count 392
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 439 place count 457 transition count 387
Iterating global reduction 2 with 5 rules applied. Total rules applied 444 place count 457 transition count 387
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 444 place count 457 transition count 384
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 450 place count 454 transition count 384
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 794 place count 282 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 795 place count 282 transition count 211
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 797 place count 281 transition count 210
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 855 place count 252 transition count 210
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 883 place count 252 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 884 place count 251 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 885 place count 250 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 885 place count 250 transition count 207
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 889 place count 248 transition count 207
Applied a total of 889 rules in 159 ms. Remains 248 /679 variables (removed 431) and now considering 207/609 (removed 402) transitions.
Finished structural reductions, in 1 iterations. Remains : 248/679 places, 207/609 transitions.
Finished random walk after 1236 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=123 )
FORMULA ShieldPPPt-PT-010B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 160 stabilizing places and 160 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0 U G(p0)))||G(p1))))'
Support contains 2 out of 679 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 672 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 672 transition count 602
Applied a total of 14 rules in 30 ms. Remains 672 /679 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:06] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-20 04:27:06] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:06] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:06] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:06] [INFO ] Computed 111 place invariants in 6 ms
[2022-05-20 04:27:07] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 672/679 places, 602/609 transitions.
Finished structural reductions, in 1 iterations. Remains : 672/679 places, 602/609 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s261 1), p0:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 477 ms.
Stack based approach found an accepted trace after 2693 steps with 0 reset with depth 2694 and stack size 2062 in 15 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-00 finished in 1882 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 679 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 678 transition count 467
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 537 transition count 467
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 282 place count 537 transition count 391
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 434 place count 461 transition count 391
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 439 place count 456 transition count 386
Iterating global reduction 2 with 5 rules applied. Total rules applied 444 place count 456 transition count 386
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 444 place count 456 transition count 383
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 450 place count 453 transition count 383
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 788 place count 284 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 789 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 3 with 2 rules applied. Total rules applied 791 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 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 849 place count 254 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 851 place count 252 transition count 210
Applied a total of 851 rules in 84 ms. Remains 252 /679 variables (removed 427) and now considering 210/609 (removed 399) transitions.
// Phase 1: matrix 210 rows 252 cols
[2022-05-20 04:27:08] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:27:08] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 210 rows 252 cols
[2022-05-20 04:27:08] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:27:08] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2022-05-20 04:27:08] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 210 rows 252 cols
[2022-05-20 04:27:08] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:27:08] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/679 places, 210/609 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/679 places, 210/609 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s236 1) (EQ s245 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 648 reset in 314 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-01 finished in 1012 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(p1)))))'
Support contains 2 out of 679 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 672 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 672 transition count 602
Applied a total of 14 rules in 29 ms. Remains 672 /679 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:09] [INFO ] Computed 111 place invariants in 7 ms
[2022-05-20 04:27:09] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:09] [INFO ] Computed 111 place invariants in 6 ms
[2022-05-20 04:27:09] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:09] [INFO ] Computed 111 place invariants in 7 ms
[2022-05-20 04:27:10] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 672/679 places, 602/609 transitions.
Finished structural reductions, in 1 iterations. Remains : 672/679 places, 602/609 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s582 0), p0:(EQ s327 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32 reset in 354 ms.
Stack based approach found an accepted trace after 260 steps with 0 reset with depth 261 and stack size 261 in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-04 finished in 1645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(!(F(X(p0)) U p1)))||X(p1))))'
Support contains 1 out of 679 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 671 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 671 transition count 601
Applied a total of 16 rules in 34 ms. Remains 671 /679 variables (removed 8) and now considering 601/609 (removed 8) transitions.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:27:10] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:27:10] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:27:11] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:27:11] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:27:11] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-20 04:27:12] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/679 places, 601/609 transitions.
Finished structural reductions, in 1 iterations. Remains : 671/679 places, 601/609 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, p1, false, false]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s543 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-05 finished in 1486 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 679 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 678 transition count 468
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 538 transition count 468
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 280 place count 538 transition count 391
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 434 place count 461 transition count 391
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 439 place count 456 transition count 386
Iterating global reduction 2 with 5 rules applied. Total rules applied 444 place count 456 transition count 386
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 444 place count 456 transition count 383
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 450 place count 453 transition count 383
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 788 place count 284 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 789 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 3 with 2 rules applied. Total rules applied 791 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 3 with 58 rules applied. Total rules applied 849 place count 254 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 851 place count 252 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 852 place count 251 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 852 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 4 with 4 rules applied. Total rules applied 856 place count 249 transition count 208
Applied a total of 856 rules in 69 ms. Remains 249 /679 variables (removed 430) and now considering 208/609 (removed 401) transitions.
// Phase 1: matrix 208 rows 249 cols
[2022-05-20 04:27:12] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-20 04:27:12] [INFO ] Implicit Places using invariants in 237 ms returned [232, 236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 240 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/679 places, 208/609 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 245 transition count 206
Applied a total of 4 rules in 7 ms. Remains 245 /247 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 245 cols
[2022-05-20 04:27:12] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 04:27:12] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 206 rows 245 cols
[2022-05-20 04:27:12] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 04:27:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 04:27:12] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 245/679 places, 206/609 transitions.
Finished structural reductions, in 2 iterations. Remains : 245/679 places, 206/609 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19221 reset in 299 ms.
Stack based approach found an accepted trace after 5 steps with 1 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-06 finished in 1112 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(X(p0)))&&G((G(X(p1))||p1))))'
Support contains 2 out of 679 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 671 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 671 transition count 601
Applied a total of 16 rules in 31 ms. Remains 671 /679 variables (removed 8) and now considering 601/609 (removed 8) transitions.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:27:13] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-20 04:27:13] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:27:13] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:27:14] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:27:14] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:14] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/679 places, 601/609 transitions.
Finished structural reductions, in 1 iterations. Remains : 671/679 places, 601/609 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s260 1), p0:(EQ s13 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-08 finished in 1113 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 679 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 672 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 672 transition count 602
Applied a total of 14 rules in 30 ms. Remains 672 /679 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:14] [INFO ] Computed 111 place invariants in 6 ms
[2022-05-20 04:27:14] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:14] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:15] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:15] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:15] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 672/679 places, 602/609 transitions.
Finished structural reductions, in 1 iterations. Remains : 672/679 places, 602/609 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s643 1), p0:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8 reset in 329 ms.
Stack based approach found an accepted trace after 7250 steps with 1 reset with depth 4392 and stack size 4392 in 54 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-09 finished in 1415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(G(p1))))'
Support contains 3 out of 679 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 671 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 671 transition count 601
Applied a total of 16 rules in 27 ms. Remains 671 /679 variables (removed 8) and now considering 601/609 (removed 8) transitions.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:27:15] [INFO ] Computed 111 place invariants in 6 ms
[2022-05-20 04:27:16] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:27:16] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:27:16] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:27:16] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-20 04:27:16] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/679 places, 601/609 transitions.
Finished structural reductions, in 1 iterations. Remains : 671/679 places, 601/609 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s552 0) (EQ s584 0)), p1:(EQ s40 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 50000 reset in 509 ms.
Product exploration explored 100000 steps with 50000 reset in 509 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-010B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-010B-LTLFireability-10 finished in 2228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))||X(p2)))'
Support contains 5 out of 679 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 672 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 672 transition count 602
Applied a total of 14 rules in 33 ms. Remains 672 /679 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:18] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:27:18] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:18] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:27:18] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2022-05-20 04:27:18] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:19] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 672/679 places, 602/609 transitions.
Finished structural reductions, in 1 iterations. Remains : 672/679 places, 602/609 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s9 1), p2:(OR (AND (EQ s101 1) (EQ s103 1)) (EQ s247 1)), p0:(EQ s653 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-11 finished in 1356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((G(F(p0))||X(p1))))))'
Support contains 2 out of 679 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 678 transition count 469
Reduce places removed 139 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 140 rules applied. Total rules applied 279 place count 539 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 538 transition count 468
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 280 place count 538 transition count 391
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 434 place count 461 transition count 391
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 438 place count 457 transition count 387
Iterating global reduction 3 with 4 rules applied. Total rules applied 442 place count 457 transition count 387
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 442 place count 457 transition count 385
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 446 place count 455 transition count 385
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 788 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 789 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 791 place count 283 transition count 212
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 847 place count 255 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 849 place count 253 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 850 place count 252 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 850 place count 252 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 854 place count 250 transition count 208
Applied a total of 854 rules in 89 ms. Remains 250 /679 variables (removed 429) and now considering 208/609 (removed 401) transitions.
// Phase 1: matrix 208 rows 250 cols
[2022-05-20 04:27:19] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-20 04:27:19] [INFO ] Implicit Places using invariants in 240 ms returned [233, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 242 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/679 places, 208/609 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 246 transition count 206
Applied a total of 4 rules in 6 ms. Remains 246 /248 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 246 cols
[2022-05-20 04:27:19] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 04:27:20] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 206 rows 246 cols
[2022-05-20 04:27:20] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 04:27:20] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 246/679 places, 206/609 transitions.
Finished structural reductions, in 2 iterations. Remains : 246/679 places, 206/609 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s147 1), p1:(EQ s200 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1661 reset in 294 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-12 finished in 1318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(p0)||(p1 U p2))))))'
Support contains 3 out of 679 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 673 transition count 603
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 673 transition count 603
Applied a total of 12 rules in 26 ms. Remains 673 /679 variables (removed 6) and now considering 603/609 (removed 6) transitions.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:20] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-20 04:27:21] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:21] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-20 04:27:21] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:21] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:22] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 673/679 places, 603/609 transitions.
Finished structural reductions, in 1 iterations. Remains : 673/679 places, 603/609 transitions.
Stuttering acceptance computed with spot in 487 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s254 1), p1:(NEQ s329 1), p0:(EQ s606 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19992 reset in 295 ms.
Product exploration explored 100000 steps with 19962 reset in 308 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 598 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:24] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:24] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-20 04:27:24] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:27:24] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-20 04:27:24] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:27:24] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2022-05-20 04:27:24] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2022-05-20 04:27:25] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2022-05-20 04:27:25] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-20 04:27:25] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2022-05-20 04:27:25] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-05-20 04:27:25] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2022-05-20 04:27:25] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-20 04:27:25] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2022-05-20 04:27:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1068 ms
[2022-05-20 04:27:25] [INFO ] After 1304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-20 04:27:25] [INFO ] After 1469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 673/673 places, 603/603 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 673 transition count 465
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 535 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 534 transition count 464
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 534 transition count 386
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 456 transition count 386
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 778 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 779 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 781 place count 283 transition count 212
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 835 place count 256 transition count 212
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 256 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 837 place count 255 transition count 211
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 866 place count 255 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 867 place count 254 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 868 place count 253 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 868 place count 253 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 872 place count 251 transition count 208
Applied a total of 872 rules in 81 ms. Remains 251 /673 variables (removed 422) and now considering 208/603 (removed 395) transitions.
Finished structural reductions, in 1 iterations. Remains : 251/673 places, 208/603 transitions.
Finished random walk after 350 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=116 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 12 factoid took 660 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 976 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:27] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:29] [INFO ] [Real]Absence check using 111 positive place invariants in 759 ms returned sat
[2022-05-20 04:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 04:27:32] [INFO ] [Real]Absence check using state equation in 3782 ms returned sat
[2022-05-20 04:27:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 04:27:33] [INFO ] [Nat]Absence check using 111 positive place invariants in 89 ms returned sat
[2022-05-20 04:27:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 04:27:36] [INFO ] [Nat]Absence check using state equation in 2991 ms returned sat
[2022-05-20 04:27:36] [INFO ] Computed and/alt/rep : 602/894/602 causal constraints (skipped 0 transitions) in 103 ms.
[2022-05-20 04:27:46] [INFO ] Added : 601 causal constraints over 121 iterations in 9634 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 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 11 ms. Remains 673 /673 variables (removed 0) and now considering 603/603 (removed 0) transitions.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:46] [INFO ] Computed 111 place invariants in 13 ms
[2022-05-20 04:27:46] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:46] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:27:47] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:47] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:27:47] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 673/673 places, 603/603 transitions.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 477 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:48] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:48] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2022-05-20 04:27:48] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:27:48] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-20 04:27:48] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:27:49] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2022-05-20 04:27:49] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2022-05-20 04:27:49] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 5 ms to minimize.
[2022-05-20 04:27:49] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2022-05-20 04:27:49] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 1 ms to minimize.
[2022-05-20 04:27:49] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2022-05-20 04:27:49] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2022-05-20 04:27:50] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2022-05-20 04:27:50] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2022-05-20 04:27:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1242 ms
[2022-05-20 04:27:50] [INFO ] After 1466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-20 04:27:50] [INFO ] After 1636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 673/673 places, 603/603 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 673 transition count 465
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 535 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 534 transition count 464
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 534 transition count 386
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 456 transition count 386
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 778 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 779 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 781 place count 283 transition count 212
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 835 place count 256 transition count 212
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 256 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 837 place count 255 transition count 211
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 866 place count 255 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 867 place count 254 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 868 place count 253 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 868 place count 253 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 872 place count 251 transition count 208
Applied a total of 872 rules in 93 ms. Remains 251 /673 variables (removed 422) and now considering 208/603 (removed 395) transitions.
Finished structural reductions, in 1 iterations. Remains : 251/673 places, 208/603 transitions.
Finished random walk after 178 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 12 factoid took 770 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:27:51] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:27:51] [INFO ] [Real]Absence check using 111 positive place invariants in 47 ms returned sat
[2022-05-20 04:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 04:27:52] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2022-05-20 04:27:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 04:27:53] [INFO ] [Nat]Absence check using 111 positive place invariants in 47 ms returned sat
[2022-05-20 04:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 04:27:54] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2022-05-20 04:27:54] [INFO ] Computed and/alt/rep : 602/894/602 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-20 04:28:01] [INFO ] Added : 601 causal constraints over 121 iterations in 7544 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 19927 reset in 304 ms.
Product exploration explored 100000 steps with 20078 reset in 291 ms.
Built C files in :
/tmp/ltsmin12907485384455980889
[2022-05-20 04:28:02] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12907485384455980889
Running compilation step : cd /tmp/ltsmin12907485384455980889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 942 ms.
Running link step : cd /tmp/ltsmin12907485384455980889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12907485384455980889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7666069139149453243.hoa' '--buchi-type=spotba'
LTSmin run took 520 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-010B-LTLFireability-14 finished in 43539 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G((p0||X(F(p1))))))'
Support contains 2 out of 679 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 679/679 places, 609/609 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 678 transition count 468
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 538 transition count 468
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 280 place count 538 transition count 391
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 434 place count 461 transition count 391
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 439 place count 456 transition count 386
Iterating global reduction 2 with 5 rules applied. Total rules applied 444 place count 456 transition count 386
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 444 place count 456 transition count 383
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 450 place count 453 transition count 383
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 2 with 336 rules applied. Total rules applied 786 place count 285 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 787 place count 285 transition count 214
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 789 place count 284 transition count 213
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 847 place count 255 transition count 213
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 849 place count 253 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 850 place count 252 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 850 place count 252 transition count 209
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 854 place count 250 transition count 209
Applied a total of 854 rules in 45 ms. Remains 250 /679 variables (removed 429) and now considering 209/609 (removed 400) transitions.
// Phase 1: matrix 209 rows 250 cols
[2022-05-20 04:28:04] [INFO ] Computed 110 place invariants in 0 ms
[2022-05-20 04:28:04] [INFO ] Implicit Places using invariants in 131 ms returned [233, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 133 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/679 places, 209/609 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 246 transition count 207
Applied a total of 4 rules in 5 ms. Remains 246 /248 variables (removed 2) and now considering 207/209 (removed 2) transitions.
// Phase 1: matrix 207 rows 246 cols
[2022-05-20 04:28:04] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 04:28:04] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 207 rows 246 cols
[2022-05-20 04:28:04] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 04:28:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 04:28:04] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 246/679 places, 207/609 transitions.
Finished structural reductions, in 2 iterations. Remains : 246/679 places, 207/609 transitions.
Stuttering acceptance computed with spot in 802 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s207 1), p1:(EQ s78 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 47 reset in 301 ms.
Stack based approach found an accepted trace after 321 steps with 30 reset with depth 155 and stack size 155 in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLFireability-15 finished in 1635 ms.
All properties solved by simple procedures.
Total runtime 68069 ms.

BK_STOP 1653020886059

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-010B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025500620"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;