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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.0K Apr 29 19:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 19:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 19:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 19:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 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 ShieldIIPt-PT-050A-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-050A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652965213009

Running Version 202205111006
[2022-05-19 13:00:14] [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 13:00:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:00:14] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2022-05-19 13:00:14] [INFO ] Transformed 953 places.
[2022-05-19 13:00:14] [INFO ] Transformed 703 transitions.
[2022-05-19 13:00:14] [INFO ] Found NUPN structural information;
[2022-05-19 13:00:14] [INFO ] Parsed PT model containing 953 places and 703 transitions in 254 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 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-050A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 82 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:14] [INFO ] Computed 451 place invariants in 31 ms
[2022-05-19 13:00:15] [INFO ] Implicit Places using invariants in 715 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:15] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 13:00:16] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1712 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:16] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 13:00:16] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Support contains 50 out of 953 places after structural reductions.
[2022-05-19 13:00:17] [INFO ] Flatten gal took : 203 ms
[2022-05-19 13:00:17] [INFO ] Flatten gal took : 98 ms
[2022-05-19 13:00:17] [INFO ] Input system was already deterministic with 702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:18] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:00:19] [INFO ] [Real]Absence check using 451 positive place invariants in 62 ms returned sat
[2022-05-19 13:00:19] [INFO ] After 1415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-19 13:00:20] [INFO ] [Nat]Absence check using 451 positive place invariants in 72 ms returned sat
[2022-05-19 13:00:24] [INFO ] After 3687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-19 13:00:26] [INFO ] After 6126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 2088 ms.
[2022-05-19 13:00:29] [INFO ] After 9241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 4 properties in 3241 ms.
Support contains 37 out of 953 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
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 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Partial Free-agglomeration rule applied 92 times.
Drop transitions removed 92 transitions
Iterating global reduction 0 with 92 rules applied. Total rules applied 96 place count 951 transition count 700
Applied a total of 96 rules in 193 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/953 places, 700/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Finished probabilistic random walk after 35677 steps, run visited all 19 properties in 1451 ms. (steps per millisecond=24 )
Probabilistic random walk after 35677 steps, saw 34665 distinct states, run finished after 1455 ms. (steps per millisecond=24 ) properties seen :19
FORMULA ShieldIIPt-PT-050A-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(X(p0)))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 20 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:34] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:00:35] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:35] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 13:00:36] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:36] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:00:36] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 577 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-00 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 s89 0) (EQ s95 0) (EQ s97 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 3050 ms.
Product exploration explored 100000 steps with 50000 reset in 3006 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 237 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-050A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050A-LTLFireability-00 finished in 9010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!(p0 U G(p1)))&&X(G(p2)))))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 14 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:43] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 13:00:44] [INFO ] Implicit Places using invariants in 494 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:44] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:00:45] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:45] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:00:45] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s175 0) (EQ s188 0)), p1:(AND (EQ s175 1) (EQ s188 1)), p0:(EQ s856 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 643 ms.
Product exploration explored 100000 steps with 0 reset in 911 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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p2))), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 1527 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:00:49] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 13:00:49] [INFO ] [Real]Absence check using 451 positive place invariants in 64 ms returned sat
[2022-05-19 13:00:50] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-19 13:00:50] [INFO ] [Nat]Absence check using 451 positive place invariants in 62 ms returned sat
[2022-05-19 13:00:51] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-19 13:00:51] [INFO ] After 742ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-19 13:00:51] [INFO ] After 1077ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 143 ms.
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
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 952 transition count 701
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 951 transition count 700
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 103 place count 951 transition count 700
Applied a total of 103 rules in 82 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/953 places, 700/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Finished probabilistic random walk after 26065 steps, run visited all 2 properties in 456 ms. (steps per millisecond=57 )
Probabilistic random walk after 26065 steps, saw 25105 distinct states, run finished after 457 ms. (steps per millisecond=57 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p2))), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT p2)), (F (AND p2 p0))]
Knowledge based reduction with 10 factoid took 1654 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Support contains 2 out of 953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
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 952 transition count 701
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 951 transition count 700
Applied a total of 4 rules in 65 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2022-05-19 13:00:54] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:00:54] [INFO ] Implicit Places using invariants in 465 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 479 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
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 948 transition count 699
Applied a total of 2 rules in 41 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2022-05-19 13:00:54] [INFO ] Computed 449 place invariants in 2 ms
[2022-05-19 13:00:55] [INFO ] Implicit Places using invariants in 445 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 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 946 transition count 698
Applied a total of 2 rules in 40 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:00:55] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:00:55] [INFO ] Implicit Places using invariants in 498 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:00:55] [INFO ] Computed 448 place invariants in 5 ms
[2022-05-19 13:00:56] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Finished probabilistic random walk after 32539 steps, run visited all 1 properties in 291 ms. (steps per millisecond=111 )
Probabilistic random walk after 32539 steps, saw 31806 distinct states, run finished after 292 ms. (steps per millisecond=111 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 921 ms :[(NOT p2)]
Product exploration explored 100000 steps with 0 reset in 655 ms.
Product exploration explored 100000 steps with 0 reset in 866 ms.
Built C files in :
/tmp/ltsmin9389642543862740179
[2022-05-19 13:00:59] [INFO ] Computing symmetric may disable matrix : 698 transitions.
[2022-05-19 13:00:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:00:59] [INFO ] Computing symmetric may enable matrix : 698 transitions.
[2022-05-19 13:00:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:00:59] [INFO ] Computing Do-Not-Accords matrix : 698 transitions.
[2022-05-19 13:00:59] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:00:59] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9389642543862740179
Running compilation step : cd /tmp/ltsmin9389642543862740179;'/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 1815 ms.
Running link step : cd /tmp/ltsmin9389642543862740179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9389642543862740179;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15221969792315906269.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 34 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:01:15] [INFO ] Computed 448 place invariants in 14 ms
[2022-05-19 13:01:15] [INFO ] Implicit Places using invariants in 531 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:01:15] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:01:16] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
[2022-05-19 13:01:16] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:01:16] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:01:16] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 698/698 transitions.
Built C files in :
/tmp/ltsmin12679410959764030115
[2022-05-19 13:01:16] [INFO ] Computing symmetric may disable matrix : 698 transitions.
[2022-05-19 13:01:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:01:17] [INFO ] Computing symmetric may enable matrix : 698 transitions.
[2022-05-19 13:01:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:01:17] [INFO ] Computing Do-Not-Accords matrix : 698 transitions.
[2022-05-19 13:01:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:01:17] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12679410959764030115
Running compilation step : cd /tmp/ltsmin12679410959764030115;'/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 2110 ms.
Running link step : cd /tmp/ltsmin12679410959764030115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12679410959764030115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1731759741696164690.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 13:01:32] [INFO ] Flatten gal took : 55 ms
[2022-05-19 13:01:32] [INFO ] Flatten gal took : 52 ms
[2022-05-19 13:01:32] [INFO ] Time to serialize gal into /tmp/LTL10821516745286930759.gal : 6 ms
[2022-05-19 13:01:32] [INFO ] Time to serialize properties into /tmp/LTL14954120395595988055.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/LTL10821516745286930759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14954120395595988055.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/LTL1082151...268
Read 1 LTL properties
Checking formula 0 : !((F((X(!(("(p856==1)")U(G("((p175==1)&&(p188==1))")))))&&(X(G("((p175==0)||(p188==0))"))))))
Formula 0 simplified : !F(X!("(p856==1)" U G"((p175==1)&&(p188==1))") & XG"((p175==0)||(p188==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-19 13:01:47] [INFO ] Flatten gal took : 49 ms
[2022-05-19 13:01:47] [INFO ] Applying decomposition
[2022-05-19 13:01:47] [INFO ] Flatten gal took : 45 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/graph2649808623946369874.txt' '-o' '/tmp/graph2649808623946369874.bin' '-w' '/tmp/graph2649808623946369874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2649808623946369874.bin' '-l' '-1' '-v' '-w' '/tmp/graph2649808623946369874.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:01:47] [INFO ] Decomposing Gal with order
[2022-05-19 13:01:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:01:47] [INFO ] Removed a total of 149 redundant transitions.
[2022-05-19 13:01:47] [INFO ] Flatten gal took : 100 ms
[2022-05-19 13:01:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2022-05-19 13:01:47] [INFO ] Time to serialize gal into /tmp/LTL12410728596346835775.gal : 16 ms
[2022-05-19 13:01:47] [INFO ] Time to serialize properties into /tmp/LTL6628624974159281112.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/LTL12410728596346835775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6628624974159281112.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/LTL1241072...246
Read 1 LTL properties
Checking formula 0 : !((F((X(!(("(i23.i1.i2.u360.p856==1)")U(G("((i4.i1.i1.u73.p175==1)&&(i4.i1.i1.u78.p188==1))")))))&&(X(G("((i4.i1.i1.u73.p175==0)||(i4....181
Formula 0 simplified : !F(X!("(i23.i1.i2.u360.p856==1)" U G"((i4.i1.i1.u73.p175==1)&&(i4.i1.i1.u78.p188==1))") & XG"((i4.i1.i1.u73.p175==0)||(i4.i1.i1.u78....166
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
494 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.06342,175848,1,0,303938,767,4327,853184,120,5595,187929
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-050A-LTLFireability-01 finished in 70059 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(p1)))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:01:53] [INFO ] Computed 451 place invariants in 1 ms
[2022-05-19 13:01:54] [INFO ] Implicit Places using invariants in 528 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:01:54] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:01:55] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:01:55] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 13:01:56] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 2}]], initial=4, aps=[p0:(AND (EQ s12 1) (EQ s37 1)), p1:(NEQ s263 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 640 ms.
Product exploration explored 100000 steps with 0 reset in 918 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) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 224 ms. Reduced automaton from 7 states, 14 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished probabilistic random walk after 28429 steps, run visited all 1 properties in 254 ms. (steps per millisecond=111 )
Probabilistic random walk after 28429 steps, saw 27779 distinct states, run finished after 255 ms. (steps per millisecond=111 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 18 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:01:59] [INFO ] Computed 451 place invariants in 1 ms
[2022-05-19 13:01:59] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:01:59] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 13:02:00] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:02:00] [INFO ] Computed 451 place invariants in 4 ms
[2022-05-19 13:02:00] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 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 : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished probabilistic random walk after 28429 steps, run visited all 1 properties in 253 ms. (steps per millisecond=112 )
Probabilistic random walk after 28429 steps, saw 27779 distinct states, run finished after 255 ms. (steps per millisecond=111 ) properties seen :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 651 ms.
Product exploration explored 100000 steps with 0 reset in 866 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 702
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 702
Performed 1 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 1 rules applied. Total rules applied 2 place count 953 transition count 702
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 108 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2022-05-19 13:02:04] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:02:04] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:02:04] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 953/953 places, 702/702 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Product exploration explored 100000 steps with 0 reset in 648 ms.
Product exploration explored 100000 steps with 0 reset in 887 ms.
Built C files in :
/tmp/ltsmin13906050375303267061
[2022-05-19 13:02:06] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13906050375303267061
Running compilation step : cd /tmp/ltsmin13906050375303267061;'/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 1200 ms.
Running link step : cd /tmp/ltsmin13906050375303267061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13906050375303267061;'/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/stateBased9036045189895496172.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 24 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:02:21] [INFO ] Computed 451 place invariants in 5 ms
[2022-05-19 13:02:21] [INFO ] Implicit Places using invariants in 478 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:02:21] [INFO ] Computed 451 place invariants in 1 ms
[2022-05-19 13:02:22] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:02:22] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 13:02:23] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Built C files in :
/tmp/ltsmin7902155433110295041
[2022-05-19 13:02:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7902155433110295041
Running compilation step : cd /tmp/ltsmin7902155433110295041;'/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 1196 ms.
Running link step : cd /tmp/ltsmin7902155433110295041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7902155433110295041;'/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/stateBased14598686918330244311.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 13:02:38] [INFO ] Flatten gal took : 45 ms
[2022-05-19 13:02:38] [INFO ] Flatten gal took : 42 ms
[2022-05-19 13:02:38] [INFO ] Time to serialize gal into /tmp/LTL10562448394523702419.gal : 5 ms
[2022-05-19 13:02:38] [INFO ] Time to serialize properties into /tmp/LTL2170044682021468228.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/LTL10562448394523702419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2170044682021468228.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/LTL1056244...267
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("((p12==1)&&(p37==1))"))))||(G("(p263==0)"))))
Formula 0 simplified : !(XXG"((p12==1)&&(p37==1))" | G"(p263==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-19 13:02:53] [INFO ] Flatten gal took : 39 ms
[2022-05-19 13:02:53] [INFO ] Applying decomposition
[2022-05-19 13:02:53] [INFO ] Flatten gal took : 39 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/graph6782397402448487123.txt' '-o' '/tmp/graph6782397402448487123.bin' '-w' '/tmp/graph6782397402448487123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6782397402448487123.bin' '-l' '-1' '-v' '-w' '/tmp/graph6782397402448487123.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:02:53] [INFO ] Decomposing Gal with order
[2022-05-19 13:02:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:02:53] [INFO ] Removed a total of 150 redundant transitions.
[2022-05-19 13:02:53] [INFO ] Flatten gal took : 61 ms
[2022-05-19 13:02:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 37 ms.
[2022-05-19 13:02:53] [INFO ] Time to serialize gal into /tmp/LTL14331000369045035652.gal : 25 ms
[2022-05-19 13:02:53] [INFO ] Time to serialize properties into /tmp/LTL17905609130203365941.ltl : 102 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/LTL14331000369045035652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17905609130203365941.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/LTL1433100...247
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("((i0.i1.i1.u4.p12==1)&&(i0.i1.i1.u15.p37==1))"))))||(G("(i7.i0.i2.u110.p263==0)"))))
Formula 0 simplified : !(XXG"((i0.i1.i1.u4.p12==1)&&(i0.i1.i1.u15.p37==1))" | G"(i7.i0.i2.u110.p263==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1218 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.2861,425072,1,0,463966,522,4318,3.4376e+06,122,2868,174856
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-03 finished in 74957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!G(p0)) U (G(p1)||p2)))'
Support contains 5 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
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 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 47 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2022-05-19 13:03:08] [INFO ] Computed 451 place invariants in 1 ms
[2022-05-19 13:03:09] [INFO ] Implicit Places using invariants in 458 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 459 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 24 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2022-05-19 13:03:09] [INFO ] Computed 449 place invariants in 3 ms
[2022-05-19 13:03:09] [INFO ] Implicit Places using invariants in 477 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 478 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 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 946 transition count 698
Applied a total of 2 rules in 30 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:09] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:03:10] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:10] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:03:11] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s191 1), p1:(AND (EQ s763 1) (EQ s780 1)), p0:(AND (EQ s191 1) (NOT (AND (EQ s753 1) (EQ s778 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 646 ms.
Product exploration explored 100000 steps with 0 reset in 854 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 529 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), p0, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:14] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:03:14] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-19 13:03:14] [INFO ] [Nat]Absence check using 448 positive place invariants in 65 ms returned sat
[2022-05-19 13:03:14] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-19 13:03:15] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 124 ms.
[2022-05-19 13:03:15] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 5 out of 946 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 946 transition count 698
Applied a total of 99 rules in 37 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Finished probabilistic random walk after 25973 steps, run visited all 2 properties in 373 ms. (steps per millisecond=69 )
Probabilistic random walk after 25973 steps, saw 25034 distinct states, run finished after 374 ms. (steps per millisecond=69 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F p1), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 15 factoid took 769 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), p0, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), p0, p0, (AND p0 (NOT p1))]
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:17] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-19 13:03:17] [INFO ] [Real]Absence check using 448 positive place invariants in 71 ms returned unsat
Proved EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F p1), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (G (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p2)))
Knowledge based reduction with 15 factoid took 800 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldIIPt-PT-050A-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050A-LTLFireability-04 finished in 9427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(F(!(p2 U G(p1)))))))'
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 25 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:18] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:03:18] [INFO ] Implicit Places using invariants in 472 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:18] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:03:19] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:19] [INFO ] Computed 451 place invariants in 1 ms
[2022-05-19 13:03:20] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 479 ms :[false, false, p1, false, p1]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s424 1) (EQ s433 1)), p0:(EQ s681 1), p2:(AND (EQ s450 1) (EQ s456 1) (EQ s458 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]]
Product exploration explored 100000 steps with 33333 reset in 2168 ms.
Product exploration explored 100000 steps with 33333 reset in 2291 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 p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 7 factoid took 219 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-050A-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050A-LTLFireability-06 finished in 7055 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
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 952 transition count 701
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 951 transition count 700
Applied a total of 4 rules in 42 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2022-05-19 13:03:25] [INFO ] Computed 451 place invariants in 4 ms
[2022-05-19 13:03:25] [INFO ] Implicit Places using invariants in 490 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 491 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 29 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2022-05-19 13:03:25] [INFO ] Computed 449 place invariants in 3 ms
[2022-05-19 13:03:26] [INFO ] Implicit Places using invariants in 503 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 504 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 34 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:26] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:03:26] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:26] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:03:27] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s335 1) (EQ s360 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 641 ms.
Stack based approach found an accepted trace after 119 steps with 0 reset with depth 120 and stack size 120 in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-08 finished in 3213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((!(G(p2)&&p1)&&!p3))))'
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 16 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:28] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:03:29] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:29] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:03:29] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:30] [INFO ] Computed 451 place invariants in 5 ms
[2022-05-19 13:03:30] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR p3 (AND p1 p2)), (NOT p0), (OR (AND (NOT p0) p1 p2) (AND (NOT p0) p3)), (AND p2 (NOT p0)), (OR (AND p2 p3) (AND p1 p2)), true, p2, (OR (AND p0 p1 p2) (AND p0 p3)), (OR (AND (NOT p0) p2 p3) (AND (NOT p0) p1 p2)), (OR (AND p0 p2 p3) (AND p0 p1 p2))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p1 p2 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND p3 p2) (AND p1 p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(OR (AND p3 p2) (AND p1 p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={0} source=6 dest: 6}], [{ cond=(AND p3 p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p1 p2 p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={} source=7 dest: 7}], [{ cond=(OR (AND p3 p2 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) (NOT p1) p2 (NOT p0)), acceptance={} source=8 dest: 9}], [{ cond=(OR (AND p3 p2 p0) (AND p1 p2 p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p1) p2 p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(AND (EQ s577 1) (EQ s579 1)), p1:(AND (EQ s632 1) (EQ s643 1)), p2:(AND (EQ s736 1) (EQ s751 1)), p0:(AND (EQ s632 1) (EQ s643 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25107 reset in 1863 ms.
Product exploration explored 100000 steps with 25084 reset in 1971 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 p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p3 (NOT p0)))), (X (NOT p0)), (X (NOT (OR (AND p3 p2) (AND p1 p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT p3)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p1 p2))), (X (NOT (AND (NOT p3) p1 p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p3 p2) (AND p1 p2))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p3) p1 p2 (NOT p0))))), (X (X (NOT (OR (AND p3 p2 (NOT p0)) (AND p1 p2 (NOT p0)))))), true, (X (X (NOT (AND (NOT p3) (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) p1 p2 p0)))), (X (X (NOT (AND (NOT p3) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 1403 ms. Reduced automaton from 10 states, 24 edges and 4 AP to 8 states, 22 edges and 4 AP.
Stuttering acceptance computed with spot in 333 ms :[(OR p3 (AND p1 p2)), (AND (NOT p3) (NOT p0)), (AND p2 (NOT p3) (NOT p0) (NOT p1)), (OR (AND p1 p2) (AND p2 p3)), true, p2, (OR (AND p0 p1 p2) (AND p0 p3)), (OR (AND p0 p2 p3) (AND p0 p1 p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 120811 steps, run timeout after 3002 ms. (steps per millisecond=40 ) properties seen :{0=1, 1=1, 3=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Probabilistic random walk after 120811 steps, saw 119436 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :10
Running SMT prover for 3 properties.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:40] [INFO ] Computed 451 place invariants in 1 ms
[2022-05-19 13:03:40] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-19 13:03:41] [INFO ] [Nat]Absence check using 451 positive place invariants in 63 ms returned sat
[2022-05-19 13:03:41] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-19 13:03:41] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-19 13:03:41] [INFO ] After 913ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
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 952 transition count 701
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 951 transition count 700
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 101 place count 951 transition count 700
Applied a total of 101 rules in 59 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/953 places, 700/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 290302 steps, run timeout after 3002 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290302 steps, saw 279069 distinct states, run finished after 3003 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 700 rows 951 cols
[2022-05-19 13:03:45] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:03:45] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:03:45] [INFO ] [Nat]Absence check using 451 positive place invariants in 68 ms returned sat
[2022-05-19 13:03:45] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:03:45] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-19 13:03:46] [INFO ] After 209ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:03:46] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-19 13:03:46] [INFO ] After 958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 951 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 20 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 700/700 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 20 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
// Phase 1: matrix 700 rows 951 cols
[2022-05-19 13:03:46] [INFO ] Computed 451 place invariants in 4 ms
[2022-05-19 13:03:46] [INFO ] Implicit Places using invariants in 504 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 506 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 949/951 places, 700/700 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
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 948 transition count 699
Applied a total of 2 rules in 24 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2022-05-19 13:03:46] [INFO ] Computed 449 place invariants in 3 ms
[2022-05-19 13:03:47] [INFO ] Implicit Places using invariants in 506 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 507 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 947/951 places, 699/700 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 946 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 63 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:47] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:03:47] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:47] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:03:48] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-19 13:03:49] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 1959 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 946/951 places, 698/700 transitions.
Finished structural reductions, in 3 iterations. Remains : 946/951 places, 698/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 306023 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 306023 steps, saw 294126 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:52] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-19 13:03:52] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:03:52] [INFO ] [Nat]Absence check using 448 positive place invariants in 61 ms returned sat
[2022-05-19 13:03:53] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:03:53] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-19 13:03:53] [INFO ] After 186ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:03:53] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-19 13:03:53] [INFO ] After 1140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 458 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 5 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p3 (NOT p0)))), (X (NOT p0)), (X (NOT (OR (AND p3 p2) (AND p1 p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT p3)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p1 p2))), (X (NOT (AND (NOT p3) p1 p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p3 p2) (AND p1 p2))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p3) p1 p2 (NOT p0))))), (X (X (NOT (OR (AND p3 p2 (NOT p0)) (AND p1 p2 (NOT p0)))))), true, (X (X (NOT (AND (NOT p3) (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) p1 p2 p0)))), (X (X (NOT (AND (NOT p3) p0)))), (G (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (OR (AND p1 p2 p0) (AND p2 p0 p3))), (F (OR (AND p1 p2 (NOT p0)) (AND p2 (NOT p0) p3))), (F (AND (NOT p0) p3)), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p3), (F (AND p1 p2 p0 (NOT p3))), (F (AND p0 p3)), (F (AND p0 (NOT p3))), (F p2)]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p3))
Knowledge based reduction with 28 factoid took 622 ms. Reduced automaton from 8 states, 22 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldIIPt-PT-050A-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050A-LTLFireability-11 finished in 25790 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
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 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 105 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2022-05-19 13:03:54] [INFO ] Computed 451 place invariants in 4 ms
[2022-05-19 13:03:54] [INFO ] Implicit Places using invariants in 464 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 465 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
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 948 transition count 699
Applied a total of 2 rules in 31 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2022-05-19 13:03:54] [INFO ] Computed 449 place invariants in 3 ms
[2022-05-19 13:03:55] [INFO ] Implicit Places using invariants in 455 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 456 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 40 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:55] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:03:55] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2022-05-19 13:03:55] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:03:56] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s15 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 663 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-12 finished in 3212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((!G(p1)&&F(p2)&&p0)) U !X(p3)))'
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 19 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:57] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 13:03:58] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:58] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 13:03:59] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:03:59] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 13:03:59] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 324 ms :[p3, (OR (AND (NOT p0) p3) (AND (NOT p2) p3) (AND p1 p3)), p3, (AND (NOT p2) p3), (AND p1 p3), (OR (NOT p2) (NOT p0) p1), (NOT p2), p1]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=1 dest: 6}, { cond=(AND p0 p1 p3), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 p3), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s442 1) (EQ s453 1)), p2:(AND (EQ s937 1) (EQ s946 1)), p1:(EQ s362 1), p3:(EQ s455 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, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2993 ms.
Product exploration explored 100000 steps with 50000 reset in 3087 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) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p1 p3))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p3))
Knowledge based reduction with 18 factoid took 375 ms. Reduced automaton from 8 states, 18 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-050A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050A-LTLFireability-14 finished in 8743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((p0 U p1)||((p2 U p3)&&X(F(p2)))))))'
Support contains 7 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 17 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:04:06] [INFO ] Computed 451 place invariants in 4 ms
[2022-05-19 13:04:06] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:04:06] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 13:04:07] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2022-05-19 13:04:07] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:04:08] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s597 1) (EQ s608 1)), p3:(AND (EQ s196 1) (EQ s205 1) (EQ s936 1) (EQ s947 1)), p2:(EQ s742 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15 reset in 736 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-15 finished in 2794 ms.
All properties solved by simple procedures.
Total runtime 234929 ms.

BK_STOP 1652965449198

--------------------
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="ShieldIIPt-PT-050A"
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 ShieldIIPt-PT-050A, 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-165286025000324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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