fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286025100364
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldPPPs-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
352.455 16410.00 30596.00 905.50 FFFFFFFFFTTTFFFT 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-165286025100364.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 ShieldPPPs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025100364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 6.6K Apr 30 03:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 03:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 03:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 18K 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 ShieldPPPs-PT-001B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652971532518

Running Version 202205111006
[2022-05-19 14:45:33] [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-19 14:45:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 14:45:33] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2022-05-19 14:45:33] [INFO ] Transformed 71 places.
[2022-05-19 14:45:33] [INFO ] Transformed 66 transitions.
[2022-05-19 14:45:33] [INFO ] Found NUPN structural information;
[2022-05-19 14:45:33] [INFO ] Parsed PT model containing 71 places and 66 transitions in 173 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 2 formulas.
FORMULA ShieldPPPs-PT-001B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 62
Applied a total of 8 rules in 13 ms. Remains 67 /71 variables (removed 4) and now considering 62/66 (removed 4) transitions.
// Phase 1: matrix 62 rows 67 cols
[2022-05-19 14:45:34] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-19 14:45:34] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 62 rows 67 cols
[2022-05-19 14:45:34] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-19 14:45:34] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 67 cols
[2022-05-19 14:45:34] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-19 14:45:34] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/71 places, 62/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/71 places, 62/66 transitions.
Support contains 29 out of 67 places after structural reductions.
[2022-05-19 14:45:34] [INFO ] Flatten gal took : 45 ms
[2022-05-19 14:45:34] [INFO ] Flatten gal took : 9 ms
[2022-05-19 14:45:34] [INFO ] Input system was already deterministic with 62 transitions.
Finished random walk after 714 steps, including 2 resets, run visited all 26 properties in 42 ms. (steps per millisecond=17 )
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1))))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Applied a total of 6 rules in 7 ms. Remains 64 /67 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:35] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-19 14:45:35] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:35] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:35] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:35] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-19 14:45:35] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 59/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 59/62 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s61 1), p1:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-00 finished in 574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(p0)))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 66 transition count 54
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 59 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 59 transition count 49
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 54 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 52 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 52 transition count 47
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 60 place count 36 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 35 transition count 30
Applied a total of 61 rules in 21 ms. Remains 35 /67 variables (removed 32) and now considering 30/62 (removed 32) transitions.
// Phase 1: matrix 30 rows 35 cols
[2022-05-19 14:45:35] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:35] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 30 rows 35 cols
[2022-05-19 14:45:35] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:35] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-19 14:45:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 35 cols
[2022-05-19 14:45:35] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-19 14:45:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/67 places, 30/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/67 places, 30/62 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-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:(OR (EQ s24 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-01 finished in 208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 59
Applied a total of 6 rules in 7 ms. Remains 64 /67 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:35] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:35] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:35] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:35] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:35] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:35] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 59/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 59/62 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s42 1)), p1:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1951 reset in 344 ms.
Product exploration explored 100000 steps with 1970 reset in 306 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 351 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 43 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 9 factoid took 428 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:37] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:37] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-19 14:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:45:37] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-19 14:45:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:45:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-19 14:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:45:38] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-19 14:45:38] [INFO ] Computed and/alt/rep : 58/102/58 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-19 14:45:38] [INFO ] Added : 58 causal constraints over 12 iterations in 332 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:38] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:38] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:38] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:38] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:38] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:38] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 59/59 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 403 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 62 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 9 factoid took 1188 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:40] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:40] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-19 14:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:45:40] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-05-19 14:45:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:45:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-19 14:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:45:40] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-19 14:45:40] [INFO ] Computed and/alt/rep : 58/102/58 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-19 14:45:40] [INFO ] Added : 58 causal constraints over 12 iterations in 98 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1965 reset in 129 ms.
Product exploration explored 100000 steps with 1974 reset in 127 ms.
Built C files in :
/tmp/ltsmin2084335236245638588
[2022-05-19 14:45:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2084335236245638588
Running compilation step : cd /tmp/ltsmin2084335236245638588;'/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 228 ms.
Running link step : cd /tmp/ltsmin2084335236245638588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2084335236245638588;'/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/stateBased11943512203046483565.hoa' '--buchi-type=spotba'
LTSmin run took 98 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLFireability-02 finished in 6023 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((X(p0)&&G(p1))))||G((p2 U X(p3)))))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Applied a total of 6 rules in 9 ms. Remains 64 /67 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:41] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:41] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:41] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-19 14:45:41] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:41] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:41] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 59/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 59/62 transitions.
Stuttering acceptance computed with spot in 503 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND p1 (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 9}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 9}, { cond=(NOT p3), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=3 dest: 6}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=7 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}, { cond=p1, acceptance={0} source=8 dest: 9}, { cond=p1, acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={0} source=9 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=10 dest: 8}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={} source=11 dest: 8}, { cond=p1, acceptance={} source=11 dest: 9}, { cond=true, acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(EQ s38 1), p1:(AND (EQ s20 1) (EQ s53 1)), p3:(AND (EQ s19 1) (EQ s21 1)), p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 279 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-03 finished in 654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)&&p1) U p2)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Applied a total of 6 rules in 5 ms. Remains 64 /67 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:42] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:42] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:42] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:42] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:42] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:42] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 59/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 59/62 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s18 1) (EQ s40 1)), p1:(EQ s44 1), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-04 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Applied a total of 8 rules in 26 ms. Remains 63 /67 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:42] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:42] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:42] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-19 14:45:42] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:42] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 58/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/67 places, 58/62 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s2 1) (EQ s13 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-05 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U F(!X(p0))))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Applied a total of 8 rules in 6 ms. Remains 63 /67 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:43] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:43] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-19 14:45:43] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:43] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 58/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/67 places, 58/62 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-06 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 s10 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 ShieldPPPs-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-06 finished in 246 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((G(p1)&&p0))||p2))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 59
Applied a total of 6 rules in 6 ms. Remains 64 /67 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:43] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:43] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-19 14:45:43] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 59/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 59/62 transitions.
Stuttering acceptance computed with spot in 385 ms :[true, (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s18 0) (EQ s41 0)), p2:(AND (EQ s19 1) (EQ s21 1)), p0:(AND (EQ s38 0) (OR (EQ s19 0) (EQ s21 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-07 finished in 539 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 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 53
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 58 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 57 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 57 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 52 transition count 47
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 31 place count 49 transition count 44
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 49 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 34 place count 49 transition count 43
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 36 place count 48 transition count 43
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 68 place count 32 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 31 transition count 26
Applied a total of 69 rules in 18 ms. Remains 31 /67 variables (removed 36) and now considering 26/62 (removed 36) transitions.
// Phase 1: matrix 26 rows 31 cols
[2022-05-19 14:45:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:43] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 26 rows 31 cols
[2022-05-19 14:45:43] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-19 14:45:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 26 rows 31 cols
[2022-05-19 14:45:43] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/67 places, 26/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/67 places, 26/62 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-08 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 s15 1) (EQ s17 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 15444 reset in 85 ms.
Stack based approach found an accepted trace after 5989 steps with 933 reset with depth 24 and stack size 24 in 7 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-08 finished in 316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||G(p2)||F(p0)))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 59
Applied a total of 6 rules in 2 ms. Remains 64 /67 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:44] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:44] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:44] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:44] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:44] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:44] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 59/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 59/62 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s36 1), p1:(EQ s13 1), p2:(EQ s9 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 8990 reset in 83 ms.
Product exploration explored 100000 steps with 8973 reset in 88 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Detected a total of 12/64 stabilizing places and 12/59 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 924 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 299 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 59 rows 64 cols
[2022-05-19 14:45:45] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:46] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-19 14:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:45:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 14:45:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 14:45:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-19 14:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 14:45:46] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-19 14:45:46] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
[2022-05-19 14:45:46] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2022-05-19 14:45:46] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2022-05-19 14:45:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 131 ms
[2022-05-19 14:45:46] [INFO ] Computed and/alt/rep : 58/102/58 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 14:45:46] [INFO ] Added : 50 causal constraints over 10 iterations in 84 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 64 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 : 64/64 places, 59/59 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 50
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 55 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 55 transition count 45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 50 transition count 45
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 54 place count 36 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 35 transition count 30
Applied a total of 55 rules in 6 ms. Remains 35 /64 variables (removed 29) and now considering 30/59 (removed 29) transitions.
// Phase 1: matrix 30 rows 35 cols
[2022-05-19 14:45:46] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:46] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 30 rows 35 cols
[2022-05-19 14:45:46] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-19 14:45:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 35 cols
[2022-05-19 14:45:46] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/64 places, 30/59 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/64 places, 30/59 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/35 stabilizing places and 3/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-001B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLFireability-10 finished in 2413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(X(!p0))))&&X(p1)))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Applied a total of 8 rules in 4 ms. Remains 63 /67 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:46] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:46] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:46] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:46] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:46] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 58/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/67 places, 58/62 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(NEQ s39 1), p1:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-12 finished in 290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 53
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 58 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 57 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 57 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 52 transition count 47
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 31 place count 49 transition count 44
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 49 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 34 place count 49 transition count 43
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 36 place count 48 transition count 43
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 68 place count 32 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 31 transition count 26
Applied a total of 69 rules in 11 ms. Remains 31 /67 variables (removed 36) and now considering 26/62 (removed 36) transitions.
// Phase 1: matrix 26 rows 31 cols
[2022-05-19 14:45:46] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:46] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 26 rows 31 cols
[2022-05-19 14:45:46] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:46] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-19 14:45:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 31 cols
[2022-05-19 14:45:46] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/67 places, 26/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/67 places, 26/62 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s17 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 24194 reset in 82 ms.
Stack based approach found an accepted trace after 10457 steps with 2509 reset with depth 15 and stack size 15 in 16 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-13 finished in 244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((p1 U X(p2))&&p0))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Applied a total of 8 rules in 3 ms. Remains 63 /67 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:47] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:47] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:47] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-19 14:45:47] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:47] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:47] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 58/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/67 places, 58/62 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s60 1)), p1:(NEQ s13 1), p2:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 596 steps with 3 reset in 1 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-14 finished in 719 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(((X(X(F(p1)))||p2)&&F(G(p3))))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Applied a total of 8 rules in 6 ms. Remains 63 /67 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:47] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:48] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:48] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 14:45:48] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
// Phase 1: matrix 58 rows 63 cols
[2022-05-19 14:45:48] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 14:45:48] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 58/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/67 places, 58/62 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s48 1)), p0:(OR (EQ s34 0) (EQ s52 0)), p3:(AND (EQ s34 1) (EQ s52 1)), p1:(EQ s10 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 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/63 stabilizing places and 11/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p3) (NOT p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 5 states, 7 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-001B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLFireability-15 finished in 1014 ms.
All properties solved by simple procedures.
Total runtime 15120 ms.

BK_STOP 1652971548928

--------------------
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="ShieldPPPs-PT-001B"
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 ShieldPPPs-PT-001B, 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-165286025100364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-001B.tgz
mv ShieldPPPs-PT-001B 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 ;