fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r007-oct2-167813595500435
Last Updated
May 14, 2023

About the Execution of LoLa+red for AutoFlight-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
413.588 15906.00 33832.00 82.20 FTFTTTTFFFFTFFTF 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.r007-oct2-167813595500435.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 lolaxred
Input is AutoFlight-PT-05a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595500435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.1K Feb 25 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 18:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 18:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 36K 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 AutoFlight-PT-05a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678348736341

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:59:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 07:59:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:59:00] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-09 07:59:00] [INFO ] Transformed 132 places.
[2023-03-09 07:59:00] [INFO ] Transformed 130 transitions.
[2023-03-09 07:59:00] [INFO ] Found NUPN structural information;
[2023-03-09 07:59:00] [INFO ] Parsed PT model containing 132 places and 130 transitions and 420 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA AutoFlight-PT-05a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 105/105 transitions.
Applied a total of 0 rules in 23 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2023-03-09 07:59:00] [INFO ] Computed 34 place invariants in 33 ms
[2023-03-09 07:59:01] [INFO ] Implicit Places using invariants in 534 ms returned [14, 21, 35, 38, 44, 47, 50, 77, 99, 105, 111, 117, 123, 129, 131]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 605 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/132 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 101
Applied a total of 8 rules in 10 ms. Remains 113 /117 variables (removed 4) and now considering 101/105 (removed 4) transitions.
// Phase 1: matrix 101 rows 113 cols
[2023-03-09 07:59:01] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-09 07:59:01] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-09 07:59:01] [INFO ] Invariant cache hit.
[2023-03-09 07:59:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 07:59:01] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/132 places, 101/105 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 868 ms. Remains : 113/132 places, 101/105 transitions.
Support contains 32 out of 113 places after structural reductions.
[2023-03-09 07:59:01] [INFO ] Flatten gal took : 28 ms
[2023-03-09 07:59:01] [INFO ] Flatten gal took : 19 ms
[2023-03-09 07:59:01] [INFO ] Input system was already deterministic with 101 transitions.
Support contains 30 out of 113 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 305 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 18) seen :15
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 07:59:02] [INFO ] Invariant cache hit.
[2023-03-09 07:59:02] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 07:59:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2023-03-09 07:59:02] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA AutoFlight-PT-05a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 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' '!(G(F(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 113 transition count 82
Reduce places removed 19 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 23 rules applied. Total rules applied 42 place count 94 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 90 transition count 78
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 46 place count 90 transition count 66
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 70 place count 78 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 76 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 76 transition count 64
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 75 transition count 63
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 75 transition count 63
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 74 transition count 62
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 74 transition count 62
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 73 transition count 61
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 73 transition count 61
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 72 transition count 60
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 72 transition count 60
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 102 place count 62 transition count 50
Applied a total of 102 rules in 43 ms. Remains 62 /113 variables (removed 51) and now considering 50/101 (removed 51) transitions.
// Phase 1: matrix 50 rows 62 cols
[2023-03-09 07:59:02] [INFO ] Computed 19 place invariants in 8 ms
[2023-03-09 07:59:02] [INFO ] Implicit Places using invariants in 128 ms returned [5, 18, 23, 24, 25, 26, 27, 28]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 129 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/113 places, 50/101 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 54 transition count 46
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 50 transition count 41
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 45 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 44 transition count 40
Applied a total of 20 rules in 4 ms. Remains 44 /54 variables (removed 10) and now considering 40/50 (removed 10) transitions.
// Phase 1: matrix 40 rows 44 cols
[2023-03-09 07:59:02] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-09 07:59:02] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 07:59:03] [INFO ] Invariant cache hit.
[2023-03-09 07:59:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 07:59:03] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/113 places, 40/101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 361 ms. Remains : 44/113 places, 40/101 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-02 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:(AND (NEQ s43 0) (NEQ s27 1))], 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 40 steps with 7 reset in 2 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-02 finished in 711 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(G(p0))||F((G(F(p2))||p1)))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 112 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 112 transition count 100
Applied a total of 2 rules in 6 ms. Remains 112 /113 variables (removed 1) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 112 cols
[2023-03-09 07:59:03] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-09 07:59:03] [INFO ] Implicit Places using invariants in 64 ms returned [26, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/113 places, 100/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 110/113 places, 100/101 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s42 0) (EQ s94 1)), p0:(OR (EQ s7 0) (EQ s87 1)), p2:(OR (EQ s42 0) (EQ s94 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 50000 reset in 386 ms.
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLCardinality-04 finished in 1174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 110 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 110 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 89
Applied a total of 24 rules in 40 ms. Remains 101 /113 variables (removed 12) and now considering 89/101 (removed 12) transitions.
// Phase 1: matrix 89 rows 101 cols
[2023-03-09 07:59:04] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-09 07:59:04] [INFO ] Implicit Places using invariants in 171 ms returned [7, 26, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 179 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 89/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 84
Applied a total of 10 rules in 17 ms. Remains 93 /98 variables (removed 5) and now considering 84/89 (removed 5) transitions.
// Phase 1: matrix 84 rows 93 cols
[2023-03-09 07:59:04] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-09 07:59:04] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-09 07:59:04] [INFO ] Invariant cache hit.
[2023-03-09 07:59:05] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/113 places, 84/101 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 811 ms. Remains : 93/113 places, 84/101 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLCardinality-05 finished in 1550 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)||X(G(p1)))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 110 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 110 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 89
Applied a total of 24 rules in 48 ms. Remains 101 /113 variables (removed 12) and now considering 89/101 (removed 12) transitions.
// Phase 1: matrix 89 rows 101 cols
[2023-03-09 07:59:06] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-09 07:59:06] [INFO ] Implicit Places using invariants in 306 ms returned [7, 26, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 309 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 89/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 88
Applied a total of 2 rules in 3 ms. Remains 97 /98 variables (removed 1) and now considering 88/89 (removed 1) transitions.
// Phase 1: matrix 88 rows 97 cols
[2023-03-09 07:59:06] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-09 07:59:06] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-09 07:59:06] [INFO ] Invariant cache hit.
[2023-03-09 07:59:06] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 97/113 places, 88/101 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 740 ms. Remains : 97/113 places, 88/101 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s67 0) (EQ s30 1)), p1:(AND (NEQ s3 0) (NEQ s12 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 50000 reset in 199 ms.
Product exploration explored 100000 steps with 50000 reset in 235 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 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLCardinality-06 finished in 1700 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 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 109 transition count 65
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 74 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 73 transition count 64
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 75 place count 73 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 92 place count 62 transition count 58
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 62 transition count 54
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 101 place count 58 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 102 place count 57 transition count 53
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 103 place count 56 transition count 52
Iterating global reduction 6 with 1 rules applied. Total rules applied 104 place count 56 transition count 52
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 126 place count 45 transition count 41
Applied a total of 126 rules in 30 ms. Remains 45 /113 variables (removed 68) and now considering 41/101 (removed 60) transitions.
// Phase 1: matrix 41 rows 45 cols
[2023-03-09 07:59:07] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-09 07:59:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 07:59:07] [INFO ] Invariant cache hit.
[2023-03-09 07:59:08] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-09 07:59:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 07:59:08] [INFO ] Invariant cache hit.
[2023-03-09 07:59:08] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/113 places, 41/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 45/113 places, 41/101 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-07 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:(OR (EQ s21 1) (AND (EQ s11 0) (EQ s35 1)))], 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 12 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-07 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X(G(!p0))))&&X(F(p1)))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 110 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 110 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 89
Applied a total of 24 rules in 26 ms. Remains 101 /113 variables (removed 12) and now considering 89/101 (removed 12) transitions.
// Phase 1: matrix 89 rows 101 cols
[2023-03-09 07:59:08] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-09 07:59:08] [INFO ] Implicit Places using invariants in 112 ms returned [7, 26, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 126 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 89/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 84
Applied a total of 10 rules in 3 ms. Remains 93 /98 variables (removed 5) and now considering 84/89 (removed 5) transitions.
// Phase 1: matrix 84 rows 93 cols
[2023-03-09 07:59:08] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-09 07:59:08] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-09 07:59:08] [INFO ] Invariant cache hit.
[2023-03-09 07:59:08] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/113 places, 84/101 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 475 ms. Remains : 93/113 places, 84/101 transitions.
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), p0, p0, true]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s16 1)), p1:(OR (EQ s15 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-08 finished in 990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 110 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 110 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 89
Applied a total of 24 rules in 24 ms. Remains 101 /113 variables (removed 12) and now considering 89/101 (removed 12) transitions.
// Phase 1: matrix 89 rows 101 cols
[2023-03-09 07:59:09] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-09 07:59:09] [INFO ] Implicit Places using invariants in 314 ms returned [7, 26, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 328 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 89/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 84
Applied a total of 10 rules in 39 ms. Remains 93 /98 variables (removed 5) and now considering 84/89 (removed 5) transitions.
// Phase 1: matrix 84 rows 93 cols
[2023-03-09 07:59:09] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-09 07:59:09] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 07:59:09] [INFO ] Invariant cache hit.
[2023-03-09 07:59:09] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/113 places, 84/101 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 574 ms. Remains : 93/113 places, 84/101 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s81 0) (EQ s66 1)), p1:(AND (EQ s60 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-10 finished in 728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 109 transition count 65
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 74 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 73 transition count 64
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 75 place count 73 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 92 place count 62 transition count 58
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 62 transition count 54
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 100 place count 58 transition count 54
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 101 place count 57 transition count 53
Iterating global reduction 5 with 1 rules applied. Total rules applied 102 place count 57 transition count 53
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 126 place count 45 transition count 41
Applied a total of 126 rules in 9 ms. Remains 45 /113 variables (removed 68) and now considering 41/101 (removed 60) transitions.
// Phase 1: matrix 41 rows 45 cols
[2023-03-09 07:59:10] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-09 07:59:10] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 07:59:10] [INFO ] Invariant cache hit.
[2023-03-09 07:59:10] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-09 07:59:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 07:59:10] [INFO ] Invariant cache hit.
[2023-03-09 07:59:10] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/113 places, 41/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 45/113 places, 41/101 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5543 reset in 123 ms.
Stack based approach found an accepted trace after 232 steps with 13 reset with depth 29 and stack size 29 in 1 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-12 finished in 369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 110 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 110 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 89
Applied a total of 24 rules in 15 ms. Remains 101 /113 variables (removed 12) and now considering 89/101 (removed 12) transitions.
// Phase 1: matrix 89 rows 101 cols
[2023-03-09 07:59:10] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-09 07:59:10] [INFO ] Implicit Places using invariants in 108 ms returned [7, 26, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 108 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 89/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 84
Applied a total of 10 rules in 3 ms. Remains 93 /98 variables (removed 5) and now considering 84/89 (removed 5) transitions.
// Phase 1: matrix 84 rows 93 cols
[2023-03-09 07:59:10] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-09 07:59:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 07:59:10] [INFO ] Invariant cache hit.
[2023-03-09 07:59:10] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/113 places, 84/101 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 312 ms. Remains : 93/113 places, 84/101 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s21 0) (NEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Product exploration explored 100000 steps with 50000 reset in 261 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLCardinality-14 finished in 1250 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 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 109 transition count 64
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 73 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 72 transition count 63
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 77 place count 72 transition count 57
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 94 place count 61 transition count 57
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 99 place count 61 transition count 52
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 104 place count 56 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 55 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 55 transition count 51
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 128 place count 44 transition count 40
Applied a total of 128 rules in 6 ms. Remains 44 /113 variables (removed 69) and now considering 40/101 (removed 61) transitions.
// Phase 1: matrix 40 rows 44 cols
[2023-03-09 07:59:11] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-09 07:59:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 07:59:11] [INFO ] Invariant cache hit.
[2023-03-09 07:59:11] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-09 07:59:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:59:11] [INFO ] Invariant cache hit.
[2023-03-09 07:59:11] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/113 places, 40/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 44/113 places, 40/101 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-15 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:(AND (NEQ s36 0) (NEQ s25 1))], 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 22 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-15 finished in 389 ms.
All properties solved by simple procedures.
Total runtime 11786 ms.
ITS solved all properties within timeout

BK_STOP 1678348752247

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="AutoFlight-PT-05a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AutoFlight-PT-05a, 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 r007-oct2-167813595500435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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