Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717100484.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K Feb 26 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 02:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 02:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 02:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 02:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 355K Mar 5 18:23 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-040A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679453487291

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:51:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:51:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:51:30] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-22 02:51:30] [INFO ] Transformed 1243 places.
[2023-03-22 02:51:30] [INFO ] Transformed 1043 transitions.
[2023-03-22 02:51:30] [INFO ] Found NUPN structural information;
[2023-03-22 02:51:30] [INFO ] Parsed PT model containing 1243 places and 1043 transitions and 4006 arcs in 286 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 5 formulas.
FORMULA ShieldPPPs-PT-040A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 163 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-22 02:51:31] [INFO ] Computed 441 place invariants in 28 ms
[2023-03-22 02:51:34] [INFO ] Implicit Places using invariants in 3444 ms returned []
[2023-03-22 02:51:34] [INFO ] Invariant cache hit.
[2023-03-22 02:51:37] [INFO ] Implicit Places using invariants and state equation in 2842 ms returned []
Implicit Place search using SMT with State Equation took 6353 ms to find 0 implicit places.
[2023-03-22 02:51:37] [INFO ] Invariant cache hit.
[2023-03-22 02:51:39] [INFO ] Dead Transitions using invariants and state equation in 1963 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8491 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Support contains 50 out of 1243 places after structural reductions.
[2023-03-22 02:51:39] [INFO ] Flatten gal took : 164 ms
[2023-03-22 02:51:39] [INFO ] Flatten gal took : 111 ms
[2023-03-22 02:51:39] [INFO ] Input system was already deterministic with 1043 transitions.
Support contains 47 out of 1243 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:51:40] [INFO ] Invariant cache hit.
[2023-03-22 02:51:41] [INFO ] [Real]Absence check using 441 positive place invariants in 283 ms returned sat
[2023-03-22 02:51:41] [INFO ] After 552ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 02:51:41] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 7 ms to minimize.
[2023-03-22 02:51:41] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2023-03-22 02:51:41] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 3 ms to minimize.
[2023-03-22 02:51:42] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-22 02:51:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 548 ms
[2023-03-22 02:51:42] [INFO ] After 1147ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:51:42] [INFO ] After 1795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:51:42] [INFO ] [Nat]Absence check using 441 positive place invariants in 104 ms returned sat
[2023-03-22 02:51:43] [INFO ] After 701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:51:43] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 2 ms to minimize.
[2023-03-22 02:51:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2023-03-22 02:51:43] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-22 02:51:43] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2023-03-22 02:51:44] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 1 ms to minimize.
[2023-03-22 02:51:44] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 0 ms to minimize.
[2023-03-22 02:51:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 960 ms
[2023-03-22 02:51:44] [INFO ] After 1719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-22 02:51:44] [INFO ] After 2184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Partial Free-agglomeration rule applied 356 times.
Drop transitions removed 356 transitions
Iterating global reduction 0 with 356 rules applied. Total rules applied 360 place count 1241 transition count 1041
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 361 place count 1240 transition count 1040
Applied a total of 361 rules in 318 ms. Remains 1240 /1243 variables (removed 3) and now considering 1040/1043 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 1240/1243 places, 1040/1043 transitions.
Finished random walk after 2337 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=57 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 40 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-22 02:51:45] [INFO ] Invariant cache hit.
[2023-03-22 02:51:46] [INFO ] Implicit Places using invariants in 831 ms returned []
[2023-03-22 02:51:46] [INFO ] Invariant cache hit.
[2023-03-22 02:51:48] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2795 ms to find 0 implicit places.
[2023-03-22 02:51:48] [INFO ] Invariant cache hit.
[2023-03-22 02:51:49] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3762 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1092 1) (EQ s1094 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]]
Stuttering criterion allowed to conclude after 17611 steps with 81 reset in 233 ms.
FORMULA ShieldPPPs-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040A-LTLFireability-00 finished in 4367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Applied a total of 4 rules in 120 ms. Remains 1241 /1243 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2023-03-22 02:51:49] [INFO ] Computed 441 place invariants in 8 ms
[2023-03-22 02:51:50] [INFO ] Implicit Places using invariants in 946 ms returned []
[2023-03-22 02:51:50] [INFO ] Invariant cache hit.
[2023-03-22 02:51:54] [INFO ] Implicit Places using invariants and state equation in 4227 ms returned []
Implicit Place search using SMT with State Equation took 5203 ms to find 0 implicit places.
[2023-03-22 02:51:55] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-22 02:51:55] [INFO ] Invariant cache hit.
[2023-03-22 02:51:55] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/1243 places, 1041/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6267 ms. Remains : 1241/1243 places, 1041/1043 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s330 0) (EQ s351 0))], 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 37 reset in 973 ms.
Product exploration explored 100000 steps with 37 reset in 1111 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Finished random walk after 1890 steps, including 0 resets, run visited all 1 properties in 48 ms. (steps per millisecond=39 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 81 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2023-03-22 02:51:58] [INFO ] Invariant cache hit.
[2023-03-22 02:52:03] [INFO ] Implicit Places using invariants in 5161 ms returned []
[2023-03-22 02:52:03] [INFO ] Invariant cache hit.
[2023-03-22 02:52:06] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 7731 ms to find 0 implicit places.
[2023-03-22 02:52:06] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 02:52:06] [INFO ] Invariant cache hit.
[2023-03-22 02:52:07] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8771 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Finished random walk after 1939 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=77 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Product exploration explored 100000 steps with 37 reset in 830 ms.
Product exploration explored 100000 steps with 37 reset in 987 ms.
Support contains 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 35 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2023-03-22 02:52:10] [INFO ] Invariant cache hit.
[2023-03-22 02:52:10] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-22 02:52:10] [INFO ] Invariant cache hit.
[2023-03-22 02:52:12] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
[2023-03-22 02:52:12] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 02:52:12] [INFO ] Invariant cache hit.
[2023-03-22 02:52:13] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3296 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Treatment of property ShieldPPPs-PT-040A-LTLFireability-01 finished in 23909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1241 transition count 1041
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1240 transition count 1040
Applied a total of 4 rules in 147 ms. Remains 1240 /1243 variables (removed 3) and now considering 1040/1043 (removed 3) transitions.
// Phase 1: matrix 1040 rows 1240 cols
[2023-03-22 02:52:13] [INFO ] Computed 441 place invariants in 7 ms
[2023-03-22 02:52:14] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-03-22 02:52:14] [INFO ] Invariant cache hit.
[2023-03-22 02:52:16] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2677 ms to find 0 implicit places.
[2023-03-22 02:52:16] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-22 02:52:16] [INFO ] Invariant cache hit.
[2023-03-22 02:52:17] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1240/1243 places, 1040/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3639 ms. Remains : 1240/1243 places, 1040/1043 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-02 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1102 1) (EQ s1111 1)), p1:(EQ s21 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 3143 steps with 1 reset in 52 ms.
FORMULA ShieldPPPs-PT-040A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040A-LTLFireability-02 finished in 3982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 40 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-22 02:52:17] [INFO ] Computed 441 place invariants in 5 ms
[2023-03-22 02:52:18] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-22 02:52:18] [INFO ] Invariant cache hit.
[2023-03-22 02:52:20] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2462 ms to find 0 implicit places.
[2023-03-22 02:52:20] [INFO ] Invariant cache hit.
[2023-03-22 02:52:21] [INFO ] Dead Transitions using invariants and state equation in 1398 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3916 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s73 1) (EQ s83 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]]
Stuttering criterion allowed to conclude after 2685 steps with 0 reset in 45 ms.
FORMULA ShieldPPPs-PT-040A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040A-LTLFireability-03 finished in 4114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Support contains 6 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1241 transition count 1041
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1240 transition count 1040
Applied a total of 4 rules in 95 ms. Remains 1240 /1243 variables (removed 3) and now considering 1040/1043 (removed 3) transitions.
// Phase 1: matrix 1040 rows 1240 cols
[2023-03-22 02:52:21] [INFO ] Computed 441 place invariants in 8 ms
[2023-03-22 02:52:22] [INFO ] Implicit Places using invariants in 762 ms returned []
[2023-03-22 02:52:22] [INFO ] Invariant cache hit.
[2023-03-22 02:52:24] [INFO ] Implicit Places using invariants and state equation in 1766 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
[2023-03-22 02:52:24] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 02:52:24] [INFO ] Invariant cache hit.
[2023-03-22 02:52:25] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1240/1243 places, 1040/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3585 ms. Remains : 1240/1243 places, 1040/1043 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s749 1) (EQ s765 1) (OR (EQ s754 0) (EQ s764 0))), p0:(OR (EQ s729 0) (EQ s731 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 117 reset in 967 ms.
Product exploration explored 100000 steps with 116 reset in 1116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 614 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Finished random walk after 919 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 529 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1240 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 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 63 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-22 02:52:29] [INFO ] Invariant cache hit.
[2023-03-22 02:52:30] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-22 02:52:30] [INFO ] Invariant cache hit.
[2023-03-22 02:52:31] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2592 ms to find 0 implicit places.
[2023-03-22 02:52:31] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 02:52:31] [INFO ] Invariant cache hit.
[2023-03-22 02:52:32] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3508 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Finished random walk after 730 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=31 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 118 reset in 814 ms.
Product exploration explored 100000 steps with 118 reset in 1020 ms.
Support contains 2 out of 1240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 27 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-22 02:52:35] [INFO ] Invariant cache hit.
[2023-03-22 02:52:36] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-22 02:52:36] [INFO ] Invariant cache hit.
[2023-03-22 02:52:38] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
[2023-03-22 02:52:38] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 02:52:38] [INFO ] Invariant cache hit.
[2023-03-22 02:52:39] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3731 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Treatment of property ShieldPPPs-PT-040A-LTLFireability-04 finished in 17872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(!(p0 U (F((G(p0)||p1))||p2))))))'
Support contains 6 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Applied a total of 4 rules in 53 ms. Remains 1241 /1243 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2023-03-22 02:52:39] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-22 02:52:40] [INFO ] Implicit Places using invariants in 862 ms returned []
[2023-03-22 02:52:40] [INFO ] Invariant cache hit.
[2023-03-22 02:52:42] [INFO ] Implicit Places using invariants and state equation in 1988 ms returned []
Implicit Place search using SMT with State Equation took 2884 ms to find 0 implicit places.
[2023-03-22 02:52:42] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-22 02:52:42] [INFO ] Invariant cache hit.
[2023-03-22 02:52:43] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/1243 places, 1041/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3686 ms. Remains : 1241/1243 places, 1041/1043 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR p2 p0 p1), (OR p2 p0 p1), (OR p0 p1), p0]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0, 1} source=2 dest: 1}, { cond=(NOT p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s690 1) (EQ s710 1)), p2:(AND (EQ s636 1) (EQ s653 1)), p1:(AND (EQ s511 1) (EQ s553 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 72 reset in 993 ms.
Product exploration explored 100000 steps with 68 reset in 1052 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 1019 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR p0 p2 p1), (OR p0 p2 p1), (OR p0 p1), p0]
Finished random walk after 1164 steps, including 0 resets, run visited all 7 properties in 49 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (OR p2 p1)), (F p0), (F (AND p0 (NOT p1))), (F (OR p2 p0 p1)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 13 factoid took 1063 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 313 ms :[(OR p0 p2 p1), (OR p0 p2 p1), (OR p0 p1), p0]
Stuttering acceptance computed with spot in 244 ms :[(OR p0 p2 p1), (OR p0 p2 p1), (OR p0 p1), p0]
Support contains 6 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 53 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2023-03-22 02:52:48] [INFO ] Invariant cache hit.
[2023-03-22 02:52:49] [INFO ] Implicit Places using invariants in 1071 ms returned []
[2023-03-22 02:52:49] [INFO ] Invariant cache hit.
[2023-03-22 02:52:51] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 3203 ms to find 0 implicit places.
[2023-03-22 02:52:51] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 02:52:51] [INFO ] Invariant cache hit.
[2023-03-22 02:52:52] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4129 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 961 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR p0 p2 p1), (OR p0 p2 p1), (OR p0 p1), p0]
Finished random walk after 4057 steps, including 1 resets, run visited all 7 properties in 94 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (OR p2 p1)), (F p0), (F (AND p0 (NOT p1))), (F (OR p2 p0 p1)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 13 factoid took 1675 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 404 ms :[(OR p0 p2 p1), (OR p0 p2 p1), (OR p0 p1), p0]
Stuttering acceptance computed with spot in 306 ms :[(OR p0 p2 p1), (OR p0 p2 p1), (OR p0 p1), p0]
Stuttering acceptance computed with spot in 371 ms :[(OR p0 p2 p1), (OR p0 p2 p1), (OR p0 p1), p0]
Product exploration explored 100000 steps with 75 reset in 895 ms.
Product exploration explored 100000 steps with 66 reset in 1026 ms.
Support contains 6 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 33 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2023-03-22 02:52:59] [INFO ] Invariant cache hit.
[2023-03-22 02:52:59] [INFO ] Implicit Places using invariants in 937 ms returned []
[2023-03-22 02:52:59] [INFO ] Invariant cache hit.
[2023-03-22 02:53:01] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 2938 ms to find 0 implicit places.
[2023-03-22 02:53:01] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-22 02:53:01] [INFO ] Invariant cache hit.
[2023-03-22 02:53:02] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3816 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Treatment of property ShieldPPPs-PT-040A-LTLFireability-05 finished in 23351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1241 transition count 1041
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1240 transition count 1040
Applied a total of 4 rules in 133 ms. Remains 1240 /1243 variables (removed 3) and now considering 1040/1043 (removed 3) transitions.
// Phase 1: matrix 1040 rows 1240 cols
[2023-03-22 02:53:03] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-22 02:53:03] [INFO ] Implicit Places using invariants in 884 ms returned []
[2023-03-22 02:53:03] [INFO ] Invariant cache hit.
[2023-03-22 02:53:07] [INFO ] Implicit Places using invariants and state equation in 3433 ms returned []
Implicit Place search using SMT with State Equation took 4322 ms to find 0 implicit places.
[2023-03-22 02:53:07] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-22 02:53:07] [INFO ] Invariant cache hit.
[2023-03-22 02:53:08] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1240/1243 places, 1040/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5496 ms. Remains : 1240/1243 places, 1040/1043 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-07 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 (NEQ s1190 1) (NEQ s1209 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 36 reset in 942 ms.
Product exploration explored 100000 steps with 37 reset in 1156 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 1295 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=92 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 279 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Support contains 2 out of 1240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 45 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-22 02:53:11] [INFO ] Invariant cache hit.
[2023-03-22 02:53:12] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-03-22 02:53:12] [INFO ] Invariant cache hit.
[2023-03-22 02:53:14] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 2646 ms to find 0 implicit places.
[2023-03-22 02:53:14] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-22 02:53:14] [INFO ] Invariant cache hit.
[2023-03-22 02:53:15] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3904 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 2947 steps, including 1 resets, run visited all 1 properties in 36 ms. (steps per millisecond=81 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 37 reset in 980 ms.
Product exploration explored 100000 steps with 37 reset in 1124 ms.
Support contains 2 out of 1240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 29 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-22 02:53:18] [INFO ] Invariant cache hit.
[2023-03-22 02:53:19] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2023-03-22 02:53:19] [INFO ] Invariant cache hit.
[2023-03-22 02:53:21] [INFO ] Implicit Places using invariants and state equation in 2087 ms returned []
Implicit Place search using SMT with State Equation took 3248 ms to find 0 implicit places.
[2023-03-22 02:53:21] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 02:53:21] [INFO ] Invariant cache hit.
[2023-03-22 02:53:22] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4267 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Treatment of property ShieldPPPs-PT-040A-LTLFireability-07 finished in 19469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1241 transition count 1041
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1240 transition count 1040
Applied a total of 4 rules in 91 ms. Remains 1240 /1243 variables (removed 3) and now considering 1040/1043 (removed 3) transitions.
[2023-03-22 02:53:22] [INFO ] Invariant cache hit.
[2023-03-22 02:53:23] [INFO ] Implicit Places using invariants in 827 ms returned []
[2023-03-22 02:53:23] [INFO ] Invariant cache hit.
[2023-03-22 02:53:24] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2550 ms to find 0 implicit places.
[2023-03-22 02:53:25] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 02:53:25] [INFO ] Invariant cache hit.
[2023-03-22 02:53:25] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1240/1243 places, 1040/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3502 ms. Remains : 1240/1243 places, 1040/1043 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-08 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)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s140 1) (EQ s142 1)), p0:(OR (EQ s1069 0) (EQ s1084 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 99 reset in 865 ms.
Product exploration explored 100000 steps with 95 reset in 1010 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:53:28] [INFO ] Invariant cache hit.
[2023-03-22 02:53:28] [INFO ] [Real]Absence check using 441 positive place invariants in 202 ms returned sat
[2023-03-22 02:53:29] [INFO ] After 1385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:53:30] [INFO ] [Nat]Absence check using 441 positive place invariants in 165 ms returned sat
[2023-03-22 02:53:30] [INFO ] After 565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:53:31] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 26 ms to minimize.
[2023-03-22 02:53:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-22 02:53:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2023-03-22 02:53:31] [INFO ] After 1032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-22 02:53:31] [INFO ] After 1600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 1240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1240 transition count 1040
Applied a total of 237 rules in 108 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished probabilistic random walk after 215495 steps, run visited all 1 properties in 2491 ms. (steps per millisecond=86 )
Probabilistic random walk after 215495 steps, saw 213239 distinct states, run finished after 2492 ms. (steps per millisecond=86 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 341 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 30 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-22 02:53:34] [INFO ] Invariant cache hit.
[2023-03-22 02:53:35] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2023-03-22 02:53:35] [INFO ] Invariant cache hit.
[2023-03-22 02:53:37] [INFO ] Implicit Places using invariants and state equation in 2092 ms returned []
Implicit Place search using SMT with State Equation took 3128 ms to find 0 implicit places.
[2023-03-22 02:53:37] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 02:53:37] [INFO ] Invariant cache hit.
[2023-03-22 02:53:38] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3918 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:53:39] [INFO ] Invariant cache hit.
[2023-03-22 02:53:39] [INFO ] [Real]Absence check using 441 positive place invariants in 141 ms returned sat
[2023-03-22 02:53:40] [INFO ] After 1171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:53:40] [INFO ] [Nat]Absence check using 441 positive place invariants in 84 ms returned sat
[2023-03-22 02:53:41] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:53:42] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-22 02:53:42] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-03-22 02:53:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2023-03-22 02:53:42] [INFO ] After 1392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-22 02:53:42] [INFO ] After 1823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 1240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1240 transition count 1040
Applied a total of 237 rules in 117 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Finished probabilistic random walk after 215495 steps, run visited all 1 properties in 2692 ms. (steps per millisecond=80 )
Probabilistic random walk after 215495 steps, saw 213239 distinct states, run finished after 2694 ms. (steps per millisecond=79 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 473 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 79 reset in 1092 ms.
Product exploration explored 100000 steps with 74 reset in 1094 ms.
Support contains 4 out of 1240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 27 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-22 02:53:48] [INFO ] Invariant cache hit.
[2023-03-22 02:53:49] [INFO ] Implicit Places using invariants in 995 ms returned []
[2023-03-22 02:53:49] [INFO ] Invariant cache hit.
[2023-03-22 02:53:51] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
[2023-03-22 02:53:51] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-22 02:53:51] [INFO ] Invariant cache hit.
[2023-03-22 02:53:52] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3651 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Treatment of property ShieldPPPs-PT-040A-LTLFireability-08 finished in 29880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 8 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 24 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-22 02:53:52] [INFO ] Computed 441 place invariants in 5 ms
[2023-03-22 02:53:52] [INFO ] Implicit Places using invariants in 739 ms returned []
[2023-03-22 02:53:53] [INFO ] Invariant cache hit.
[2023-03-22 02:53:55] [INFO ] Implicit Places using invariants and state equation in 2923 ms returned []
Implicit Place search using SMT with State Equation took 3706 ms to find 0 implicit places.
[2023-03-22 02:53:55] [INFO ] Invariant cache hit.
[2023-03-22 02:53:57] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5074 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s202 1) (EQ s217 1)), p0:(AND (OR (EQ s82 0) (EQ s103 0)) (OR (AND (EQ s566 1) (EQ s586 1)) (AND (EQ s440 1) (EQ s457 1)) (AND (EQ s202 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-040A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040A-LTLFireability-11 finished in 5326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0))&&(G(p1) U p2)) U X(p3)))'
Support contains 7 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 28 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-22 02:53:57] [INFO ] Invariant cache hit.
[2023-03-22 02:53:58] [INFO ] Implicit Places using invariants in 1115 ms returned []
[2023-03-22 02:53:58] [INFO ] Invariant cache hit.
[2023-03-22 02:54:00] [INFO ] Implicit Places using invariants and state equation in 1902 ms returned []
Implicit Place search using SMT with State Equation took 3051 ms to find 0 implicit places.
[2023-03-22 02:54:00] [INFO ] Invariant cache hit.
[2023-03-22 02:54:01] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3851 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Stuttering acceptance computed with spot in 413 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(NOT p3), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s202 1) (EQ s219 1)), p1:(AND (EQ s4 1) (EQ s25 1)), p3:(EQ s900 1), p0:(AND (EQ s1150 1) (EQ s1177 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-040A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040A-LTLFireability-12 finished in 4324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !p1)))'
Support contains 6 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 26 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-22 02:54:01] [INFO ] Invariant cache hit.
[2023-03-22 02:54:03] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2023-03-22 02:54:03] [INFO ] Invariant cache hit.
[2023-03-22 02:54:04] [INFO ] Implicit Places using invariants and state equation in 1773 ms returned []
Implicit Place search using SMT with State Equation took 2969 ms to find 0 implicit places.
[2023-03-22 02:54:04] [INFO ] Invariant cache hit.
[2023-03-22 02:54:05] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4077 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Stuttering acceptance computed with spot in 167 ms :[p1, p1, true]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (EQ s15 1) (EQ s57 1)) (AND (EQ s844 1) (EQ s846 1))), p0:(AND (EQ s659 1) (EQ s679 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2921 ms.
Product exploration explored 100000 steps with 50000 reset in 2940 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0))
Knowledge based reduction with 6 factoid took 332 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-040A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-040A-LTLFireability-13 finished in 10463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(!(p0 U (F((G(p0)||p1))||p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2023-03-22 02:54:13] [INFO ] Flatten gal took : 94 ms
[2023-03-22 02:54:13] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 02:54:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1243 places, 1043 transitions and 4006 arcs took 10 ms.
Total runtime 162843 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1722/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1722/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1722/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1722/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1722/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-040A-LTLFireability-01
Could not compute solution for formula : ShieldPPPs-PT-040A-LTLFireability-04
Could not compute solution for formula : ShieldPPPs-PT-040A-LTLFireability-05
Could not compute solution for formula : ShieldPPPs-PT-040A-LTLFireability-07
Could not compute solution for formula : ShieldPPPs-PT-040A-LTLFireability-08

BK_STOP 1679453655941

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPs-PT-040A-LTLFireability-01
ltl formula formula --ltl=/tmp/1722/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1243 places, 1043 transitions and 4006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.050 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1722/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1722/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1722/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1722/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-040A-LTLFireability-04
ltl formula formula --ltl=/tmp/1722/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1243 places, 1043 transitions and 4006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.070 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1722/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1722/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1722/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1722/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldPPPs-PT-040A-LTLFireability-05
ltl formula formula --ltl=/tmp/1722/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1243 places, 1043 transitions and 4006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.040 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1722/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1722/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1722/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1722/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldPPPs-PT-040A-LTLFireability-07
ltl formula formula --ltl=/tmp/1722/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1243 places, 1043 transitions and 4006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.060 user 0.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1722/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1722/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1722/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1722/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-040A-LTLFireability-08
ltl formula formula --ltl=/tmp/1722/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1243 places, 1043 transitions and 4006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1722/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1722/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1722/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.060 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1722/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-040A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-040A, 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 r393-oct2-167903717100484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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