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-165286024600019.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 ShieldIIPs-PT-002A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024600019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.0K Apr 29 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 15:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 18K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-002A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652908285754

Running Version 202205111006
[2022-05-18 21:11:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-18 21:11:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 21:11:27] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2022-05-18 21:11:27] [INFO ] Transformed 53 places.
[2022-05-18 21:11:27] [INFO ] Transformed 51 transitions.
[2022-05-18 21:11:27] [INFO ] Found NUPN structural information;
[2022-05-18 21:11:27] [INFO ] Parsed PT model containing 53 places and 51 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-002A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 16 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:27] [INFO ] Computed 19 place invariants in 10 ms
[2022-05-18 21:11:27] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:27] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-18 21:11:27] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:27] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:27] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Support contains 22 out of 53 places after structural reductions.
[2022-05-18 21:11:27] [INFO ] Flatten gal took : 27 ms
[2022-05-18 21:11:27] [INFO ] Flatten gal took : 10 ms
[2022-05-18 21:11:27] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:27] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-18 21:11:27] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldIIPs-PT-002A-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-002A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G(X(X(p0)))))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Reduce places removed 1 places and 1 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 52 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 50 transition count 49
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 5 place count 49 transition count 48
Applied a total of 5 rules in 14 ms. Remains 49 /53 variables (removed 4) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 49 cols
[2022-05-18 21:11:28] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 21:11:28] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 48 rows 49 cols
[2022-05-18 21:11:28] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-18 21:11:28] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-05-18 21:11:28] [INFO ] Redundant transitions in 21 ms returned [42]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 47 rows 49 cols
[2022-05-18 21:11:28] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 21:11:28] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/53 places, 47/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 49/53 places, 47/51 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s1 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 765 reset in 277 ms.
Stack based approach found an accepted trace after 16088 steps with 125 reset with depth 64 and stack size 64 in 29 ms.
FORMULA ShieldIIPs-PT-002A-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPs-PT-002A-LTLCardinality-01 finished in 729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(X(X((X(p1)&&F(p2)))))&&p3)))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:28] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:28] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:28] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:29] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-18 21:11:29] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 927 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1) p3)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p3), acceptance={0} source=3 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=p3, acceptance={0} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p3), acceptance={} source=5 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=p3, acceptance={} source=5 dest: 7}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(NOT p3), acceptance={0} source=5 dest: 10}, { cond=(NOT p2), acceptance={} source=5 dest: 11}, { cond=p3, acceptance={0} source=5 dest: 12}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(NOT p3), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}, { cond=(NOT p2), acceptance={} source=7 dest: 11}, { cond=(NOT p3), acceptance={0} source=7 dest: 13}, { cond=p3, acceptance={0} source=7 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=10 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={0} source=10 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=12 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=12 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={0} source=12 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=13 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=13 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=13 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=13 dest: 10}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=13 dest: 11}, { cond=(AND p3 (NOT p1)), acceptance={0} source=13 dest: 12}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=14 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=14 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=14 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=14 dest: 13}, { cond=(AND p3 (NOT p1)), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p3:(OR (EQ s38 0) (EQ s10 1)), p0:(OR (EQ s10 0) (EQ s42 1)), p2:(OR (EQ s25 0) (EQ s14 1)), p1:(OR (EQ s22 0) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20005 reset in 264 ms.
Product exploration explored 100000 steps with 19999 reset in 221 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 p3 p0 p2 p1), (X p3), (X p0), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p3)), (X (X p0)), (X (X p2)), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 1798 ms. Reduced automaton from 15 states, 56 edges and 4 AP to 15 states, 56 edges and 4 AP.
Stuttering acceptance computed with spot in 796 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1) p3)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:33] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:33] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 p2 p1), (X p3), (X p0), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p3)), (X (X p0)), (X (X p2)), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p0) p3)), (F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p2)), (F (NOT p3)), (F (AND (NOT p0) p3)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p1) p3))]
Knowledge based reduction with 13 factoid took 2173 ms. Reduced automaton from 15 states, 56 edges and 4 AP to 15 states, 44 edges and 4 AP.
Stuttering acceptance computed with spot in 725 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 645 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:37] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:37] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:37] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:37] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:37] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:11:37] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 p0 p2 p1), (X p3), (X p0), (X (X p3)), (X (X p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 1520 ms. Reduced automaton from 15 states, 44 edges and 4 AP to 15 states, 44 edges and 4 AP.
Stuttering acceptance computed with spot in 712 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 7725 steps, including 54 resets, run visited all 8 properties in 33 ms. (steps per millisecond=234 )
Knowledge obtained : [(AND p3 p0 p2 p1), (X p3), (X p0), (X (X p3)), (X (X p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (AND p3 (NOT p1))), (F (AND (NOT p3) (NOT p1))), (F (NOT p3)), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 1844 ms. Reduced automaton from 15 states, 44 edges and 4 AP to 15 states, 44 edges and 4 AP.
Stuttering acceptance computed with spot in 704 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 702 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 625 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 19936 reset in 139 ms.
Product exploration explored 100000 steps with 20002 reset in 145 ms.
Applying partial POR strategy [false, true, false, false, false, false, false, false, true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 719 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2022-05-18 21:11:45] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:45] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:11:45] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Product exploration explored 100000 steps with 20053 reset in 173 ms.
Product exploration explored 100000 steps with 20027 reset in 182 ms.
Built C files in :
/tmp/ltsmin14337144596105051847
[2022-05-18 21:11:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14337144596105051847
Running compilation step : cd /tmp/ltsmin14337144596105051847;'/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 255 ms.
Running link step : cd /tmp/ltsmin14337144596105051847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14337144596105051847;'/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/stateBased9920636752451224047.hoa' '--buchi-type=spotba'
LTSmin run took 290 ms.
FORMULA ShieldIIPs-PT-002A-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-002A-LTLCardinality-02 finished in 17258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(G(X(p0)))))))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Reduce places removed 1 places and 1 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 52 transition count 49
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 50 transition count 49
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 5 place count 49 transition count 48
Applied a total of 5 rules in 5 ms. Remains 49 /53 variables (removed 4) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 49 cols
[2022-05-18 21:11:46] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 21:11:46] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 48 rows 49 cols
[2022-05-18 21:11:46] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 21:11:46] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2022-05-18 21:11:46] [INFO ] Redundant transitions in 23 ms returned [42]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 47 rows 49 cols
[2022-05-18 21:11:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 21:11:46] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/53 places, 47/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 49/53 places, 47/51 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s46 0) (EQ s30 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 771 reset in 139 ms.
Stack based approach found an accepted trace after 9236 steps with 69 reset with depth 135 and stack size 135 in 17 ms.
FORMULA ShieldIIPs-PT-002A-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPs-PT-002A-LTLCardinality-03 finished in 463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 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 53 transition count 50
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 52 transition count 50
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 51 transition count 49
Applied a total of 4 rules in 6 ms. Remains 51 /53 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 51 cols
[2022-05-18 21:11:46] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:11:46] [INFO ] Implicit Places using invariants in 66 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/53 places, 49/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 50/53 places, 49/51 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (NOT (OR (EQ s6 0) (EQ s10 1))) (NEQ s12 1)), p0:(NEQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-LTLCardinality-06 finished in 148 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||G((G(p1)&&p2))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:46] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:46] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:46] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:47] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:47] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-18 21:11:47] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s40 0) (EQ s49 0) (EQ s16 1)), p1:(OR (EQ s16 0) (EQ s49 1) (EQ s27 0) (EQ s46 1)), p2:(OR (EQ s27 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 243 steps with 1 reset in 4 ms.
FORMULA ShieldIIPs-PT-002A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-LTLCardinality-07 finished in 664 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:47] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:11:47] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:47] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-18 21:11:47] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:47] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:47] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 138 ms.
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/53 stabilizing places and 1/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:48] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:48] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2022-05-18 21:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 21:11:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 21:11:48] [INFO ] Computed and/alt/rep : 48/175/48 causal constraints (skipped 2 transitions) in 4 ms.
[2022-05-18 21:11:48] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:48] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:11:48] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:48] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:48] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:48] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:11:49] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/53 stabilizing places and 1/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 51 rows 53 cols
[2022-05-18 21:11:49] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-18 21:11:49] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2022-05-18 21:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 21:11:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-18 21:11:49] [INFO ] Computed and/alt/rep : 48/175/48 causal constraints (skipped 2 transitions) in 3 ms.
[2022-05-18 21:11:49] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 97 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 51
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2022-05-18 21:11:50] [INFO ] Redundant transitions in 19 ms returned [43]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 50 rows 53 cols
[2022-05-18 21:11:50] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:11:50] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 50/51 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 53/53 places, 50/51 transitions.
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Product exploration explored 100000 steps with 25000 reset in 215 ms.
Built C files in :
/tmp/ltsmin14864251013918597477
[2022-05-18 21:11:50] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14864251013918597477
Running compilation step : cd /tmp/ltsmin14864251013918597477;'/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 135 ms.
Running link step : cd /tmp/ltsmin14864251013918597477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14864251013918597477;'/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/stateBased9725412859985453201.hoa' '--buchi-type=spotba'
LTSmin run took 164 ms.
FORMULA ShieldIIPs-PT-002A-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-002A-LTLCardinality-15 finished in 3915 ms.
All properties solved by simple procedures.
Total runtime 24389 ms.

BK_STOP 1652908311416

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ShieldIIPs-PT-002A"
export BK_EXAMINATION="LTLCardinality"
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 ShieldIIPs-PT-002A, examination is LTLCardinality"
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-165286024600019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-002A.tgz
mv ShieldIIPs-PT-002A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;