About the Execution of LoLa+red for AirplaneLD-PT-0500
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
942.216 | 109004.00 | 144171.00 | 44.50 | TTFFFTFTTTFFTTTF | 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-167813595300283.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 AirplaneLD-PT-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595300283
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 310K Feb 26 11:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 26 11:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 222K Feb 26 11:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 11:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 167K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 428K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 410K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 478K Feb 26 12:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 26 12:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 381K Feb 26 12:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Feb 26 12:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.2M 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 AirplaneLD-PT-0500-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678345682276
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=AirplaneLD-PT-0500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:08:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 07:08:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:08:04] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2023-03-09 07:08:04] [INFO ] Transformed 3519 places.
[2023-03-09 07:08:04] [INFO ] Transformed 4008 transitions.
[2023-03-09 07:08:04] [INFO ] Parsed PT model containing 3519 places and 4008 transitions and 15278 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 78 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1502 places and 0 transitions.
FORMULA AirplaneLD-PT-0500-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1517 out of 2017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2017/2017 places, 4008/4008 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2016 transition count 4008
Discarding 496 places :
Symmetric choice reduction at 1 with 496 rule applications. Total rules 497 place count 1520 transition count 3512
Iterating global reduction 1 with 496 rules applied. Total rules applied 993 place count 1520 transition count 3512
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 496 transitions.
Iterating post reduction 1 with 496 rules applied. Total rules applied 1489 place count 1520 transition count 3016
Applied a total of 1489 rules in 117 ms. Remains 1520 /2017 variables (removed 497) and now considering 3016/4008 (removed 992) transitions.
// Phase 1: matrix 3016 rows 1520 cols
[2023-03-09 07:08:05] [INFO ] Computed 2 place invariants in 253 ms
[2023-03-09 07:08:05] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-09 07:08:05] [INFO ] Invariant cache hit.
[2023-03-09 07:08:06] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
[2023-03-09 07:08:06] [INFO ] Invariant cache hit.
[2023-03-09 07:08:07] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1520/2017 places, 3016/4008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3091 ms. Remains : 1520/2017 places, 3016/4008 transitions.
Support contains 1517 out of 1520 places after structural reductions.
[2023-03-09 07:08:08] [INFO ] Flatten gal took : 202 ms
[2023-03-09 07:08:08] [INFO ] Flatten gal took : 106 ms
[2023-03-09 07:08:08] [INFO ] Input system was already deterministic with 3016 transitions.
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 979 ms. (steps per millisecond=10 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 07:08:09] [INFO ] Invariant cache hit.
[2023-03-09 07:08:10] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 07:08:10] [INFO ] After 1113ms SMT Verify possible using all constraints in real 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 AirplaneLD-PT-0500-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1520 stabilizing places and 3016 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1520 transition count 3016
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA AirplaneLD-PT-0500-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 3016/3016 transitions.
Graph (complete) has 3026 edges and 1520 vertex of which 1518 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1499 places :
Symmetric choice reduction at 0 with 1499 rule applications. Total rules 1500 place count 19 transition count 1517
Iterating global reduction 0 with 1499 rules applied. Total rules applied 2999 place count 19 transition count 1517
Ensure Unique test removed 1499 transitions
Reduce isomorphic transitions removed 1499 transitions.
Iterating post reduction 0 with 1499 rules applied. Total rules applied 4498 place count 19 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4498 place count 19 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4500 place count 18 transition count 17
Applied a total of 4500 rules in 73 ms. Remains 18 /1520 variables (removed 1502) and now considering 17/3016 (removed 2999) transitions.
// Phase 1: matrix 17 rows 18 cols
[2023-03-09 07:08:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:08:11] [INFO ] Implicit Places using invariants in 24 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/1520 places, 17/3016 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 17/1520 places, 17/3016 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLCardinality-03 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 s11 (ADD s0 s1))], 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 5 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0500-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLCardinality-03 finished in 378 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||G(p1))))))'
Support contains 3 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3016/3016 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1518 transition count 3016
Discarding 1499 places :
Symmetric choice reduction at 1 with 1499 rule applications. Total rules 1501 place count 19 transition count 1517
Iterating global reduction 1 with 1499 rules applied. Total rules applied 3000 place count 19 transition count 1517
Ensure Unique test removed 1499 transitions
Reduce isomorphic transitions removed 1499 transitions.
Iterating post reduction 1 with 1499 rules applied. Total rules applied 4499 place count 19 transition count 18
Applied a total of 4499 rules in 53 ms. Remains 19 /1520 variables (removed 1501) and now considering 18/3016 (removed 2998) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-09 07:08:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:08:11] [INFO ] Implicit Places using invariants in 45 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/1520 places, 18/3016 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 18/1520 places, 18/3016 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(LEQ 1 s11), p0:(LEQ s14 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLCardinality-04 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 1003 out of 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 3016/3016 transitions.
Discarding 500 places :
Symmetric choice reduction at 0 with 500 rule applications. Total rules 500 place count 1020 transition count 2516
Iterating global reduction 0 with 500 rules applied. Total rules applied 1000 place count 1020 transition count 2516
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 1500 place count 1020 transition count 2016
Applied a total of 1500 rules in 59 ms. Remains 1020 /1520 variables (removed 500) and now considering 2016/3016 (removed 1000) transitions.
// Phase 1: matrix 2016 rows 1020 cols
[2023-03-09 07:08:11] [INFO ] Computed 2 place invariants in 97 ms
[2023-03-09 07:08:12] [INFO ] Implicit Places using invariants in 302 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 308 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1019/1520 places, 2016/3016 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1019 transition count 2015
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1018 transition count 2015
Applied a total of 2 rules in 32 ms. Remains 1018 /1019 variables (removed 1) and now considering 2015/2016 (removed 1) transitions.
// Phase 1: matrix 2015 rows 1018 cols
[2023-03-09 07:08:12] [INFO ] Computed 1 place invariants in 105 ms
[2023-03-09 07:08:12] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-09 07:08:12] [INFO ] Invariant cache hit.
[2023-03-09 07:08:13] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1018/1520 places, 2015/3016 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1344 ms. Remains : 1018/1520 places, 2015/3016 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GT 1 s1007) (LEQ 1 (ADD s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 56890 steps with 28339 reset in 10001 ms.
Product exploration timeout after 56790 steps with 28290 reset in 10010 ms.
Computed a total of 1018 stabilizing places and 2015 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1018 transition count 2015
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 455 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 5 factoid took 531 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
[2023-03-09 07:08:35] [INFO ] Invariant cache hit.
[2023-03-09 07:08:45] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-09 07:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:08:46] [INFO ] [Real]Absence check using state equation in 1153 ms returned sat
[2023-03-09 07:08:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:08:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-09 07:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:08:56] [INFO ] [Nat]Absence check using state equation in 1289 ms returned sat
[2023-03-09 07:08:56] [INFO ] Computed and/alt/rep : 1005/2009/1005 causal constraints (skipped 2 transitions) in 182 ms.
[2023-03-09 07:08:56] [INFO ] Added : 1 causal constraints over 1 iterations in 531 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1001 out of 1018 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 2015/2015 transitions.
Applied a total of 0 rules in 31 ms. Remains 1018 /1018 variables (removed 0) and now considering 2015/2015 (removed 0) transitions.
[2023-03-09 07:08:56] [INFO ] Invariant cache hit.
[2023-03-09 07:08:57] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-09 07:08:57] [INFO ] Invariant cache hit.
[2023-03-09 07:08:57] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-09 07:08:58] [INFO ] Redundant transitions in 214 ms returned []
[2023-03-09 07:08:58] [INFO ] Invariant cache hit.
[2023-03-09 07:08:58] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1780 ms. Remains : 1018/1018 places, 2015/2015 transitions.
Computed a total of 1018 stabilizing places and 2015 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1018 transition count 2015
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 258 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-09 07:09:00] [INFO ] Invariant cache hit.
[2023-03-09 07:09:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-09 07:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:09:10] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2023-03-09 07:09:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:09:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-09 07:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:09:20] [INFO ] [Nat]Absence check using state equation in 1341 ms returned sat
[2023-03-09 07:09:20] [INFO ] Computed and/alt/rep : 1005/2009/1005 causal constraints (skipped 2 transitions) in 103 ms.
[2023-03-09 07:09:21] [INFO ] Added : 1 causal constraints over 1 iterations in 411 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Product exploration timeout after 62490 steps with 31119 reset in 10011 ms.
Product exploration timeout after 61490 steps with 30619 reset in 10001 ms.
Support contains 1001 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 2015/2015 transitions.
Graph (complete) has 2023 edges and 1018 vertex of which 1011 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 1010 transition count 2009
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1010 transition count 2009
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 1010 transition count 2008
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1010 transition count 2007
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1009 transition count 2007
Applied a total of 6 rules in 31 ms. Remains 1009 /1018 variables (removed 9) and now considering 2007/2015 (removed 8) transitions.
// Phase 1: matrix 2007 rows 1009 cols
[2023-03-09 07:09:41] [INFO ] Computed 0 place invariants in 125 ms
[2023-03-09 07:09:41] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-09 07:09:41] [INFO ] Invariant cache hit.
[2023-03-09 07:09:42] [INFO ] Implicit Places using invariants and state equation in 754 ms returned [1008]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1058 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1008/1018 places, 2007/2015 transitions.
Applied a total of 0 rules in 56 ms. Remains 1008 /1008 variables (removed 0) and now considering 2007/2007 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1148 ms. Remains : 1008/1018 places, 2007/2015 transitions.
Treatment of property AirplaneLD-PT-0500-LTLCardinality-07 finished in 91039 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)&&F(G(p1)))))'
Support contains 5 out of 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 3016/3016 transitions.
Graph (complete) has 3026 edges and 1520 vertex of which 1519 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1497 places :
Symmetric choice reduction at 0 with 1497 rule applications. Total rules 1498 place count 22 transition count 1519
Iterating global reduction 0 with 1497 rules applied. Total rules applied 2995 place count 22 transition count 1519
Ensure Unique test removed 1497 transitions
Reduce isomorphic transitions removed 1497 transitions.
Iterating post reduction 0 with 1497 rules applied. Total rules applied 4492 place count 22 transition count 22
Applied a total of 4492 rules in 23 ms. Remains 22 /1520 variables (removed 1498) and now considering 22/3016 (removed 2994) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-09 07:09:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:09:42] [INFO ] Implicit Places using invariants in 36 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/1520 places, 22/3016 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61 ms. Remains : 21/1520 places, 22/3016 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s3 s12), p1:(AND (GT 3 s2) (LEQ s0 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13010 reset in 129 ms.
Product exploration explored 100000 steps with 13000 reset in 141 ms.
Computed a total of 21 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 303 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 20 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 413 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-09 07:09:44] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 07:09:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 07:09:44] [INFO ] Invariant cache hit.
[2023-03-09 07:09:44] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-09 07:09:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 07:09:44] [INFO ] Invariant cache hit.
[2023-03-09 07:09:44] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 21 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 12 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 p1), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 390 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 12983 reset in 103 ms.
Product exploration explored 100000 steps with 12988 reset in 98 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-09 07:09:46] [INFO ] Invariant cache hit.
[2023-03-09 07:09:46] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 07:09:46] [INFO ] Invariant cache hit.
[2023-03-09 07:09:46] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-09 07:09:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:09:46] [INFO ] Invariant cache hit.
[2023-03-09 07:09:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 21/21 places, 22/22 transitions.
Treatment of property AirplaneLD-PT-0500-LTLCardinality-08 finished in 3554 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((X(G(p0))&&F(p1))))'
Support contains 5 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3016/3016 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1518 transition count 3016
Discarding 1499 places :
Symmetric choice reduction at 1 with 1499 rule applications. Total rules 1501 place count 19 transition count 1517
Iterating global reduction 1 with 1499 rules applied. Total rules applied 3000 place count 19 transition count 1517
Ensure Unique test removed 1499 transitions
Reduce isomorphic transitions removed 1499 transitions.
Iterating post reduction 1 with 1499 rules applied. Total rules applied 4499 place count 19 transition count 18
Applied a total of 4499 rules in 17 ms. Remains 19 /1520 variables (removed 1501) and now considering 18/3016 (removed 2998) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-09 07:09:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:09:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 07:09:46] [INFO ] Invariant cache hit.
[2023-03-09 07:09:46] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-09 07:09:46] [INFO ] Invariant cache hit.
[2023-03-09 07:09:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/1520 places, 18/3016 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 19/1520 places, 18/3016 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : AirplaneLD-PT-0500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GT 3 s3) (GT s2 1)) (GT s1 s12)), p0:(GT 1 s9)], 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]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLCardinality-10 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3016/3016 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1518 transition count 3016
Discarding 1499 places :
Symmetric choice reduction at 1 with 1499 rule applications. Total rules 1501 place count 19 transition count 1517
Iterating global reduction 1 with 1499 rules applied. Total rules applied 3000 place count 19 transition count 1517
Ensure Unique test removed 1499 transitions
Reduce isomorphic transitions removed 1499 transitions.
Iterating post reduction 1 with 1499 rules applied. Total rules applied 4499 place count 19 transition count 18
Applied a total of 4499 rules in 26 ms. Remains 19 /1520 variables (removed 1501) and now considering 18/3016 (removed 2998) transitions.
[2023-03-09 07:09:46] [INFO ] Invariant cache hit.
[2023-03-09 07:09:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 07:09:46] [INFO ] Invariant cache hit.
[2023-03-09 07:09:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-09 07:09:46] [INFO ] Invariant cache hit.
[2023-03-09 07:09:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/1520 places, 18/3016 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 19/1520 places, 18/3016 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s2), p1:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLCardinality-11 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 3 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3016/3016 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1518 transition count 3016
Discarding 1498 places :
Symmetric choice reduction at 1 with 1498 rule applications. Total rules 1500 place count 20 transition count 1518
Iterating global reduction 1 with 1498 rules applied. Total rules applied 2998 place count 20 transition count 1518
Ensure Unique test removed 1498 transitions
Reduce isomorphic transitions removed 1498 transitions.
Iterating post reduction 1 with 1498 rules applied. Total rules applied 4496 place count 20 transition count 20
Applied a total of 4496 rules in 16 ms. Remains 20 /1520 variables (removed 1500) and now considering 20/3016 (removed 2996) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-09 07:09:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:09:47] [INFO ] Implicit Places using invariants in 19 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/1520 places, 20/3016 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 19/1520 places, 20/3016 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(GT 1 s16), p1:(GT s8 s5)], 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 25868 reset in 125 ms.
Product exploration explored 100000 steps with 25839 reset in 108 ms.
Computed a total of 19 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0500-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLCardinality-12 finished in 650 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 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 3016/3016 transitions.
Graph (complete) has 3026 edges and 1520 vertex of which 1519 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1498 places :
Symmetric choice reduction at 0 with 1498 rule applications. Total rules 1499 place count 21 transition count 1518
Iterating global reduction 0 with 1498 rules applied. Total rules applied 2997 place count 21 transition count 1518
Ensure Unique test removed 1498 transitions
Reduce isomorphic transitions removed 1498 transitions.
Iterating post reduction 0 with 1498 rules applied. Total rules applied 4495 place count 21 transition count 20
Applied a total of 4495 rules in 54 ms. Remains 21 /1520 variables (removed 1499) and now considering 20/3016 (removed 2996) transitions.
// Phase 1: matrix 20 rows 21 cols
[2023-03-09 07:09:47] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:09:47] [INFO ] Implicit Places using invariants in 45 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/1520 places, 20/3016 transitions.
Graph (complete) has 19 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 18 transition count 18
Applied a total of 3 rules in 13 ms. Remains 18 /20 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-03-09 07:09:47] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 07:09:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-09 07:09:47] [INFO ] Invariant cache hit.
[2023-03-09 07:09:47] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/1520 places, 18/3016 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 154 ms. Remains : 18/1520 places, 18/3016 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s7 s0)], 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 14374 reset in 65 ms.
Product exploration explored 100000 steps with 14378 reset in 71 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 287 steps, including 42 resets, run visited all 1 properties in 2 ms. (steps per millisecond=143 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 07:09:48] [INFO ] Invariant cache hit.
[2023-03-09 07:09:48] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 07:09:48] [INFO ] Invariant cache hit.
[2023-03-09 07:09:48] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-09 07:09:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 07:09:48] [INFO ] Invariant cache hit.
[2023-03-09 07:09:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 18/18 places, 18/18 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14401 reset in 59 ms.
Product exploration explored 100000 steps with 14438 reset in 112 ms.
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 07:09:49] [INFO ] Invariant cache hit.
[2023-03-09 07:09:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 07:09:49] [INFO ] Invariant cache hit.
[2023-03-09 07:09:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-09 07:09:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:09:49] [INFO ] Invariant cache hit.
[2023-03-09 07:09:49] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 18/18 places, 18/18 transitions.
Treatment of property AirplaneLD-PT-0500-LTLCardinality-13 finished in 1920 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 3 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3016/3016 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1518 transition count 3016
Discarding 1498 places :
Symmetric choice reduction at 1 with 1498 rule applications. Total rules 1500 place count 20 transition count 1518
Iterating global reduction 1 with 1498 rules applied. Total rules applied 2998 place count 20 transition count 1518
Ensure Unique test removed 1498 transitions
Reduce isomorphic transitions removed 1498 transitions.
Iterating post reduction 1 with 1498 rules applied. Total rules applied 4496 place count 20 transition count 20
Applied a total of 4496 rules in 16 ms. Remains 20 /1520 variables (removed 1500) and now considering 20/3016 (removed 2996) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-09 07:09:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:09:49] [INFO ] Implicit Places using invariants in 23 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/1520 places, 20/3016 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 19/1520 places, 20/3016 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLCardinality-15 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 (GT 1 s10) (GT s18 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 44 steps with 15 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLCardinality-15 finished in 128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-09 07:09:50] [INFO ] Flatten gal took : 106 ms
[2023-03-09 07:09:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-09 07:09:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1520 places, 3016 transitions and 7540 arcs took 20 ms.
Total runtime 106274 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AirplaneLD-PT-0500
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLCardinality
FORMULA AirplaneLD-PT-0500-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0500-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0500-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678345791280
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 13 (type SKEL/SRCH) for 3 AirplaneLD-PT-0500-LTLCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 13 (type SKEL/SRCH) for AirplaneLD-PT-0500-LTLCardinality-08
lola: result : true
lola: markings : 215
lola: fired transitions : 326
lola: time used : 0.000000
lola: memory pages used : 1
lola: Rule S: 0 transitions removed,0 places removed
lola: planning for (null) stopped (result already fixed).
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 14 (type SKEL/SRCH) for 3 AirplaneLD-PT-0500-LTLCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 14 (type SKEL/SRCH) for AirplaneLD-PT-0500-LTLCardinality-08
lola: result : true
lola: markings : 141
lola: fired transitions : 188
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 15 (type SKEL/SRCH) for 10 AirplaneLD-PT-0500-LTLCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 15 (type SKEL/SRCH) for AirplaneLD-PT-0500-LTLCardinality-13
lola: result : true
lola: markings : 89
lola: fired transitions : 124
lola: time used : 0.000000
lola: memory pages used : 1
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 16 (type SKEL/SRCH) for 0 AirplaneLD-PT-0500-LTLCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 16 (type SKEL/SRCH) for AirplaneLD-PT-0500-LTLCardinality-07
lola: result : true
lola: markings : 213
lola: fired transitions : 288
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-0500-LTLCardinality-07: LTL true skeleton: LTL model checker
AirplaneLD-PT-0500-LTLCardinality-08: CONJ true CONJ
AirplaneLD-PT-0500-LTLCardinality-13: LTL true skeleton: LTL model checker
Time elapsed: 1 secs. Pages in use: 1
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="AirplaneLD-PT-0500"
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 AirplaneLD-PT-0500, 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-167813595300283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0500.tgz
mv AirplaneLD-PT-0500 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 ;