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-167903717300660.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 ShieldPPPt-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-167903717300660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 21:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 21:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 268K 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 ShieldPPPt-PT-040A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679467338866

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=ShieldPPPt-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:42:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:42:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:42:22] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-22 06:42:22] [INFO ] Transformed 1003 places.
[2023-03-22 06:42:22] [INFO ] Transformed 723 transitions.
[2023-03-22 06:42:22] [INFO ] Found NUPN structural information;
[2023-03-22 06:42:22] [INFO ] Parsed PT model containing 1003 places and 723 transitions and 2886 arcs in 243 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 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-040A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 138 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2023-03-22 06:42:23] [INFO ] Computed 441 place invariants in 18 ms
[2023-03-22 06:42:24] [INFO ] Implicit Places using invariants in 1331 ms returned []
[2023-03-22 06:42:24] [INFO ] Invariant cache hit.
[2023-03-22 06:42:26] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned []
Implicit Place search using SMT with State Equation took 3434 ms to find 0 implicit places.
[2023-03-22 06:42:26] [INFO ] Invariant cache hit.
[2023-03-22 06:42:27] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4305 ms. Remains : 1003/1003 places, 722/722 transitions.
Support contains 50 out of 1003 places after structural reductions.
[2023-03-22 06:42:27] [INFO ] Flatten gal took : 257 ms
[2023-03-22 06:42:27] [INFO ] Flatten gal took : 63 ms
[2023-03-22 06:42:28] [INFO ] Input system was already deterministic with 722 transitions.
Support contains 48 out of 1003 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 29) seen :12
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-22 06:42:28] [INFO ] Invariant cache hit.
[2023-03-22 06:42:29] [INFO ] [Real]Absence check using 441 positive place invariants in 96 ms returned sat
[2023-03-22 06:42:31] [INFO ] After 2639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-22 06:42:32] [INFO ] [Nat]Absence check using 441 positive place invariants in 640 ms returned sat
[2023-03-22 06:42:35] [INFO ] After 1789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-22 06:42:37] [INFO ] After 4179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1760 ms.
[2023-03-22 06:42:39] [INFO ] After 7784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Finished Parikh walk after 1332 steps, including 0 resets, run visited all 3 properties in 32 ms. (steps per millisecond=41 )
Parikh walk visited 17 properties in 1232 ms.
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' '!(F((G(p0)||G((p0 U p1)))))'
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 720
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 998 transition count 718
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 9 place count 997 transition count 717
Applied a total of 9 rules in 222 ms. Remains 997 /1003 variables (removed 6) and now considering 717/722 (removed 5) transitions.
// Phase 1: matrix 717 rows 997 cols
[2023-03-22 06:42:41] [INFO ] Computed 440 place invariants in 7 ms
[2023-03-22 06:42:42] [INFO ] Implicit Places using invariants in 818 ms returned [980, 984]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 821 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1003 places, 717/722 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 993 transition count 715
Applied a total of 4 rules in 112 ms. Remains 993 /995 variables (removed 2) and now considering 715/717 (removed 2) transitions.
// Phase 1: matrix 715 rows 993 cols
[2023-03-22 06:42:42] [INFO ] Computed 438 place invariants in 8 ms
[2023-03-22 06:42:43] [INFO ] Implicit Places using invariants in 922 ms returned []
[2023-03-22 06:42:43] [INFO ] Invariant cache hit.
[2023-03-22 06:42:45] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2661 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 993/1003 places, 715/722 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3817 ms. Remains : 993/1003 places, 715/722 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s911 1) (EQ s913 1)), p1:(EQ s496 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 928 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-01 finished in 5154 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)&&!(p0 U p1)))'
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 1001 transition count 720
Applied a total of 4 rules in 89 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-22 06:42:46] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-22 06:42:47] [INFO ] Implicit Places using invariants in 874 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 900 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
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 998 transition count 718
Applied a total of 4 rules in 84 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2023-03-22 06:42:47] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:42:48] [INFO ] Implicit Places using invariants in 752 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 768 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 994 transition count 716
Applied a total of 4 rules in 48 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:42:48] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-22 06:42:48] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-22 06:42:48] [INFO ] Invariant cache hit.
[2023-03-22 06:42:49] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3724 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p0), p1, (OR (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s353 1) (EQ s376 1)), p1:(EQ s520 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 764 ms.
Stack based approach found an accepted trace after 118 steps with 0 reset with depth 119 and stack size 119 in 4 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-02 finished in 4799 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(F((X(F(p1))||p0)))))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 60 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2023-03-22 06:42:51] [INFO ] Computed 441 place invariants in 20 ms
[2023-03-22 06:42:51] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-22 06:42:51] [INFO ] Invariant cache hit.
[2023-03-22 06:42:53] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
[2023-03-22 06:42:53] [INFO ] Invariant cache hit.
[2023-03-22 06:42:54] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3074 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(OR (EQ s258 0) (EQ s275 0)), p1:(AND (EQ s932 1) (EQ s934 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1826 ms.
Product exploration explored 100000 steps with 33333 reset in 1990 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040A-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040A-LTLFireability-04 finished in 7266 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((X(p0)||(p1 U p2)))))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 24 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-22 06:42:58] [INFO ] Invariant cache hit.
[2023-03-22 06:42:59] [INFO ] Implicit Places using invariants in 809 ms returned []
[2023-03-22 06:42:59] [INFO ] Invariant cache hit.
[2023-03-22 06:43:00] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2023-03-22 06:43:00] [INFO ] Invariant cache hit.
[2023-03-22 06:43:01] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2998 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s899 1), p1:(AND (EQ s928 1) (EQ s951 1)), p0:(EQ s276 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33238 reset in 1793 ms.
Product exploration explored 100000 steps with 33379 reset in 1861 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 797 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 06:43:06] [INFO ] Invariant cache hit.
[2023-03-22 06:43:07] [INFO ] [Real]Absence check using 441 positive place invariants in 240 ms returned sat
[2023-03-22 06:43:07] [INFO ] After 1242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:43:08] [INFO ] [Nat]Absence check using 441 positive place invariants in 102 ms returned sat
[2023-03-22 06:43:09] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:43:09] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 220 ms.
[2023-03-22 06:43:09] [INFO ] After 1943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 161 ms.
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Partial Free-agglomeration rule applied 159 times.
Drop transitions removed 159 transitions
Iterating global reduction 0 with 159 rules applied. Total rules applied 163 place count 1001 transition count 720
Applied a total of 163 rules in 120 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 1001/1003 places, 720/722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251103 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251103 steps, saw 241655 distinct states, run finished after 3005 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-22 06:43:13] [INFO ] Computed 441 place invariants in 7 ms
[2023-03-22 06:43:13] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:43:13] [INFO ] [Nat]Absence check using 441 positive place invariants in 219 ms returned sat
[2023-03-22 06:43:14] [INFO ] After 703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:43:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 06:43:14] [INFO ] After 97ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:43:14] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 06:43:14] [INFO ] After 1497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Applied a total of 0 rules in 36 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1001/1001 places, 720/720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Applied a total of 0 rules in 59 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2023-03-22 06:43:15] [INFO ] Invariant cache hit.
[2023-03-22 06:43:15] [INFO ] Implicit Places using invariants in 728 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 730 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 720/720 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 38 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2023-03-22 06:43:15] [INFO ] Computed 440 place invariants in 7 ms
[2023-03-22 06:43:16] [INFO ] Implicit Places using invariants in 675 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 677 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 996/1001 places, 718/720 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 994 transition count 716
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 994 transition count 716
Applied a total of 4 rules in 118 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:43:16] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-22 06:43:17] [INFO ] Implicit Places using invariants in 996 ms returned []
[2023-03-22 06:43:17] [INFO ] Invariant cache hit.
[2023-03-22 06:43:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 06:43:19] [INFO ] Implicit Places using invariants and state equation in 1963 ms returned []
Implicit Place search using SMT with State Equation took 2980 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 994/1001 places, 716/720 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4603 ms. Remains : 994/1001 places, 716/720 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 264989 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264989 steps, saw 254168 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:43:22] [INFO ] Invariant cache hit.
[2023-03-22 06:43:22] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:43:23] [INFO ] [Nat]Absence check using 438 positive place invariants in 64 ms returned sat
[2023-03-22 06:43:23] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:43:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 06:43:23] [INFO ] After 168ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:43:24] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-22 06:43:24] [INFO ] After 1261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 766 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=69 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 1515 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 73 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2023-03-22 06:43:26] [INFO ] Computed 441 place invariants in 2 ms
[2023-03-22 06:43:27] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-22 06:43:27] [INFO ] Invariant cache hit.
[2023-03-22 06:43:28] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
[2023-03-22 06:43:28] [INFO ] Invariant cache hit.
[2023-03-22 06:43:29] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3013 ms. Remains : 1003/1003 places, 722/722 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 p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 817 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 06:43:30] [INFO ] Invariant cache hit.
[2023-03-22 06:43:31] [INFO ] [Real]Absence check using 441 positive place invariants in 66 ms returned sat
[2023-03-22 06:43:32] [INFO ] After 1464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:43:33] [INFO ] [Nat]Absence check using 441 positive place invariants in 387 ms returned sat
[2023-03-22 06:43:34] [INFO ] After 949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:43:34] [INFO ] After 1341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-22 06:43:34] [INFO ] After 2540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 73 ms.
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Partial Free-agglomeration rule applied 159 times.
Drop transitions removed 159 transitions
Iterating global reduction 0 with 159 rules applied. Total rules applied 163 place count 1001 transition count 720
Applied a total of 163 rules in 118 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1001/1003 places, 720/722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 279623 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279623 steps, saw 269595 distinct states, run finished after 3014 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-22 06:43:38] [INFO ] Computed 441 place invariants in 29 ms
[2023-03-22 06:43:38] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:43:39] [INFO ] [Nat]Absence check using 441 positive place invariants in 126 ms returned sat
[2023-03-22 06:43:39] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:43:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 06:43:39] [INFO ] After 43ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:43:39] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-22 06:43:39] [INFO ] After 1243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Applied a total of 0 rules in 24 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1001/1001 places, 720/720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Applied a total of 0 rules in 33 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2023-03-22 06:43:39] [INFO ] Invariant cache hit.
[2023-03-22 06:43:40] [INFO ] Implicit Places using invariants in 691 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 692 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 720/720 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 50 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2023-03-22 06:43:40] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-22 06:43:41] [INFO ] Implicit Places using invariants in 990 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 992 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 996/1001 places, 718/720 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 994 transition count 716
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 994 transition count 716
Applied a total of 4 rules in 63 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:43:41] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:43:42] [INFO ] Implicit Places using invariants in 692 ms returned []
[2023-03-22 06:43:42] [INFO ] Invariant cache hit.
[2023-03-22 06:43:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 06:43:46] [INFO ] Implicit Places using invariants and state equation in 4139 ms returned []
Implicit Place search using SMT with State Equation took 4857 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 994/1001 places, 716/720 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6688 ms. Remains : 994/1001 places, 716/720 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 281415 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281415 steps, saw 270269 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:43:49] [INFO ] Invariant cache hit.
[2023-03-22 06:43:49] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:43:50] [INFO ] [Nat]Absence check using 438 positive place invariants in 81 ms returned sat
[2023-03-22 06:43:50] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:43:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 06:43:50] [INFO ] After 174ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:43:51] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-22 06:43:51] [INFO ] After 1230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 766 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=69 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 1191 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 33323 reset in 1700 ms.
Product exploration explored 100000 steps with 33136 reset in 1888 ms.
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 20 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2023-03-22 06:43:56] [INFO ] Computed 441 place invariants in 2 ms
[2023-03-22 06:43:57] [INFO ] Implicit Places using invariants in 633 ms returned []
[2023-03-22 06:43:57] [INFO ] Invariant cache hit.
[2023-03-22 06:43:58] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
[2023-03-22 06:43:58] [INFO ] Invariant cache hit.
[2023-03-22 06:43:59] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2671 ms. Remains : 1003/1003 places, 722/722 transitions.
Treatment of property ShieldPPPt-PT-040A-LTLFireability-05 finished in 61476 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(F((((p1 U p2)||G(p3))&&p0)))))'
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Applied a total of 4 rules in 50 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-22 06:43:59] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-22 06:44:00] [INFO ] Implicit Places using invariants in 1146 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1148 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 90 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2023-03-22 06:44:01] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-22 06:44:01] [INFO ] Implicit Places using invariants in 704 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 709 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 994 transition count 716
Applied a total of 4 rules in 45 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:44:01] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-22 06:44:02] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-22 06:44:02] [INFO ] Invariant cache hit.
[2023-03-22 06:44:04] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4326 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) p3) (AND (NOT p0) p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) p3), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) p1 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s951 1), p1:(AND (EQ s243 1) (EQ s250 1)), p3:(AND (EQ s670 1) (EQ s685 1)), p0:(AND (EQ s566 1) (EQ s577 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 830 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-07 finished in 5597 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(G((p0 U p1))))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2023-03-22 06:44:05] [INFO ] Computed 441 place invariants in 2 ms
[2023-03-22 06:44:05] [INFO ] Implicit Places using invariants in 625 ms returned []
[2023-03-22 06:44:06] [INFO ] Invariant cache hit.
[2023-03-22 06:44:15] [INFO ] Implicit Places using invariants and state equation in 9848 ms returned []
Implicit Place search using SMT with State Equation took 10513 ms to find 0 implicit places.
[2023-03-22 06:44:15] [INFO ] Invariant cache hit.
[2023-03-22 06:44:19] [INFO ] Dead Transitions using invariants and state equation in 3914 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14463 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s25 1)), p0:(AND (EQ s803 1) (EQ s826 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-08 finished in 14661 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) U G(p0)) U p1)))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 15 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-22 06:44:20] [INFO ] Invariant cache hit.
[2023-03-22 06:44:20] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-22 06:44:20] [INFO ] Invariant cache hit.
[2023-03-22 06:44:22] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
[2023-03-22 06:44:22] [INFO ] Invariant cache hit.
[2023-03-22 06:44:23] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3098 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s136 1) (EQ s146 1)), p0:(AND (EQ s258 1) (EQ s275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-09 finished in 3280 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((p0||X((X(p0)||G(p1))))))'
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 40 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-22 06:44:23] [INFO ] Invariant cache hit.
[2023-03-22 06:44:23] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-22 06:44:23] [INFO ] Invariant cache hit.
[2023-03-22 06:44:25] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2384 ms to find 0 implicit places.
[2023-03-22 06:44:25] [INFO ] Invariant cache hit.
[2023-03-22 06:44:26] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3040 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s645 1), p1:(AND (EQ s232 1) (EQ s234 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-10 finished in 3387 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))&&((G(p1)&&X(!p2)) U !p3)))'
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 30 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-22 06:44:26] [INFO ] Invariant cache hit.
[2023-03-22 06:44:27] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-22 06:44:27] [INFO ] Invariant cache hit.
[2023-03-22 06:44:29] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 2859 ms to find 0 implicit places.
[2023-03-22 06:44:29] [INFO ] Invariant cache hit.
[2023-03-22 06:44:30] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3651 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) p3), true, (OR p3 (AND p1 p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p3 p1), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p3) p1), acceptance={} source=0 dest: 3}, { cond=(AND p3 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p3 (NOT p1)) (AND p1 p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p3 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s904 1) (EQ s923 1)), p1:(NEQ s151 1), p2:(AND (EQ s906 1) (EQ s921 1)), p0:(AND (EQ s86 1) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 688 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-12 finished in 4634 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' '!(((p0 U p1)||F(p2)))'
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Applied a total of 4 rules in 86 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-22 06:44:31] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-22 06:44:32] [INFO ] Implicit Places using invariants in 1090 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 60 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2023-03-22 06:44:32] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:44:33] [INFO ] Implicit Places using invariants in 715 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 718 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 994 transition count 716
Applied a total of 4 rules in 73 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:44:33] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-22 06:44:34] [INFO ] Implicit Places using invariants in 837 ms returned []
[2023-03-22 06:44:34] [INFO ] Invariant cache hit.
[2023-03-22 06:44:36] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2896 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4955 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(AND (EQ s818 1) (EQ s825 1)), p1:(AND (EQ s830 1) (EQ s847 1)), p0:(EQ s547 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 113 reset in 652 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-13 finished in 5745 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))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Applied a total of 4 rules in 66 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-22 06:44:37] [INFO ] Computed 441 place invariants in 1 ms
[2023-03-22 06:44:42] [INFO ] Implicit Places using invariants in 5405 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5419 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 40 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2023-03-22 06:44:42] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-22 06:44:43] [INFO ] Implicit Places using invariants in 698 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 699 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 994 transition count 716
Applied a total of 4 rules in 83 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:44:43] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-22 06:44:44] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-22 06:44:44] [INFO ] Invariant cache hit.
[2023-03-22 06:44:47] [INFO ] Implicit Places using invariants and state equation in 3524 ms returned []
Implicit Place search using SMT with State Equation took 4413 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 10730 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s181 1) (EQ s196 1)) (AND (EQ s862 1) (EQ s864 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 43 reset in 615 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-14 finished in 11415 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||X(X(p0))))) U p1))'
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 31 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2023-03-22 06:44:48] [INFO ] Computed 441 place invariants in 2 ms
[2023-03-22 06:44:49] [INFO ] Implicit Places using invariants in 833 ms returned []
[2023-03-22 06:44:49] [INFO ] Invariant cache hit.
[2023-03-22 06:44:50] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
[2023-03-22 06:44:50] [INFO ] Invariant cache hit.
[2023-03-22 06:44:52] [INFO ] Dead Transitions using invariants and state equation in 1949 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4335 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p1:(EQ s795 1), p0:(AND (EQ s829 1) (EQ s848 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 68 reset in 643 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-15 finished in 5333 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((X(p0)||(p1 U p2)))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-040A-LTLFireability-05
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Applied a total of 4 rules in 103 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-22 06:44:54] [INFO ] Computed 441 place invariants in 2 ms
[2023-03-22 06:44:55] [INFO ] Implicit Places using invariants in 572 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 595 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1000/1003 places, 720/722 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 28 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2023-03-22 06:44:55] [INFO ] Computed 440 place invariants in 1 ms
[2023-03-22 06:44:58] [INFO ] Implicit Places using invariants in 2977 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2979 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 996/1003 places, 718/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 994 transition count 716
Applied a total of 4 rules in 59 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:44:58] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:44:58] [INFO ] Implicit Places using invariants in 782 ms returned []
[2023-03-22 06:44:58] [INFO ] Invariant cache hit.
[2023-03-22 06:45:00] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2803 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 6580 ms. Remains : 994/1003 places, 716/722 transitions.
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s899 1), p1:(AND (EQ s928 1) (EQ s951 1)), p0:(EQ s276 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33445 reset in 1741 ms.
Product exploration explored 100000 steps with 33374 reset in 1961 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 821 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 06:45:06] [INFO ] Invariant cache hit.
[2023-03-22 06:45:06] [INFO ] [Real]Absence check using 438 positive place invariants in 75 ms returned sat
[2023-03-22 06:45:06] [INFO ] After 828ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:45:07] [INFO ] [Nat]Absence check using 438 positive place invariants in 175 ms returned sat
[2023-03-22 06:45:07] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:45:08] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-22 06:45:08] [INFO ] After 1337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 339 ms.
Support contains 4 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Partial Free-agglomeration rule applied 157 times.
Drop transitions removed 157 transitions
Iterating global reduction 0 with 157 rules applied. Total rules applied 157 place count 994 transition count 716
Applied a total of 157 rules in 51 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 994/994 places, 716/716 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 101233 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101233 steps, saw 96948 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:45:12] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:45:12] [INFO ] [Real]Absence check using 438 positive place invariants in 161 ms returned sat
[2023-03-22 06:45:13] [INFO ] After 1300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:45:14] [INFO ] [Nat]Absence check using 438 positive place invariants in 154 ms returned sat
[2023-03-22 06:45:15] [INFO ] After 909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:45:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 06:45:15] [INFO ] After 302ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 06:45:15] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2023-03-22 06:45:15] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2023-03-22 06:45:15] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-22 06:45:15] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-22 06:45:16] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2023-03-22 06:45:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 731 ms
[2023-03-22 06:45:16] [INFO ] After 1445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-03-22 06:45:16] [INFO ] After 3203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 195 ms.
Support contains 4 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 19 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 994/994 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 19 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2023-03-22 06:45:17] [INFO ] Invariant cache hit.
[2023-03-22 06:45:18] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2023-03-22 06:45:18] [INFO ] Invariant cache hit.
[2023-03-22 06:45:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 06:45:21] [INFO ] Implicit Places using invariants and state equation in 3276 ms returned []
Implicit Place search using SMT with State Equation took 4427 ms to find 0 implicit places.
[2023-03-22 06:45:21] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-22 06:45:21] [INFO ] Invariant cache hit.
[2023-03-22 06:45:22] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5091 ms. Remains : 994/994 places, 716/716 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 994 transition count 716
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 994 transition count 677
Applied a total of 78 rules in 93 ms. Remains 994 /994 variables (removed 0) and now considering 677/716 (removed 39) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 677 rows 994 cols
[2023-03-22 06:45:22] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:45:22] [INFO ] [Real]Absence check using 438 positive place invariants in 208 ms returned sat
[2023-03-22 06:45:23] [INFO ] After 1147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:45:23] [INFO ] [Nat]Absence check using 438 positive place invariants in 123 ms returned sat
[2023-03-22 06:45:24] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:45:25] [INFO ] After 1046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-22 06:45:25] [INFO ] After 1855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 1091 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Support contains 4 out of 994 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 19 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:45:26] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-22 06:45:28] [INFO ] Implicit Places using invariants in 1279 ms returned []
[2023-03-22 06:45:28] [INFO ] Invariant cache hit.
[2023-03-22 06:45:30] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 3147 ms to find 0 implicit places.
[2023-03-22 06:45:30] [INFO ] Invariant cache hit.
[2023-03-22 06:45:30] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3783 ms. Remains : 994/994 places, 716/716 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 p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 832 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 06:45:32] [INFO ] Invariant cache hit.
[2023-03-22 06:45:32] [INFO ] [Real]Absence check using 438 positive place invariants in 150 ms returned sat
[2023-03-22 06:45:33] [INFO ] After 1144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:45:33] [INFO ] [Nat]Absence check using 438 positive place invariants in 67 ms returned sat
[2023-03-22 06:45:35] [INFO ] After 1210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:45:35] [INFO ] After 1403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-22 06:45:35] [INFO ] After 1956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 191 ms.
Support contains 4 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Partial Free-agglomeration rule applied 157 times.
Drop transitions removed 157 transitions
Iterating global reduction 0 with 157 rules applied. Total rules applied 157 place count 994 transition count 716
Applied a total of 157 rules in 39 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 994/994 places, 716/716 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 125812 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125812 steps, saw 120189 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:45:39] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:45:39] [INFO ] [Real]Absence check using 438 positive place invariants in 77 ms returned sat
[2023-03-22 06:45:39] [INFO ] After 828ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:45:40] [INFO ] [Nat]Absence check using 438 positive place invariants in 64 ms returned sat
[2023-03-22 06:45:41] [INFO ] After 650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:45:41] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 06:45:41] [INFO ] After 400ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 06:45:41] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2023-03-22 06:45:41] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-22 06:45:42] [INFO ] Deduced a trap composed of 6 places in 408 ms of which 1 ms to minimize.
[2023-03-22 06:45:42] [INFO ] Deduced a trap composed of 7 places in 344 ms of which 0 ms to minimize.
[2023-03-22 06:45:42] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-22 06:45:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1388 ms
[2023-03-22 06:45:43] [INFO ] After 2143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 341 ms.
[2023-03-22 06:45:43] [INFO ] After 3725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 199 ms.
Support contains 4 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 19 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 994/994 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 21 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2023-03-22 06:45:43] [INFO ] Invariant cache hit.
[2023-03-22 06:45:44] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-22 06:45:44] [INFO ] Invariant cache hit.
[2023-03-22 06:45:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 06:45:47] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 3288 ms to find 0 implicit places.
[2023-03-22 06:45:47] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 06:45:47] [INFO ] Invariant cache hit.
[2023-03-22 06:45:47] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4064 ms. Remains : 994/994 places, 716/716 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 994 transition count 716
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 994 transition count 677
Applied a total of 78 rules in 90 ms. Remains 994 /994 variables (removed 0) and now considering 677/716 (removed 39) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 677 rows 994 cols
[2023-03-22 06:45:47] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-22 06:45:48] [INFO ] [Real]Absence check using 438 positive place invariants in 95 ms returned sat
[2023-03-22 06:45:48] [INFO ] After 945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:45:49] [INFO ] [Nat]Absence check using 438 positive place invariants in 65 ms returned sat
[2023-03-22 06:45:49] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:45:50] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-22 06:45:50] [INFO ] After 1224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 934 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 33256 reset in 1812 ms.
Product exploration explored 100000 steps with 33416 reset in 1835 ms.
Support contains 4 out of 994 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 31 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
// Phase 1: matrix 716 rows 994 cols
[2023-03-22 06:45:55] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-22 06:45:56] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-22 06:45:56] [INFO ] Invariant cache hit.
[2023-03-22 06:45:58] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
[2023-03-22 06:45:58] [INFO ] Invariant cache hit.
[2023-03-22 06:45:58] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2917 ms. Remains : 994/994 places, 716/716 transitions.
Treatment of property ShieldPPPt-PT-040A-LTLFireability-05 finished in 65138 ms.
[2023-03-22 06:45:59] [INFO ] Flatten gal took : 75 ms
[2023-03-22 06:45:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 06:45:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 722 transitions and 2884 arcs took 8 ms.
Total runtime 216569 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1705/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-040A-LTLFireability-05

BK_STOP 1679467560236

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ShieldPPPt-PT-040A-LTLFireability-05
ltl formula formula --ltl=/tmp/1705/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 1003 places, 722 transitions and 2884 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1705/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1705/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1705/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1705/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ShieldPPPt-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 ShieldPPPt-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-167903717300660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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