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-165286025300468.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-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.7K Apr 30 03:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 30 03:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 30 03:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 30 03:20 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.3K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 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 265K 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-030A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-030A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652995119707

Running Version 202205111006
[2022-05-19 21:18:40] [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 21:18:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 21:18:41] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2022-05-19 21:18:41] [INFO ] Transformed 933 places.
[2022-05-19 21:18:41] [INFO ] Transformed 783 transitions.
[2022-05-19 21:18:41] [INFO ] Found NUPN structural information;
[2022-05-19 21:18:41] [INFO ] Parsed PT model containing 933 places and 783 transitions in 279 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-030A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 90 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:41] [INFO ] Computed 331 place invariants in 26 ms
[2022-05-19 21:18:41] [INFO ] Implicit Places using invariants in 598 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:42] [INFO ] Computed 331 place invariants in 13 ms
[2022-05-19 21:18:42] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:42] [INFO ] Computed 331 place invariants in 6 ms
[2022-05-19 21:18:43] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Support contains 51 out of 933 places after structural reductions.
[2022-05-19 21:18:43] [INFO ] Flatten gal took : 130 ms
[2022-05-19 21:18:43] [INFO ] Flatten gal took : 73 ms
[2022-05-19 21:18:43] [INFO ] Input system was already deterministic with 783 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 31) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:44] [INFO ] Computed 331 place invariants in 11 ms
[2022-05-19 21:18:44] [INFO ] [Real]Absence check using 331 positive place invariants in 52 ms returned sat
[2022-05-19 21:18:44] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 21:18:44] [INFO ] [Nat]Absence check using 331 positive place invariants in 45 ms returned sat
[2022-05-19 21:18:45] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 21:18:45] [INFO ] After 453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-19 21:18:45] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2747 steps, including 474 resets, run visited all 1 properties in 37 ms. (steps per millisecond=74 )
Parikh walk visited 1 properties in 40 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(G(p1))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 38 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:45] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-19 21:18:46] [INFO ] Implicit Places using invariants in 524 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:46] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:18:47] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:47] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:18:47] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s760 0) (EQ s775 0) (EQ s779 0) (EQ s800 0)), p1:(OR (EQ s779 0) (EQ s800 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 48 reset in 861 ms.
Product exploration explored 100000 steps with 48 reset in 910 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 243 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 2439 steps, including 1 resets, run visited all 3 properties in 25 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 298 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 18 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:50] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-19 21:18:51] [INFO ] Implicit Places using invariants in 427 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:51] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:18:52] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:52] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:18:52] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :2
Finished Best-First random walk after 6018 steps, including 1 resets, run visited all 1 properties in 26 ms. (steps per millisecond=231 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 256 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 49 reset in 727 ms.
Product exploration explored 100000 steps with 48 reset in 855 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 933 transition count 783
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 125 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2022-05-19 21:18:55] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:18:55] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:18:56] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 933/933 places, 783/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Product exploration explored 100000 steps with 49 reset in 729 ms.
Product exploration explored 100000 steps with 49 reset in 827 ms.
Built C files in :
/tmp/ltsmin4232625613465950886
[2022-05-19 21:18:57] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4232625613465950886
Running compilation step : cd /tmp/ltsmin4232625613465950886;'/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 1396 ms.
Running link step : cd /tmp/ltsmin4232625613465950886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4232625613465950886;'/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/stateBased13856192408132939427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 50 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:19:13] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-19 21:19:13] [INFO ] Implicit Places using invariants in 466 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:19:13] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-19 21:19:14] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:19:14] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-19 21:19:14] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Built C files in :
/tmp/ltsmin4505830226463039162
[2022-05-19 21:19:14] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4505830226463039162
Running compilation step : cd /tmp/ltsmin4505830226463039162;'/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 1332 ms.
Running link step : cd /tmp/ltsmin4505830226463039162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4505830226463039162;'/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/stateBased12121392962991712386.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 21:19:30] [INFO ] Flatten gal took : 52 ms
[2022-05-19 21:19:30] [INFO ] Flatten gal took : 52 ms
[2022-05-19 21:19:30] [INFO ] Time to serialize gal into /tmp/LTL16693331289337722842.gal : 9 ms
[2022-05-19 21:19:30] [INFO ] Time to serialize properties into /tmp/LTL4287960374460691283.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16693331289337722842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4287960374460691283.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1669333...267
Read 1 LTL properties
Checking formula 0 : !(((X(G("(((p760==0)||(p775==0))||((p779==0)||(p800==0)))")))&&(F(G("((p779==0)||(p800==0))")))))
Formula 0 simplified : !(XG"(((p760==0)||(p775==0))||((p779==0)||(p800==0)))" & FG"((p779==0)||(p800==0))")
Detected timeout of ITS tools.
[2022-05-19 21:19:45] [INFO ] Flatten gal took : 44 ms
[2022-05-19 21:19:45] [INFO ] Applying decomposition
[2022-05-19 21:19:45] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9678605679524206763.txt' '-o' '/tmp/graph9678605679524206763.bin' '-w' '/tmp/graph9678605679524206763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9678605679524206763.bin' '-l' '-1' '-v' '-w' '/tmp/graph9678605679524206763.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:19:45] [INFO ] Decomposing Gal with order
[2022-05-19 21:19:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:19:45] [INFO ] Removed a total of 180 redundant transitions.
[2022-05-19 21:19:45] [INFO ] Flatten gal took : 106 ms
[2022-05-19 21:19:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 366 labels/synchronizations in 80 ms.
[2022-05-19 21:19:45] [INFO ] Time to serialize gal into /tmp/LTL9362630974347095276.gal : 11 ms
[2022-05-19 21:19:45] [INFO ] Time to serialize properties into /tmp/LTL8352213969004996512.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9362630974347095276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8352213969004996512.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9362630...245
Read 1 LTL properties
Checking formula 0 : !(((X(G("(((i24.u270.p760==0)||(i24.u275.p775==0))||((i25.u276.p779==0)||(i25.u284.p800==0)))")))&&(F(G("((i25.u276.p779==0)||(i25.u28...172
Formula 0 simplified : !(XG"(((i24.u270.p760==0)||(i24.u275.p775==0))||((i25.u276.p779==0)||(i25.u284.p800==0)))" & FG"((i25.u276.p779==0)||(i25.u284.p800=...161
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16005412064800435729
[2022-05-19 21:20:00] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16005412064800435729
Running compilation step : cd /tmp/ltsmin16005412064800435729;'/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 1298 ms.
Running link step : cd /tmp/ltsmin16005412064800435729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16005412064800435729;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([]((LTLAPp0==true)))&&<>([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-030A-LTLFireability-00 finished in 90075 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(X(F(p0)))))))'
Support contains 1 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 16 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:16] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:20:16] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:16] [INFO ] Computed 331 place invariants in 6 ms
[2022-05-19 21:20:17] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:17] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:20:17] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s766 0)], 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 20000 reset in 998 ms.
Product exploration explored 100000 steps with 20000 reset in 1051 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 289 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=96 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 23 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:20] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:20:21] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:21] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:20:22] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:22] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:20:22] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2495 steps, including 1 resets, run visited all 1 properties in 20 ms. (steps per millisecond=124 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 994 ms.
Product exploration explored 100000 steps with 20000 reset in 1062 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 933 transition count 783
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 51 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2022-05-19 21:20:25] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:25] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:20:26] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 933/933 places, 783/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Product exploration explored 100000 steps with 20000 reset in 3312 ms.
Product exploration explored 100000 steps with 20000 reset in 3368 ms.
Built C files in :
/tmp/ltsmin11886517194369126191
[2022-05-19 21:20:33] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11886517194369126191
Running compilation step : cd /tmp/ltsmin11886517194369126191;'/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 1389 ms.
Running link step : cd /tmp/ltsmin11886517194369126191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11886517194369126191;'/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/stateBased18007337843395915582.hoa' '--buchi-type=spotba'
LTSmin run took 183 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-030A-LTLFireability-01 finished in 18743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 18 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:34] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:20:35] [INFO ] Implicit Places using invariants in 428 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:35] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:20:36] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:36] [INFO ] Computed 331 place invariants in 6 ms
[2022-05-19 21:20:36] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-02 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 s345 0) (EQ s366 0))], 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 50000 reset in 1746 ms.
Product exploration explored 100000 steps with 50000 reset in 1806 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-030A-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-030A-LTLFireability-02 finished in 5460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 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 931 transition count 781
Applied a total of 4 rules in 52 ms. Remains 931 /933 variables (removed 2) and now considering 781/783 (removed 2) transitions.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:20:40] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:20:40] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:20:40] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:20:41] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
[2022-05-19 21:20:41] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:20:41] [INFO ] Computed 331 place invariants in 6 ms
[2022-05-19 21:20:42] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 931/933 places, 781/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 931/933 places, 781/783 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s254 1) (EQ s270 1)), p0:(OR (EQ s345 0) (EQ s366 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2007 steps with 0 reset in 21 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030A-LTLFireability-03 finished in 2044 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||!(X(p1) U !p2)))'
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 19 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:42] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:20:42] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:42] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:20:43] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:43] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:20:44] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s915 0) (EQ s932 0)), p2:(AND (EQ s352 1) (EQ s364 1)), p1:(AND (EQ s299 1) (EQ s320 1) (EQ s915 1) (EQ s932 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 19409 reset in 1037 ms.
Product exploration explored 100000 steps with 19431 reset in 1126 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1396 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=93 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 318 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 19 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:47] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-19 21:20:47] [INFO ] Implicit Places using invariants in 436 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:47] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:20:48] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:48] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:20:49] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1335 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=111 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2 p0)), (F (NOT (AND (NOT p1) (NOT p2) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 341 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19417 reset in 1044 ms.
Product exploration explored 100000 steps with 19408 reset in 1128 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 933 transition count 783
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 51 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2022-05-19 21:20:53] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:20:53] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:20:53] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 933/933 places, 783/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Product exploration explored 100000 steps with 19314 reset in 2556 ms.
Product exploration explored 100000 steps with 19414 reset in 2688 ms.
Built C files in :
/tmp/ltsmin16315065808499524084
[2022-05-19 21:20:58] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16315065808499524084
Running compilation step : cd /tmp/ltsmin16315065808499524084;'/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 1361 ms.
Running link step : cd /tmp/ltsmin16315065808499524084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16315065808499524084;'/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/stateBased10033859363868812491.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 19 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:21:13] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:21:14] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:21:14] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:21:15] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:21:15] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-19 21:21:15] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Built C files in :
/tmp/ltsmin3141800667119244263
[2022-05-19 21:21:15] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3141800667119244263
Running compilation step : cd /tmp/ltsmin3141800667119244263;'/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 1287 ms.
Running link step : cd /tmp/ltsmin3141800667119244263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3141800667119244263;'/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/stateBased2866024472004055580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 21:21:30] [INFO ] Flatten gal took : 36 ms
[2022-05-19 21:21:30] [INFO ] Flatten gal took : 35 ms
[2022-05-19 21:21:30] [INFO ] Time to serialize gal into /tmp/LTL14609018777423045384.gal : 6 ms
[2022-05-19 21:21:30] [INFO ] Time to serialize properties into /tmp/LTL1842034505958270688.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14609018777423045384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1842034505958270688.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1460901...267
Read 1 LTL properties
Checking formula 0 : !(((X(F(X("((p915==0)||(p932==0))"))))||(!((X("(((p299==1)&&(p320==1))&&((p915==1)&&(p932==1)))"))U(!("((p352==1)&&(p364==1))"))))))
Formula 0 simplified : !(XFX"((p915==0)||(p932==0))" | !(X"(((p299==1)&&(p320==1))&&((p915==1)&&(p932==1)))" U !"((p352==1)&&(p364==1))"))
Detected timeout of ITS tools.
[2022-05-19 21:21:45] [INFO ] Flatten gal took : 32 ms
[2022-05-19 21:21:45] [INFO ] Applying decomposition
[2022-05-19 21:21:45] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7678326870307335168.txt' '-o' '/tmp/graph7678326870307335168.bin' '-w' '/tmp/graph7678326870307335168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7678326870307335168.bin' '-l' '-1' '-v' '-w' '/tmp/graph7678326870307335168.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:21:45] [INFO ] Decomposing Gal with order
[2022-05-19 21:21:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:21:46] [INFO ] Removed a total of 180 redundant transitions.
[2022-05-19 21:21:46] [INFO ] Flatten gal took : 51 ms
[2022-05-19 21:21:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 22 ms.
[2022-05-19 21:21:46] [INFO ] Time to serialize gal into /tmp/LTL7823767584697981616.gal : 8 ms
[2022-05-19 21:21:46] [INFO ] Time to serialize properties into /tmp/LTL14703588854920293237.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7823767584697981616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14703588854920293237.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7823767...246
Read 1 LTL properties
Checking formula 0 : !(((X(F(X("((i29.i2.u325.p915==0)||(i29.i4.u330.p932==0))"))))||(!((X("(((i9.i3.u107.p299==1)&&(i10.i1.u114.p320==1))&&((i29.i2.u325.p...248
Formula 0 simplified : !(XFX"((i29.i2.u325.p915==0)||(i29.i4.u330.p932==0))" | !(X"(((i9.i3.u107.p299==1)&&(i10.i1.u114.p320==1))&&((i29.i2.u325.p915==1)&&...233
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3919504857543277067
[2022-05-19 21:22:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3919504857543277067
Running compilation step : cd /tmp/ltsmin3919504857543277067;'/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 1315 ms.
Running link step : cd /tmp/ltsmin3919504857543277067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3919504857543277067;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>(X((LTLAPp0==true))))||!(X((LTLAPp1==true)) U !(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-030A-LTLFireability-04 finished in 93975 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 931 transition count 781
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 930 transition count 780
Applied a total of 4 rules in 79 ms. Remains 930 /933 variables (removed 3) and now considering 780/783 (removed 3) transitions.
// Phase 1: matrix 780 rows 930 cols
[2022-05-19 21:22:16] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:22:16] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 780 rows 930 cols
[2022-05-19 21:22:16] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-19 21:22:17] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2022-05-19 21:22:17] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 780 rows 930 cols
[2022-05-19 21:22:17] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:22:18] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 930/933 places, 780/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 930/933 places, 780/783 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-05 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 s713 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 1886 steps with 0 reset in 18 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030A-LTLFireability-05 finished in 1940 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 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 13 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:18] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:22:18] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:18] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:22:19] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:19] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:19] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, p1, (AND (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}]], initial=1, aps=[p0:(EQ s776 1), p1:(AND (EQ s387 1) (EQ s429 1))], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 966 steps with 0 reset in 10 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030A-LTLFireability-06 finished in 2027 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1)||X(G(p2)))))'
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 20 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:20] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:22:20] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:20] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-19 21:22:21] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:21] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:22:22] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s689 1) (EQ s691 1)), p1:(AND (EQ s49 1) (EQ s60 1)), p2:(OR (EQ s378 0) (EQ s395 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1005 steps with 0 reset in 8 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030A-LTLFireability-08 finished in 2145 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p1)&&X(G(X(p2))))||p0)))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 19 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:22] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:22:22] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:22] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-19 21:22:23] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:23] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:24] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s287 0) (EQ s307 0)), p1:(AND (EQ s442 1) (EQ s462 1)), p2:(AND (EQ s287 1) (EQ s307 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]]
Stuttering criterion allowed to conclude after 1941 steps with 0 reset in 22 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030A-LTLFireability-09 finished in 2084 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||p0))&&F(X(F(p1)))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 15 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:24] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:22:24] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:24] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:22:25] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:25] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:22:26] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s55 1)), p1:(AND (EQ s626 1) (EQ s643 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]]
Entered a terminal (fully accepting) state of product in 449 steps with 1 reset in 6 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030A-LTLFireability-10 finished in 1996 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)&&(X((G(p2)&&p1))||G(p3))))))'
Support contains 7 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 931 transition count 781
Applied a total of 4 rules in 46 ms. Remains 931 /933 variables (removed 2) and now considering 781/783 (removed 2) transitions.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:26] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:22:26] [INFO ] Implicit Places using invariants in 466 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:26] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-19 21:22:27] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2022-05-19 21:22:27] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:27] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:28] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 931/933 places, 781/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 931/933 places, 781/783 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p3 (NOT p1)) (AND p3 (NOT p2))), acceptance={1} source=2 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p3 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p3 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p3 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s409 1) (EQ s426 1)), p3:(AND (EQ s49 1) (EQ s58 1)), p1:(AND (EQ s760 1) (EQ s775 1)), p2:(EQ s337 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3677 steps with 2 reset in 33 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030A-LTLFireability-11 finished in 2172 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((F((X(p1) U p2))||X(!p1))))))'
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 20 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:28] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:29] [INFO ] Implicit Places using invariants in 468 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:29] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:22:29] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:29] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:30] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Stuttering acceptance computed with spot in 305 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), false]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s292 1) (EQ s312 1)), p2:(AND (EQ s788 1) (EQ s807 1)), p1:(AND (EQ s879 1) (EQ s891 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24998 reset in 1221 ms.
Product exploration explored 100000 steps with 25088 reset in 1295 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 467 ms. Reduced automaton from 8 states, 19 edges and 3 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 693 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Finished random walk after 161 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) p1))]
Knowledge based reduction with 12 factoid took 527 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Support contains 4 out of 933 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 13 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:35] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:22:35] [INFO ] Implicit Places using invariants in 466 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:35] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:22:36] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:36] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:22:37] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Finished random walk after 357 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), true, (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Product exploration explored 100000 steps with 20044 reset in 1050 ms.
Product exploration explored 100000 steps with 20034 reset in 1130 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 933 transition count 783
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 52 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2022-05-19 21:22:40] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 783 rows 933 cols
[2022-05-19 21:22:40] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:22:41] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 933/933 places, 783/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 933/933 places, 783/783 transitions.
Product exploration explored 100000 steps with 20014 reset in 3455 ms.
Product exploration explored 100000 steps with 20043 reset in 3567 ms.
Built C files in :
/tmp/ltsmin11425383430764459162
[2022-05-19 21:22:48] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11425383430764459162
Running compilation step : cd /tmp/ltsmin11425383430764459162;'/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 1331 ms.
Running link step : cd /tmp/ltsmin11425383430764459162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11425383430764459162;'/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/stateBased18048615367616575161.hoa' '--buchi-type=spotba'
LTSmin run took 3140 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-030A-LTLFireability-12 finished in 24211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!p0 U (p0 U p1)) U (p2 U p3)))'
Support contains 7 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 931 transition count 781
Applied a total of 4 rules in 42 ms. Remains 931 /933 variables (removed 2) and now considering 781/783 (removed 2) transitions.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:52] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:22:53] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:53] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:54] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2022-05-19 21:22:54] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:54] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:22:54] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 931/933 places, 781/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 931/933 places, 781/783 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p3), true, p1, p1, (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s425 1), p1:(AND (EQ s623 1) (EQ s650 1)), p2:(AND (EQ s379 1) (EQ s381 1)), p0:(AND (EQ s700 1) (EQ s709 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 639 steps with 1 reset in 7 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030A-LTLFireability-13 finished in 2137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 1 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 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 931 transition count 781
Applied a total of 4 rules in 49 ms. Remains 931 /933 variables (removed 2) and now considering 781/783 (removed 2) transitions.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:54] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:55] [INFO ] Implicit Places using invariants in 449 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:55] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:56] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
[2022-05-19 21:22:56] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:56] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:56] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 931/933 places, 781/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 931/933 places, 781/783 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030A-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:(EQ s0 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]]
Stuttering criterion allowed to conclude after 1942 steps with 0 reset in 19 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030A-LTLFireability-15 finished in 2019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(G(p1))))'
Found a SL insensitive property : ShieldPPPs-PT-030A-LTLFireability-00
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 933/933 places, 783/783 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 931 transition count 781
Applied a total of 4 rules in 40 ms. Remains 931 /933 variables (removed 2) and now considering 781/783 (removed 2) transitions.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:57] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:22:57] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:57] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:58] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:22:58] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:22:58] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 931/933 places, 781/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 931/933 places, 781/783 transitions.
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s760 0) (EQ s775 0) (EQ s779 0) (EQ s800 0)), p1:(OR (EQ s779 0) (EQ s800 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 49 reset in 747 ms.
Product exploration explored 100000 steps with 49 reset in 881 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 701 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :2
Finished Best-First random walk after 9869 steps, including 2 resets, run visited all 1 properties in 40 ms. (steps per millisecond=246 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 298 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 931 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 22 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:23:02] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:23:02] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:23:02] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:23:03] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:23:03] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:23:03] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 931/931 places, 781/781 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 244 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 21:23:04] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:23:04] [INFO ] [Real]Absence check using 331 positive place invariants in 50 ms returned sat
[2022-05-19 21:23:04] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 21:23:05] [INFO ] [Nat]Absence check using 331 positive place invariants in 52 ms returned sat
[2022-05-19 21:23:05] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 21:23:05] [INFO ] After 687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2022-05-19 21:23:05] [INFO ] After 1037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 931 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 931/931 places, 781/781 transitions.
Partial Free-agglomeration rule applied 266 times.
Drop transitions removed 266 transitions
Iterating global reduction 0 with 266 rules applied. Total rules applied 266 place count 931 transition count 781
Applied a total of 266 rules in 89 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 931/931 places, 781/781 transitions.
Finished random walk after 4571 steps, including 1 resets, run visited all 1 properties in 43 ms. (steps per millisecond=106 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 49 reset in 751 ms.
Entered a terminal (fully accepting) state of product in 84216 steps with 41 reset in 754 ms.
Treatment of property ShieldPPPs-PT-030A-LTLFireability-00 finished in 11393 ms.
FORMULA ShieldPPPs-PT-030A-LTLFireability-00 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||!(X(p1) U !p2)))'
Found a CL insensitive property : ShieldPPPs-PT-030A-LTLFireability-04
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 932 transition count 782
Applied a total of 2 rules in 40 ms. Remains 932 /933 variables (removed 1) and now considering 782/783 (removed 1) transitions.
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:08] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:23:09] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:09] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:23:10] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:10] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:23:10] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 932/933 places, 782/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 932/933 places, 782/783 transitions.
Running random walk in product with property : ShieldPPPs-PT-030A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s915 0) (EQ s931 0)), p2:(AND (EQ s352 1) (EQ s364 1)), p1:(AND (EQ s299 1) (EQ s320 1) (EQ s915 1) (EQ s931 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19334 reset in 1006 ms.
Product exploration explored 100000 steps with 19259 reset in 1104 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1151 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 293 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 782/782 transitions.
Applied a total of 0 rules in 17 ms. Remains 932 /932 variables (removed 0) and now considering 782/782 (removed 0) transitions.
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:13] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:23:14] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:14] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-19 21:23:14] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:14] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 21:23:15] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 932/932 places, 782/782 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1376 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2 p0)), (F (NOT (AND (NOT p1) (NOT p2) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19317 reset in 1036 ms.
Product exploration explored 100000 steps with 19334 reset in 1131 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 782/782 transitions.
Applied a total of 0 rules in 23 ms. Remains 932 /932 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2022-05-19 21:23:19] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:19] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:23:19] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 932/932 places, 782/782 transitions.
Product exploration explored 100000 steps with 19373 reset in 2653 ms.
Product exploration explored 100000 steps with 19393 reset in 2735 ms.
Built C files in :
/tmp/ltsmin670063995375926781
[2022-05-19 21:23:24] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin670063995375926781
Running compilation step : cd /tmp/ltsmin670063995375926781;'/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 1488 ms.
Running link step : cd /tmp/ltsmin670063995375926781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin670063995375926781;'/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/stateBased7406514535299296154.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 782/782 transitions.
Applied a total of 0 rules in 22 ms. Remains 932 /932 variables (removed 0) and now considering 782/782 (removed 0) transitions.
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:40] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 21:23:40] [INFO ] Implicit Places using invariants in 426 ms returned []
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:40] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 21:23:41] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
// Phase 1: matrix 782 rows 932 cols
[2022-05-19 21:23:41] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 21:23:41] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 932/932 places, 782/782 transitions.
Built C files in :
/tmp/ltsmin13335403006175022493
[2022-05-19 21:23:41] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13335403006175022493
Running compilation step : cd /tmp/ltsmin13335403006175022493;'/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 1276 ms.
Running link step : cd /tmp/ltsmin13335403006175022493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13335403006175022493;'/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/stateBased15583415326817032814.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 21:23:56] [INFO ] Flatten gal took : 32 ms
[2022-05-19 21:23:56] [INFO ] Flatten gal took : 32 ms
[2022-05-19 21:23:56] [INFO ] Time to serialize gal into /tmp/LTL3322042977742146550.gal : 3 ms
[2022-05-19 21:23:56] [INFO ] Time to serialize properties into /tmp/LTL6082077111664491661.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3322042977742146550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6082077111664491661.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3322042...266
Read 1 LTL properties
Checking formula 0 : !(((X(F(X("((p915==0)||(p932==0))"))))||(!((X("(((p299==1)&&(p320==1))&&((p915==1)&&(p932==1)))"))U(!("((p352==1)&&(p364==1))"))))))
Formula 0 simplified : !(XFX"((p915==0)||(p932==0))" | !(X"(((p299==1)&&(p320==1))&&((p915==1)&&(p932==1)))" U !"((p352==1)&&(p364==1))"))
Detected timeout of ITS tools.
[2022-05-19 21:24:11] [INFO ] Flatten gal took : 33 ms
[2022-05-19 21:24:11] [INFO ] Applying decomposition
[2022-05-19 21:24:12] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11024006169583820542.txt' '-o' '/tmp/graph11024006169583820542.bin' '-w' '/tmp/graph11024006169583820542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11024006169583820542.bin' '-l' '-1' '-v' '-w' '/tmp/graph11024006169583820542.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:24:12] [INFO ] Decomposing Gal with order
[2022-05-19 21:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:24:12] [INFO ] Removed a total of 180 redundant transitions.
[2022-05-19 21:24:12] [INFO ] Flatten gal took : 51 ms
[2022-05-19 21:24:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 22 ms.
[2022-05-19 21:24:12] [INFO ] Time to serialize gal into /tmp/LTL17536341817681159382.gal : 8 ms
[2022-05-19 21:24:12] [INFO ] Time to serialize properties into /tmp/LTL3377555671038816853.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17536341817681159382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3377555671038816853.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1753634...246
Read 1 LTL properties
Checking formula 0 : !(((X(F(X("((i29.i2.u325.p915==0)||(i29.i4.u330.p932==0))"))))||(!((X("(((i9.i3.u107.p299==1)&&(i10.i0.u115.p320==1))&&((i29.i2.u325.p...248
Formula 0 simplified : !(XFX"((i29.i2.u325.p915==0)||(i29.i4.u330.p932==0))" | !(X"(((i9.i3.u107.p299==1)&&(i10.i0.u115.p320==1))&&((i29.i2.u325.p915==1)&&...233
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6450896161778090797
[2022-05-19 21:24:27] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6450896161778090797
Running compilation step : cd /tmp/ltsmin6450896161778090797;'/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 1334 ms.
Running link step : cd /tmp/ltsmin6450896161778090797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6450896161778090797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>(X((LTLAPp0==true))))||!(X((LTLAPp1==true)) U !(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-030A-LTLFireability-04 finished in 94000 ms.
[2022-05-19 21:24:42] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12631424367273832177
[2022-05-19 21:24:42] [INFO ] Computing symmetric may disable matrix : 783 transitions.
[2022-05-19 21:24:42] [INFO ] Applying decomposition
[2022-05-19 21:24:42] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:24:42] [INFO ] Computing symmetric may enable matrix : 783 transitions.
[2022-05-19 21:24:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:24:42] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12201026822156001598.txt' '-o' '/tmp/graph12201026822156001598.bin' '-w' '/tmp/graph12201026822156001598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12201026822156001598.bin' '-l' '-1' '-v' '-w' '/tmp/graph12201026822156001598.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:24:42] [INFO ] Decomposing Gal with order
[2022-05-19 21:24:42] [INFO ] Computing Do-Not-Accords matrix : 783 transitions.
[2022-05-19 21:24:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:24:42] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:24:42] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12631424367273832177
Running compilation step : cd /tmp/ltsmin12631424367273832177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-19 21:24:42] [INFO ] Removed a total of 180 redundant transitions.
[2022-05-19 21:24:42] [INFO ] Flatten gal took : 50 ms
[2022-05-19 21:24:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 23 ms.
[2022-05-19 21:24:42] [INFO ] Time to serialize gal into /tmp/LTLFireability14914076250837027707.gal : 7 ms
[2022-05-19 21:24:42] [INFO ] Time to serialize properties into /tmp/LTLFireability5269752497888326904.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14914076250837027707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5269752497888326904.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((X(F(X("((i29.i2.u325.p915==0)||(i29.i1.u330.p932==0))"))))||(!((X("(((i9.i0.u107.p299==1)&&(i10.i3.u114.p320==1))&&((i29.i2.u325.p...248
Formula 0 simplified : !(XFX"((i29.i2.u325.p915==0)||(i29.i1.u330.p932==0))" | !(X"(((i9.i0.u107.p299==1)&&(i10.i3.u114.p320==1))&&((i29.i2.u325.p915==1)&&...233
Compilation finished in 2007 ms.
Running link step : cd /tmp/ltsmin12631424367273832177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12631424367273832177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>(X((LTLAPp2==true))))||!(X((LTLAPp3==true)) U !(LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 21:46:43] [INFO ] Applying decomposition
[2022-05-19 21:46:43] [INFO ] Flatten gal took : 78 ms
[2022-05-19 21:46:43] [INFO ] Decomposing Gal with order
[2022-05-19 21:46:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:46:43] [INFO ] Removed a total of 270 redundant transitions.
[2022-05-19 21:46:43] [INFO ] Flatten gal took : 147 ms
[2022-05-19 21:46:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 360 labels/synchronizations in 66 ms.
[2022-05-19 21:46:44] [INFO ] Time to serialize gal into /tmp/LTLFireability12645877727800806842.gal : 6 ms
[2022-05-19 21:46:44] [INFO ] Time to serialize properties into /tmp/LTLFireability16274053212168438599.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12645877727800806842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16274053212168438599.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((X(F(X("((i236.u416.p915==0)||(u421.p932==0))"))))||(!((X("(((u138.p299==1)&&(i83.u483.p320==1))&&((i236.u416.p915==1)&&(u421.p932=...211
Formula 0 simplified : !(XFX"((i236.u416.p915==0)||(u421.p932==0))" | !(X"(((u138.p299==1)&&(i83.u483.p320==1))&&((i236.u416.p915==1)&&(u421.p932==1)))" U ...196
Detected timeout of ITS tools.
[2022-05-19 22:08:46] [INFO ] Flatten gal took : 319 ms
[2022-05-19 22:08:51] [INFO ] Input system was already deterministic with 783 transitions.
[2022-05-19 22:08:51] [INFO ] Transformed 933 places.
[2022-05-19 22:08:51] [INFO ] Transformed 783 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 22:08:51] [INFO ] Time to serialize gal into /tmp/LTLFireability8934316028183665748.gal : 18 ms
[2022-05-19 22:08:51] [INFO ] Time to serialize properties into /tmp/LTLFireability8076362520699726398.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8934316028183665748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8076362520699726398.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(F(X("((p915==0)||(p932==0))"))))||(!((X("(((p299==1)&&(p320==1))&&((p915==1)&&(p932==1)))"))U(!("((p352==1)&&(p364==1))"))))))
Formula 0 simplified : !(XFX"((p915==0)||(p932==0))" | !(X"(((p299==1)&&(p320==1))&&((p915==1)&&(p932==1)))" U !"((p352==1)&&(p364==1))"))

BK_TIME_CONFINEMENT_REACHED

--------------------
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-030A"
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-030A, 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-165286025300468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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