Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788800228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788800228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 11:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 11:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 11:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716959519398

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-001B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 05:12:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 05:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:12:01] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-29 05:12:01] [INFO ] Transformed 71 places.
[2024-05-29 05:12:01] [INFO ] Transformed 66 transitions.
[2024-05-29 05:12:01] [INFO ] Found NUPN structural information;
[2024-05-29 05:12:01] [INFO ] Parsed PT model containing 71 places and 66 transitions and 180 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-001B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 65
Applied a total of 2 rules in 14 ms. Remains 70 /71 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 70 cols
[2024-05-29 05:12:01] [INFO ] Computed 12 invariants in 12 ms
[2024-05-29 05:12:01] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-29 05:12:01] [INFO ] Invariant cache hit.
[2024-05-29 05:12:01] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-29 05:12:01] [INFO ] Invariant cache hit.
[2024-05-29 05:12:02] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/71 places, 65/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 70/71 places, 65/66 transitions.
Support contains 38 out of 70 places after structural reductions.
[2024-05-29 05:12:02] [INFO ] Flatten gal took : 23 ms
[2024-05-29 05:12:02] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:12:02] [INFO ] Input system was already deterministic with 65 transitions.
Support contains 37 out of 70 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 31) seen :30
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:12:02] [INFO ] Invariant cache hit.
[2024-05-29 05:12:02] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2024-05-29 05:12:02] [INFO ] After 74ms 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 ShieldPPPs-PT-001B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldPPPs-PT-001B-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 15 stabilizing places and 15 stable transitions
FORMULA ShieldPPPs-PT-001B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1||F(p2)||G(!p0)))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 58
Applied a total of 14 rules in 5 ms. Remains 63 /70 variables (removed 7) and now considering 58/65 (removed 7) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-05-29 05:12:03] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 05:12:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 05:12:03] [INFO ] Invariant cache hit.
[2024-05-29 05:12:03] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-29 05:12:03] [INFO ] Invariant cache hit.
[2024-05-29 05:12:03] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/70 places, 58/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 63/70 places, 58/65 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s10 1), p1:(EQ s10 0), p2:(NEQ s16 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 12521 reset in 217 ms.
Product exploration explored 100000 steps with 12339 reset in 145 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/63 stabilizing places and 11/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 254 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 308 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-29 05:12:04] [INFO ] Invariant cache hit.
[2024-05-29 05:12:04] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-29 05:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-29 05:12:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:12:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:04] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-29 05:12:04] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 3 ms to minimize.
[2024-05-29 05:12:04] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:12:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:12:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 125 ms
[2024-05-29 05:12:05] [INFO ] Computed and/alt/rep : 57/101/57 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-29 05:12:05] [INFO ] Added : 50 causal constraints over 10 iterations in 80 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 63 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 : 63/63 places, 58/58 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 49
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 54 transition count 49
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 54 transition count 44
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 49 transition count 44
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 54 place count 35 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 34 transition count 29
Applied a total of 55 rules in 27 ms. Remains 34 /63 variables (removed 29) and now considering 29/58 (removed 29) transitions.
// Phase 1: matrix 29 rows 34 cols
[2024-05-29 05:12:05] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 05:12:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 05:12:05] [INFO ] Invariant cache hit.
[2024-05-29 05:12:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-29 05:12:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 05:12:05] [INFO ] Invariant cache hit.
[2024-05-29 05:12:05] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/63 places, 29/58 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 34/63 places, 29/58 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/34 stabilizing places and 2/29 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLFireability-00 finished in 2238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 59
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 59
Applied a total of 12 rules in 6 ms. Remains 64 /70 variables (removed 6) and now considering 59/65 (removed 6) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 05:12:05] [INFO ] Computed 12 invariants in 6 ms
[2024-05-29 05:12:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 05:12:05] [INFO ] Invariant cache hit.
[2024-05-29 05:12:05] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-29 05:12:05] [INFO ] Invariant cache hit.
[2024-05-29 05:12:05] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/70 places, 59/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 64/70 places, 59/65 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 14830 reset in 98 ms.
Product exploration explored 100000 steps with 14963 reset in 88 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Detected a total of 12/64 stabilizing places and 12/59 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
[2024-05-29 05:12:06] [INFO ] Invariant cache hit.
[2024-05-29 05:12:06] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-29 05:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:06] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-29 05:12:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:12:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-29 05:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:06] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-29 05:12:06] [INFO ] Computed and/alt/rep : 58/102/58 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 05:12:06] [INFO ] Added : 56 causal constraints over 12 iterations in 82 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 59/59 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 50
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 55 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 55 transition count 45
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 50 transition count 45
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 33 transition count 28
Applied a total of 59 rules in 24 ms. Remains 33 /64 variables (removed 31) and now considering 28/59 (removed 31) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-29 05:12:06] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 05:12:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 05:12:06] [INFO ] Invariant cache hit.
[2024-05-29 05:12:06] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-29 05:12:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 05:12:06] [INFO ] Invariant cache hit.
[2024-05-29 05:12:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/64 places, 28/59 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 33/64 places, 28/59 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/33 stabilizing places and 2/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 250 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-29 05:12:07] [INFO ] Invariant cache hit.
[2024-05-29 05:12:07] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:07] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-29 05:12:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:12:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:07] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-29 05:12:07] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:12:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-29 05:12:07] [INFO ] Computed and/alt/rep : 26/48/26 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 05:12:07] [INFO ] Added : 25 causal constraints over 5 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33567 reset in 86 ms.
Product exploration explored 100000 steps with 33389 reset in 89 ms.
Built C files in :
/tmp/ltsmin5259157631374198532
[2024-05-29 05:12:07] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2024-05-29 05:12:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:12:07] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2024-05-29 05:12:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:12:07] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2024-05-29 05:12:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:12:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5259157631374198532
Running compilation step : cd /tmp/ltsmin5259157631374198532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 314 ms.
Running link step : cd /tmp/ltsmin5259157631374198532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5259157631374198532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9001395015561698717.hoa' '--buchi-type=spotba'
LTSmin run took 78 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLFireability-01 finished in 2841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 69 transition count 57
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 62 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 16 place count 61 transition count 51
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 56 transition count 51
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 33 place count 49 transition count 44
Iterating global reduction 3 with 7 rules applied. Total rules applied 40 place count 49 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 40 place count 49 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 46 transition count 41
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 70 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 33 transition count 28
Applied a total of 71 rules in 16 ms. Remains 33 /70 variables (removed 37) and now considering 28/65 (removed 37) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-29 05:12:08] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 05:12:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 05:12:08] [INFO ] Invariant cache hit.
[2024-05-29 05:12:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-29 05:12:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 05:12:08] [INFO ] Invariant cache hit.
[2024-05-29 05:12:08] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/70 places, 28/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 33/70 places, 28/65 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s3 1), p1:(AND (EQ s8 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 530 steps with 29 reset in 3 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-03 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1)||G(F(p2))))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 59
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 59
Applied a total of 12 rules in 8 ms. Remains 64 /70 variables (removed 6) and now considering 59/65 (removed 6) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 05:12:08] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 05:12:08] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 05:12:08] [INFO ] Invariant cache hit.
[2024-05-29 05:12:08] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-29 05:12:08] [INFO ] Invariant cache hit.
[2024-05-29 05:12:08] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/70 places, 59/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 64/70 places, 59/65 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s25 1) (EQ s39 1)), p2:(EQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 511 steps with 17 reset in 4 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-04 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 56
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 61 transition count 51
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 56 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 51 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 51 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 51 transition count 44
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 49 transition count 44
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 64 place count 37 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 36 transition count 31
Applied a total of 65 rules in 17 ms. Remains 36 /70 variables (removed 34) and now considering 31/65 (removed 34) transitions.
// Phase 1: matrix 31 rows 36 cols
[2024-05-29 05:12:08] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 05:12:08] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 05:12:08] [INFO ] Invariant cache hit.
[2024-05-29 05:12:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-29 05:12:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 05:12:08] [INFO ] Invariant cache hit.
[2024-05-29 05:12:08] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/70 places, 31/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 36/70 places, 31/65 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s33 1) (OR (EQ s30 0) (EQ s8 0) (EQ s23 0) (EQ s3 0))), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 259 steps with 3 reset in 2 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-05 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 69 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 62 transition count 57
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 62 transition count 51
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 56 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 33 place count 49 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 40 place count 49 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 40 place count 49 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 46 transition count 41
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 72 place count 33 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 32 transition count 27
Applied a total of 73 rules in 9 ms. Remains 32 /70 variables (removed 38) and now considering 27/65 (removed 38) transitions.
// Phase 1: matrix 27 rows 32 cols
[2024-05-29 05:12:09] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 05:12:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 05:12:09] [INFO ] Invariant cache hit.
[2024-05-29 05:12:09] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-29 05:12:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 05:12:09] [INFO ] Invariant cache hit.
[2024-05-29 05:12:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/70 places, 27/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 32/70 places, 27/65 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-06 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 s1 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-06 finished in 180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(G(p1)&&F(G(p2))))))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 59
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 59
Applied a total of 12 rules in 7 ms. Remains 64 /70 variables (removed 6) and now considering 59/65 (removed 6) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 05:12:09] [INFO ] Computed 12 invariants in 5 ms
[2024-05-29 05:12:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 05:12:09] [INFO ] Invariant cache hit.
[2024-05-29 05:12:09] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-29 05:12:09] [INFO ] Invariant cache hit.
[2024-05-29 05:12:09] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/70 places, 59/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 64/70 places, 59/65 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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 : ShieldPPPs-PT-001B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s38 1), p0:(EQ s38 0), p2:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 72 ms.
Product exploration explored 100000 steps with 33333 reset in 85 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLFireability-07 finished in 624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 56
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 61 transition count 56
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 61 transition count 52
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 57 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 52 transition count 47
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 52 transition count 47
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 34 place count 52 transition count 45
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 50 transition count 45
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 36 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 35 transition count 30
Applied a total of 67 rules in 22 ms. Remains 35 /70 variables (removed 35) and now considering 30/65 (removed 35) transitions.
// Phase 1: matrix 30 rows 35 cols
[2024-05-29 05:12:09] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 05:12:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 05:12:09] [INFO ] Invariant cache hit.
[2024-05-29 05:12:09] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-29 05:12:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 05:12:09] [INFO ] Invariant cache hit.
[2024-05-29 05:12:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/70 places, 30/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 35/70 places, 30/65 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s20 1), p1:(OR (EQ s20 1) (EQ s24 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 278 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-08 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1)||(p1&&F(!p2)))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 58
Applied a total of 14 rules in 4 ms. Remains 63 /70 variables (removed 7) and now considering 58/65 (removed 7) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-05-29 05:12:10] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 05:12:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 05:12:10] [INFO ] Invariant cache hit.
[2024-05-29 05:12:10] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-29 05:12:10] [INFO ] Invariant cache hit.
[2024-05-29 05:12:10] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/70 places, 58/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 63/70 places, 58/65 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 2}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(AND (EQ s25 1) (EQ s41 1) (EQ s62 1)), p2:(AND (EQ s25 1) (EQ s41 1)), p1:(NEQ 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/63 stabilizing places and 11/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X p1), (X (NOT (AND p1 p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLFireability-09 finished in 627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(G(p2))&&p1)))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 59
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 64 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 64 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 58 transition count 53
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 51 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 51 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 51 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 50 transition count 45
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 64 place count 37 transition count 32
Applied a total of 64 rules in 17 ms. Remains 37 /70 variables (removed 33) and now considering 32/65 (removed 33) transitions.
// Phase 1: matrix 32 rows 37 cols
[2024-05-29 05:12:10] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 05:12:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 05:12:10] [INFO ] Invariant cache hit.
[2024-05-29 05:12:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-29 05:12:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:12:10] [INFO ] Invariant cache hit.
[2024-05-29 05:12:10] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/70 places, 32/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 37/70 places, 32/65 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s23 1)), p0:(EQ s36 1), p2:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13965 reset in 117 ms.
Product exploration explored 100000 steps with 13937 reset in 114 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/37 stabilizing places and 2/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 8 factoid took 262 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 24 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 457 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-05-29 05:12:12] [INFO ] Invariant cache hit.
[2024-05-29 05:12:12] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-29 05:12:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:12:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-29 05:12:12] [INFO ] Computed and/alt/rep : 31/77/31 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 05:12:12] [INFO ] Added : 24 causal constraints over 5 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-29 05:12:12] [INFO ] Invariant cache hit.
[2024-05-29 05:12:12] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-29 05:12:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:12:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-29 05:12:12] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-29 05:12:12] [INFO ] Computed and/alt/rep : 31/77/31 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 05:12:12] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 05:12:12] [INFO ] Invariant cache hit.
[2024-05-29 05:12:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 05:12:12] [INFO ] Invariant cache hit.
[2024-05-29 05:12:12] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-29 05:12:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 05:12:12] [INFO ] Invariant cache hit.
[2024-05-29 05:12:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 37/37 places, 32/32 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/37 stabilizing places and 2/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 8 factoid took 364 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 28 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 441 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-05-29 05:12:13] [INFO ] Invariant cache hit.
[2024-05-29 05:12:13] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-29 05:12:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:12:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-29 05:12:13] [INFO ] Computed and/alt/rep : 31/77/31 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 05:12:13] [INFO ] Added : 24 causal constraints over 5 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-29 05:12:13] [INFO ] Invariant cache hit.
[2024-05-29 05:12:13] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-29 05:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-29 05:12:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:12:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 05:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:12:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-29 05:12:14] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:12:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-29 05:12:14] [INFO ] Computed and/alt/rep : 31/77/31 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 05:12:14] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 13910 reset in 110 ms.
Product exploration explored 100000 steps with 13966 reset in 111 ms.
Built C files in :
/tmp/ltsmin16509080163486899272
[2024-05-29 05:12:14] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-29 05:12:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:12:14] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-29 05:12:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:12:14] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-29 05:12:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:12:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16509080163486899272
Running compilation step : cd /tmp/ltsmin16509080163486899272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin16509080163486899272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16509080163486899272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7139101878478082109.hoa' '--buchi-type=spotba'
LTSmin run took 210 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLFireability-14 finished in 4064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G((p1&&X(G((p1||G(p2))))))))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 60
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 60
Applied a total of 10 rules in 3 ms. Remains 65 /70 variables (removed 5) and now considering 60/65 (removed 5) transitions.
// Phase 1: matrix 60 rows 65 cols
[2024-05-29 05:12:14] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 05:12:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 05:12:14] [INFO ] Invariant cache hit.
[2024-05-29 05:12:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-29 05:12:14] [INFO ] Invariant cache hit.
[2024-05-29 05:12:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/70 places, 60/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 65/70 places, 60/65 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s56 1), p1:(NEQ s40 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][false, false, false, false]]
Product exploration explored 100000 steps with 2990 reset in 109 ms.
Product exploration explored 100000 steps with 3006 reset in 119 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 272 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-29 05:12:15] [INFO ] Invariant cache hit.
[2024-05-29 05:12:15] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 05:12:15] [INFO ] Invariant cache hit.
[2024-05-29 05:12:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-29 05:12:15] [INFO ] Invariant cache hit.
[2024-05-29 05:12:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 65/65 places, 60/60 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 107 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3003 reset in 111 ms.
Product exploration explored 100000 steps with 3003 reset in 117 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 60/60 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 60
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 8 place count 65 transition count 62
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 65 transition count 62
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 31 place count 65 transition count 62
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 57 transition count 54
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 57 transition count 54
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 47 rules in 6 ms. Remains 57 /65 variables (removed 8) and now considering 54/60 (removed 6) transitions.
[2024-05-29 05:12:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 54 rows 57 cols
[2024-05-29 05:12:17] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 05:12:17] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/65 places, 54/60 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 57/65 places, 54/60 transitions.
Built C files in :
/tmp/ltsmin13943037509461395903
[2024-05-29 05:12:17] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13943037509461395903
Running compilation step : cd /tmp/ltsmin13943037509461395903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 118 ms.
Running link step : cd /tmp/ltsmin13943037509461395903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13943037509461395903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15024149714591735312.hoa' '--buchi-type=spotba'
LTSmin run took 371 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLFireability-15 finished in 3256 ms.
All properties solved by simple procedures.
Total runtime 16605 ms.

BK_STOP 1716959539095

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-001B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPs-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788800228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-001B.tgz
mv ShieldPPPs-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;