About the Execution of ITS-Tools for ShieldPPPt-PT-005B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
343.199 | 25164.00 | 42395.00 | 221.50 | FFFFFFFFFFFFFFFF | normal |
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-165286025500604.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-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025500604
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 29 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:42 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.8K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 92K 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-005B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653020223796
Running Version 202205111006
[2022-05-20 04:17:04] [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:17:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 04:17:05] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2022-05-20 04:17:05] [INFO ] Transformed 393 places.
[2022-05-20 04:17:05] [INFO ] Transformed 358 transitions.
[2022-05-20 04:17:05] [INFO ] Found NUPN structural information;
[2022-05-20 04:17:05] [INFO ] Parsed PT model containing 393 places and 358 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-005B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 358/358 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 347 transition count 312
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 347 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 346 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 346 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 345 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 345 transition count 310
Applied a total of 96 rules in 90 ms. Remains 345 /393 variables (removed 48) and now considering 310/358 (removed 48) transitions.
// Phase 1: matrix 310 rows 345 cols
[2022-05-20 04:17:05] [INFO ] Computed 56 place invariants in 21 ms
[2022-05-20 04:17:05] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 310 rows 345 cols
[2022-05-20 04:17:05] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-20 04:17:05] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
// Phase 1: matrix 310 rows 345 cols
[2022-05-20 04:17:05] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:06] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 345/393 places, 310/358 transitions.
Finished structural reductions, in 1 iterations. Remains : 345/393 places, 310/358 transitions.
Support contains 40 out of 345 places after structural reductions.
[2022-05-20 04:17:06] [INFO ] Flatten gal took : 48 ms
[2022-05-20 04:17:06] [INFO ] Flatten gal took : 21 ms
[2022-05-20 04:17:06] [INFO ] Input system was already deterministic with 310 transitions.
Support contains 36 out of 345 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 30) seen :29
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 310 rows 345 cols
[2022-05-20 04:17:06] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-20 04:17:06] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:17:06] [INFO ] [Nat]Absence check using 56 positive place invariants in 18 ms returned sat
[2022-05-20 04:17:06] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 80 stabilizing places and 80 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 1 out of 345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 344 transition count 235
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 270 transition count 235
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 148 place count 270 transition count 201
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 216 place count 236 transition count 201
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 221 place count 231 transition count 196
Iterating global reduction 2 with 5 rules applied. Total rules applied 226 place count 231 transition count 196
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 226 place count 231 transition count 192
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 234 place count 227 transition count 192
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 400 place count 144 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 401 place count 144 transition count 108
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 403 place count 143 transition count 107
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 431 place count 129 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 433 place count 127 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 434 place count 126 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 434 place count 126 transition count 103
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 438 place count 124 transition count 103
Applied a total of 438 rules in 62 ms. Remains 124 /345 variables (removed 221) and now considering 103/310 (removed 207) transitions.
// Phase 1: matrix 103 rows 124 cols
[2022-05-20 04:17:07] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-20 04:17:07] [INFO ] Implicit Places using invariants in 82 ms returned [107, 111]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/345 places, 103/310 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 120 transition count 101
Applied a total of 4 rules in 6 ms. Remains 120 /122 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:07] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-20 04:17:07] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:07] [INFO ] Computed 53 place invariants in 4 ms
[2022-05-20 04:17:07] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/345 places, 101/310 transitions.
Finished structural reductions, in 2 iterations. Remains : 120/345 places, 101/310 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s53 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 427 ms.
Product exploration explored 100000 steps with 0 reset in 338 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/120 stabilizing places and 2/101 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 101/101 transitions.
Applied a total of 0 rules in 12 ms. Remains 120 /120 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:08] [INFO ] Computed 53 place invariants in 0 ms
[2022-05-20 04:17:09] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:09] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-20 04:17:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2022-05-20 04:17:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:09] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-20 04:17:09] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 101/101 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/120 stabilizing places and 2/101 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 226 ms.
Product exploration explored 100000 steps with 0 reset in 287 ms.
Built C files in :
/tmp/ltsmin12704722412234732879
[2022-05-20 04:17:10] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2022-05-20 04:17:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:17:10] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2022-05-20 04:17:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:17:10] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2022-05-20 04:17:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:17:10] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12704722412234732879
Running compilation step : cd /tmp/ltsmin12704722412234732879;'/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 307 ms.
Running link step : cd /tmp/ltsmin12704722412234732879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12704722412234732879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8598372463859403602.hoa' '--buchi-type=spotba'
LTSmin run took 93 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-005B-LTLFireability-01 finished in 3743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p0)&&p1))&&F(p2))))'
Support contains 4 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 336 transition count 301
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 336 transition count 301
Applied a total of 18 rules in 15 ms. Remains 336 /345 variables (removed 9) and now considering 301/310 (removed 9) transitions.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:10] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-20 04:17:10] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:10] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-20 04:17:11] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:11] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:11] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/345 places, 301/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/345 places, 301/310 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s195 0) (EQ s96 0) (EQ s98 0)), p1:(EQ s71 0), p0:(EQ s195 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][false, false, false, false]]
Product exploration explored 100000 steps with 33230 reset in 266 ms.
Product exploration explored 100000 steps with 33298 reset in 238 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :3
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 301 rows 336 cols
[2022-05-20 04:17:12] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:12] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X p2), true, (X (X p2)), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 6 factoid took 185 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldPPPt-PT-005B-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-005B-LTLFireability-02 finished in 1789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(p1)&&F(!p1))))'
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 337 transition count 302
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 337 transition count 302
Applied a total of 16 rules in 16 ms. Remains 337 /345 variables (removed 8) and now considering 302/310 (removed 8) transitions.
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:12] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:12] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:12] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:12] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:12] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-20 04:17:13] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/345 places, 302/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/345 places, 302/310 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), p1, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s240 1), p1:(NEQ s211 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6150 reset in 164 ms.
Product exploration explored 100000 steps with 6155 reset in 172 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Detected a total of 78/337 stabilizing places and 78/302 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[p1, p1]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 377 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[p1]
Stuttering acceptance computed with spot in 38 ms :[p1]
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:14] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:14] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2022-05-20 04:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 04:17:14] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-05-20 04:17:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 04:17:15] [INFO ] [Nat]Absence check using 56 positive place invariants in 14 ms returned sat
[2022-05-20 04:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 04:17:15] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2022-05-20 04:17:15] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 8 ms to minimize.
[2022-05-20 04:17:15] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-20 04:17:15] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2022-05-20 04:17:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 191 ms
[2022-05-20 04:17:15] [INFO ] Computed and/alt/rep : 301/448/301 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-20 04:17:17] [INFO ] Added : 290 causal constraints over 59 iterations in 1826 ms. Result :sat
Could not prove EG p1
Support contains 1 out of 337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 337/337 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 336 transition count 231
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 266 transition count 231
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 140 place count 266 transition count 192
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 218 place count 227 transition count 192
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 382 place count 145 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 383 place count 145 transition count 109
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 385 place count 144 transition count 108
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 411 place count 131 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 129 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 128 transition count 106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 414 place count 128 transition count 104
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 418 place count 126 transition count 104
Applied a total of 418 rules in 33 ms. Remains 126 /337 variables (removed 211) and now considering 104/302 (removed 198) transitions.
// Phase 1: matrix 104 rows 126 cols
[2022-05-20 04:17:17] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-20 04:17:17] [INFO ] Implicit Places using invariants in 74 ms returned [109, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/337 places, 104/302 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 122 transition count 102
Applied a total of 4 rules in 4 ms. Remains 122 /124 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 122 cols
[2022-05-20 04:17:17] [INFO ] Computed 53 place invariants in 0 ms
[2022-05-20 04:17:17] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 102 rows 122 cols
[2022-05-20 04:17:17] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-20 04:17:17] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/337 places, 102/302 transitions.
Finished structural reductions, in 2 iterations. Remains : 122/337 places, 102/302 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/122 stabilizing places and 2/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p1]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p1]
Stuttering acceptance computed with spot in 26 ms :[p1]
// Phase 1: matrix 102 rows 122 cols
[2022-05-20 04:17:17] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-20 04:17:18] [INFO ] [Real]Absence check using 53 positive place invariants in 8 ms returned sat
[2022-05-20 04:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 04:17:18] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-20 04:17:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 04:17:18] [INFO ] [Nat]Absence check using 53 positive place invariants in 8 ms returned sat
[2022-05-20 04:17:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 04:17:18] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-20 04:17:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
[2022-05-20 04:17:18] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2022-05-20 04:17:18] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2022-05-20 04:17:18] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2022-05-20 04:17:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 144 ms
[2022-05-20 04:17:18] [INFO ] Computed and/alt/rep : 97/164/97 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-20 04:17:18] [INFO ] Added : 77 causal constraints over 17 iterations in 184 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 40 ms :[p1]
Product exploration explored 100000 steps with 23460 reset in 164 ms.
Stack based approach found an accepted trace after 50 steps with 12 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-03 finished in 6120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(p0) U ((G(p1)&&p1)||!p0))))'
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 344 transition count 235
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 270 transition count 235
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 148 place count 270 transition count 202
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 214 place count 237 transition count 202
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 218 place count 233 transition count 198
Iterating global reduction 2 with 4 rules applied. Total rules applied 222 place count 233 transition count 198
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 222 place count 233 transition count 195
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 228 place count 230 transition count 195
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 400 place count 144 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 401 place count 144 transition count 108
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 403 place count 143 transition count 107
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 431 place count 129 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 433 place count 127 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 434 place count 126 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 434 place count 126 transition count 103
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 438 place count 124 transition count 103
Applied a total of 438 rules in 45 ms. Remains 124 /345 variables (removed 221) and now considering 103/310 (removed 207) transitions.
// Phase 1: matrix 103 rows 124 cols
[2022-05-20 04:17:18] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-20 04:17:18] [INFO ] Implicit Places using invariants in 77 ms returned [107, 111]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/345 places, 103/310 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 120 transition count 101
Applied a total of 4 rules in 6 ms. Remains 120 /122 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:18] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-20 04:17:18] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:18] [INFO ] Computed 53 place invariants in 0 ms
[2022-05-20 04:17:19] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/345 places, 101/310 transitions.
Finished structural reductions, in 2 iterations. Remains : 120/345 places, 101/310 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s25 1), p1:(EQ s74 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 116 reset in 210 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 84 in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-04 finished in 606 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(X(p0))||G(p1))&&(G(p2)||F(p1))))))'
Support contains 4 out of 345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 344 transition count 237
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 272 transition count 237
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 144 place count 272 transition count 204
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 210 place count 239 transition count 204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 215 place count 234 transition count 199
Iterating global reduction 2 with 5 rules applied. Total rules applied 220 place count 234 transition count 199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 220 place count 234 transition count 195
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 228 place count 230 transition count 195
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 394 place count 147 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 395 place count 147 transition count 111
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 397 place count 146 transition count 110
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 423 place count 133 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 425 place count 131 transition count 108
Applied a total of 425 rules in 29 ms. Remains 131 /345 variables (removed 214) and now considering 108/310 (removed 202) transitions.
// Phase 1: matrix 108 rows 131 cols
[2022-05-20 04:17:19] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:19] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 108 rows 131 cols
[2022-05-20 04:17:19] [INFO ] Computed 56 place invariants in 0 ms
[2022-05-20 04:17:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 04:17:19] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-05-20 04:17:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 131 cols
[2022-05-20 04:17:19] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:19] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/345 places, 108/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/345 places, 108/310 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0, 1, 2} source=0 dest: 2}, { cond=p1, acceptance={1, 2} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1, 2} source=1 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0, 1, 2} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0, 2} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={2} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1, 2} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 2} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1, 2} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0, 2} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND p1 p0), acceptance={1, 2} source=6 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={2} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s110 0) (EQ s124 0)), p1:(EQ s78 1), p0:(EQ s26 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1146 reset in 210 ms.
Stack based approach found an accepted trace after 1143 steps with 15 reset with depth 41 and stack size 37 in 3 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-05 finished in 826 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((p0 U p1)))&&X(p2)&&F(G(p0))))'
Support contains 3 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 337 transition count 302
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 337 transition count 302
Applied a total of 16 rules in 23 ms. Remains 337 /345 variables (removed 8) and now considering 302/310 (removed 8) transitions.
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:20] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-20 04:17:20] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:20] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:20] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:20] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-20 04:17:20] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/345 places, 302/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/345 places, 302/310 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s271 0), p1:(AND (EQ s102 1) (EQ s139 1)), p0:(EQ s271 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 204 ms.
Stack based approach found an accepted trace after 178 steps with 0 reset with depth 179 and stack size 179 in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-06 finished in 864 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p1 U F(p2))&&p0))||G(p3)))'
Support contains 4 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 336 transition count 301
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 336 transition count 301
Applied a total of 18 rules in 15 ms. Remains 336 /345 variables (removed 9) and now considering 301/310 (removed 9) transitions.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:21] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-20 04:17:21] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:21] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:21] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:21] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:21] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/345 places, 301/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/345 places, 301/310 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p2), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(AND (EQ s97 1) (EQ s139 1)), p0:(AND (OR (EQ s243 1) (EQ s177 1)) (EQ s177 1)), p3:(EQ s243 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, null, null][false, 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-005B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-08 finished in 697 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(X(X(p0))))&&X(G(p1)))))'
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 338 transition count 303
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 338 transition count 303
Applied a total of 14 rules in 16 ms. Remains 338 /345 variables (removed 7) and now considering 303/310 (removed 7) transitions.
// Phase 1: matrix 303 rows 338 cols
[2022-05-20 04:17:21] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:21] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 303 rows 338 cols
[2022-05-20 04:17:21] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:22] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 303 rows 338 cols
[2022-05-20 04:17:22] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:22] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 338/345 places, 303/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 338/345 places, 303/310 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(EQ s267 1), p0:(EQ s273 0)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-09 finished in 606 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 336 transition count 301
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 336 transition count 301
Applied a total of 18 rules in 11 ms. Remains 336 /345 variables (removed 9) and now considering 301/310 (removed 9) transitions.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:22] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:22] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:22] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:22] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:22] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:22] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/345 places, 301/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/345 places, 301/310 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s242 1) (AND (EQ s294 1) (EQ s296 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 156 reset in 177 ms.
Stack based approach found an accepted trace after 562 steps with 1 reset with depth 194 and stack size 194 in 1 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-10 finished in 729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 1 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 337 transition count 302
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 337 transition count 302
Applied a total of 16 rules in 15 ms. Remains 337 /345 variables (removed 8) and now considering 302/310 (removed 8) transitions.
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:23] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:23] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:23] [INFO ] Computed 56 place invariants in 0 ms
[2022-05-20 04:17:23] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
// Phase 1: matrix 302 rows 337 cols
[2022-05-20 04:17:23] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:23] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/345 places, 302/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/345 places, 302/310 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-11 finished in 542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 336 transition count 301
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 336 transition count 301
Applied a total of 18 rules in 17 ms. Remains 336 /345 variables (removed 9) and now considering 301/310 (removed 9) transitions.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:23] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-20 04:17:23] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:23] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:23] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:23] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:24] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/345 places, 301/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/345 places, 301/310 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s185 1) (EQ s112 0) (EQ s112 1)) (EQ s112 1)), p1:(EQ s185 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 118 reset in 201 ms.
Stack based approach found an accepted trace after 150 steps with 0 reset with depth 151 and stack size 151 in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-12 finished in 782 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(F(p0)))))'
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 344 transition count 236
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 271 transition count 236
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 146 place count 271 transition count 202
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 214 place count 237 transition count 202
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 220 place count 231 transition count 196
Iterating global reduction 2 with 6 rules applied. Total rules applied 226 place count 231 transition count 196
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 226 place count 231 transition count 192
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 234 place count 227 transition count 192
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 400 place count 144 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 401 place count 144 transition count 108
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 403 place count 143 transition count 107
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 431 place count 129 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 433 place count 127 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 434 place count 126 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 434 place count 126 transition count 103
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 438 place count 124 transition count 103
Applied a total of 438 rules in 27 ms. Remains 124 /345 variables (removed 221) and now considering 103/310 (removed 207) transitions.
// Phase 1: matrix 103 rows 124 cols
[2022-05-20 04:17:24] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-20 04:17:24] [INFO ] Implicit Places using invariants in 68 ms returned [107, 111]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/345 places, 103/310 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 120 transition count 101
Applied a total of 4 rules in 3 ms. Remains 120 /122 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:24] [INFO ] Computed 53 place invariants in 0 ms
[2022-05-20 04:17:24] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:24] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-20 04:17:24] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/345 places, 101/310 transitions.
Finished structural reductions, in 2 iterations. Remains : 120/345 places, 101/310 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-13 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:(OR (EQ s63 0) (EQ s78 0))], 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 302 reset in 198 ms.
Product exploration explored 100000 steps with 288 reset in 217 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 713 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=142 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 101/101 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:25] [INFO ] Computed 53 place invariants in 0 ms
[2022-05-20 04:17:25] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:25] [INFO ] Computed 53 place invariants in 0 ms
[2022-05-20 04:17:25] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-05-20 04:17:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 101 rows 120 cols
[2022-05-20 04:17:25] [INFO ] Computed 53 place invariants in 0 ms
[2022-05-20 04:17:25] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 101/101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 236 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=59 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 302 reset in 196 ms.
Product exploration explored 100000 steps with 285 reset in 214 ms.
Built C files in :
/tmp/ltsmin3246493756888336652
[2022-05-20 04:17:26] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2022-05-20 04:17:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:17:26] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2022-05-20 04:17:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:17:26] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2022-05-20 04:17:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:17:26] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3246493756888336652
Running compilation step : cd /tmp/ltsmin3246493756888336652;'/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 208 ms.
Running link step : cd /tmp/ltsmin3246493756888336652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3246493756888336652;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17553809483555686721.hoa' '--buchi-type=spotba'
LTSmin run took 424 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-005B-LTLFireability-13 finished in 3024 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))||F(X(F(p1))))))'
Support contains 3 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 336 transition count 301
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 336 transition count 301
Applied a total of 18 rules in 10 ms. Remains 336 /345 variables (removed 9) and now considering 301/310 (removed 9) transitions.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:27] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-20 04:17:27] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:27] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:27] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
// Phase 1: matrix 301 rows 336 cols
[2022-05-20 04:17:27] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 04:17:27] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/345 places, 301/310 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/345 places, 301/310 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (EQ s99 1) (EQ s192 1)), p1:(EQ s138 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 255 reset in 190 ms.
Stack based approach found an accepted trace after 4194 steps with 10 reset with depth 359 and stack size 359 in 9 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-14 finished in 759 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 345/345 places, 310/310 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 344 transition count 235
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 270 transition count 235
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 148 place count 270 transition count 201
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 216 place count 236 transition count 201
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 220 place count 232 transition count 197
Iterating global reduction 2 with 4 rules applied. Total rules applied 224 place count 232 transition count 197
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 224 place count 232 transition count 194
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 230 place count 229 transition count 194
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 402 place count 143 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 403 place count 143 transition count 107
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 405 place count 142 transition count 106
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 433 place count 128 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 435 place count 126 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 436 place count 125 transition count 104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 436 place count 125 transition count 102
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 440 place count 123 transition count 102
Applied a total of 440 rules in 26 ms. Remains 123 /345 variables (removed 222) and now considering 102/310 (removed 208) transitions.
// Phase 1: matrix 102 rows 123 cols
[2022-05-20 04:17:28] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-20 04:17:28] [INFO ] Implicit Places using invariants in 63 ms returned [106, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/345 places, 102/310 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 119 transition count 100
Applied a total of 4 rules in 3 ms. Remains 119 /121 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 119 cols
[2022-05-20 04:17:28] [INFO ] Computed 53 place invariants in 0 ms
[2022-05-20 04:17:28] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 100 rows 119 cols
[2022-05-20 04:17:28] [INFO ] Computed 53 place invariants in 0 ms
[2022-05-20 04:17:28] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/345 places, 100/310 transitions.
Finished structural reductions, in 2 iterations. Remains : 119/345 places, 100/310 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-15 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:(NEQ s73 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 571 reset in 197 ms.
Stack based approach found an accepted trace after 67281 steps with 355 reset with depth 88 and stack size 70 in 176 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-15 finished in 682 ms.
All properties solved by simple procedures.
Total runtime 23984 ms.
BK_STOP 1653020248960
--------------------
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-005B"
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-005B, 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-165286025500604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-005B.tgz
mv ShieldPPPt-PT-005B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;