About the Execution of LTSMin+red for FMS-PT-20000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
318.363 | 9046.00 | 16706.00 | 458.10 | FTFTTTFFFFTFTFFF | normal |
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.r169-tall-167838855600283.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 FMS-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855600283
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.2K Feb 25 19:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 19:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 19:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 19:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 19:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 19:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 19:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 19:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K Mar 5 18:22 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 FMS-PT-20000-LTLCardinality-00
FORMULA_NAME FMS-PT-20000-LTLCardinality-01
FORMULA_NAME FMS-PT-20000-LTLCardinality-02
FORMULA_NAME FMS-PT-20000-LTLCardinality-03
FORMULA_NAME FMS-PT-20000-LTLCardinality-04
FORMULA_NAME FMS-PT-20000-LTLCardinality-05
FORMULA_NAME FMS-PT-20000-LTLCardinality-06
FORMULA_NAME FMS-PT-20000-LTLCardinality-07
FORMULA_NAME FMS-PT-20000-LTLCardinality-08
FORMULA_NAME FMS-PT-20000-LTLCardinality-09
FORMULA_NAME FMS-PT-20000-LTLCardinality-10
FORMULA_NAME FMS-PT-20000-LTLCardinality-11
FORMULA_NAME FMS-PT-20000-LTLCardinality-12
FORMULA_NAME FMS-PT-20000-LTLCardinality-13
FORMULA_NAME FMS-PT-20000-LTLCardinality-14
FORMULA_NAME FMS-PT-20000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678503379009
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-20000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 02:56:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:56:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:56:20] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-11 02:56:20] [INFO ] Transformed 22 places.
[2023-03-11 02:56:20] [INFO ] Transformed 20 transitions.
[2023-03-11 02:56:20] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FMS-PT-20000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 9 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 02:56:20] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-11 02:56:21] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-11 02:56:21] [INFO ] Invariant cache hit.
[2023-03-11 02:56:21] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-11 02:56:21] [INFO ] Invariant cache hit.
[2023-03-11 02:56:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 18 out of 22 places after structural reductions.
[2023-03-11 02:56:21] [INFO ] Flatten gal took : 18 ms
[2023-03-11 02:56:21] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:56:21] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 20001 steps, including 0 resets, run finished after 199 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) 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 14) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 02:56:21] [INFO ] Invariant cache hit.
[2023-03-11 02:56:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 02:56:21] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-11 02:56:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 02:56:21] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-11 02:56:21] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-11 02:56:21] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 8 different solutions.
Finished Parikh walk after 124 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 9 properties in 1226 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA FMS-PT-20000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&X(G(p2))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-11 02:56:23] [INFO ] Invariant cache hit.
[2023-03-11 02:56:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 02:56:23] [INFO ] Invariant cache hit.
[2023-03-11 02:56:23] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-11 02:56:23] [INFO ] Invariant cache hit.
[2023-03-11 02:56:23] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} 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=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s15 s3), p0:(AND (LEQ s10 s13) (LEQ s3 s6)), p2:(LEQ s3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 3 ms.
FORMULA FMS-PT-20000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLCardinality-00 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(G(p1) U p2)))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 7 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 17 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 17 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 17 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 15 transition count 14
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 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 17 place count 12 transition count 12
Applied a total of 17 rules in 9 ms. Remains 12 /22 variables (removed 10) and now considering 12/20 (removed 8) transitions.
[2023-03-11 02:56:23] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 12 cols
[2023-03-11 02:56:23] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 02:56:23] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 02:56:23] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-11 02:56:23] [INFO ] Invariant cache hit.
[2023-03-11 02:56:23] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-11 02:56:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:56:23] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-11 02:56:23] [INFO ] Invariant cache hit.
[2023-03-11 02:56:24] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 12/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s11), p2:(OR (LEQ s7 s8) (LEQ 3 s4)), p1:(LEQ s5 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-20000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLCardinality-02 finished in 318 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(p0)||(p1 U (p2||G(p1)))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 9 transition count 10
Applied a total of 23 rules in 11 ms. Remains 9 /22 variables (removed 13) and now considering 10/20 (removed 10) transitions.
[2023-03-11 02:56:24] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2023-03-11 02:56:24] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 02:56:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 02:56:24] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2023-03-11 02:56:24] [INFO ] Invariant cache hit.
[2023-03-11 02:56:24] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-11 02:56:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:56:24] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2023-03-11 02:56:24] [INFO ] Invariant cache hit.
[2023-03-11 02:56:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 10/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 9/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s8 s5), p1:(GT 3 s3), p2:(AND (NOT (OR (LEQ 3 s3) (LEQ s8 s5))) (GT 3 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-20000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLCardinality-06 finished in 179 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(G(p0))||G(p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 02:56:24] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 02:56:24] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 02:56:24] [INFO ] Invariant cache hit.
[2023-03-11 02:56:24] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-11 02:56:24] [INFO ] Invariant cache hit.
[2023-03-11 02:56:24] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ s8 s16), p0:(LEQ 3 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 301 ms.
Stack based approach found an accepted trace after 480 steps with 0 reset with depth 481 and stack size 481 in 2 ms.
FORMULA FMS-PT-20000-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-20000-LTLCardinality-07 finished in 514 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)||(p1 U G(p2))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 20 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 17 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 14 transition count 12
Applied a total of 16 rules in 3 ms. Remains 14 /22 variables (removed 8) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 14 cols
[2023-03-11 02:56:24] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 02:56:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 02:56:24] [INFO ] Invariant cache hit.
[2023-03-11 02:56:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-11 02:56:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:56:25] [INFO ] Invariant cache hit.
[2023-03-11 02:56:25] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 14/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s5 s8), p1:(LEQ 2 s13), p2:(LEQ s3 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 18 in 1 ms.
FORMULA FMS-PT-20000-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-20000-LTLCardinality-08 finished in 461 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(F(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 02:56:25] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 02:56:25] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 02:56:25] [INFO ] Invariant cache hit.
[2023-03-11 02:56:25] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-11 02:56:25] [INFO ] Invariant cache hit.
[2023-03-11 02:56:25] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 s12), p0:(LEQ 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 344 reset in 205 ms.
Stack based approach found an accepted trace after 1309 steps with 2 reset with depth 217 and stack size 217 in 3 ms.
FORMULA FMS-PT-20000-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-20000-LTLCardinality-09 finished in 421 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)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-11 02:56:25] [INFO ] Invariant cache hit.
[2023-03-11 02:56:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 02:56:25] [INFO ] Invariant cache hit.
[2023-03-11 02:56:25] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-11 02:56:25] [INFO ] Invariant cache hit.
[2023-03-11 02:56:25] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s18), p1:(LEQ 2 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Stack based approach found an accepted trace after 158 steps with 0 reset with depth 159 and stack size 159 in 1 ms.
FORMULA FMS-PT-20000-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-20000-LTLCardinality-11 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 13 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 9 transition count 9
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 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 6 transition count 7
Applied a total of 28 rules in 4 ms. Remains 6 /22 variables (removed 16) and now considering 7/20 (removed 13) transitions.
[2023-03-11 02:56:26] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2023-03-11 02:56:26] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 02:56:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 02:56:26] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2023-03-11 02:56:26] [INFO ] Invariant cache hit.
[2023-03-11 02:56:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-11 02:56:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:56:26] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2023-03-11 02:56:26] [INFO ] Invariant cache hit.
[2023-03-11 02:56:26] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/22 places, 7/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-20000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLCardinality-13 finished in 167 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||X((p1||F(p2)))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 02:56:26] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 02:56:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 02:56:26] [INFO ] Invariant cache hit.
[2023-03-11 02:56:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-11 02:56:26] [INFO ] Invariant cache hit.
[2023-03-11 02:56:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s3 s13), p1:(GT s12 s19), p2:(GT s19 s1)], 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]]
Product exploration explored 100000 steps with 5055 reset in 126 ms.
Stack based approach found an accepted trace after 22 steps with 1 reset with depth 12 and stack size 12 in 0 ms.
FORMULA FMS-PT-20000-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-20000-LTLCardinality-14 finished in 386 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&&X((p1||X(p2))))))||F(!p1)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-11 02:56:26] [INFO ] Invariant cache hit.
[2023-03-11 02:56:26] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 02:56:26] [INFO ] Invariant cache hit.
[2023-03-11 02:56:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-11 02:56:26] [INFO ] Invariant cache hit.
[2023-03-11 02:56:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 100 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : FMS-PT-20000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s14 s15), p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 135 reset in 131 ms.
Stack based approach found an accepted trace after 287 steps with 0 reset with depth 288 and stack size 288 in 1 ms.
FORMULA FMS-PT-20000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-20000-LTLCardinality-15 finished in 350 ms.
All properties solved by simple procedures.
Total runtime 6623 ms.
ITS solved all properties within timeout
BK_STOP 1678503388055
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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="FMS-PT-20000"
export BK_EXAMINATION="LTLCardinality"
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 FMS-PT-20000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855600283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-20000.tgz
mv FMS-PT-20000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;