fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r240-smll-165303241300060
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SmallOperatingSystem-PT-MT0032DC0016

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
283.180 15751.00 28272.00 353.80 TFFFFFFFFFTTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241300060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmallOperatingSystem-PT-MT0032DC0016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241300060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.4K Apr 30 10:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 10:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 10:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 10:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K May 9 09:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 09:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 09:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 09:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 09:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 13 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 8.2K May 10 09:34 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 SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653039727203

Running Version 202205111006
[2022-05-20 09:42:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 09:42:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:42:09] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2022-05-20 09:42:09] [INFO ] Transformed 9 places.
[2022-05-20 09:42:09] [INFO ] Transformed 8 transitions.
[2022-05-20 09:42:09] [INFO ] Parsed PT model containing 9 places and 8 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 12 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:42:09] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-20 09:42:09] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:42:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:42:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:42:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:42:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2022-05-20 09:42:09] [INFO ] Flatten gal took : 21 ms
[2022-05-20 09:42:09] [INFO ] Flatten gal took : 5 ms
[2022-05-20 09:42:10] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 290 steps, including 0 resets, run visited all 13 properties in 41 ms. (steps per millisecond=7 )
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U !F(p1))||G(p2)||G(p3)||p2)))'
Support contains 3 out of 9 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 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 6 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:10] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:10] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-20 09:42:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:10] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p3) (NOT p2) p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p3:(GEQ s7 1), p2:(GEQ s3 1), p1:(GEQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25011 reset in 328 ms.
Product exploration explored 100000 steps with 24981 reset in 202 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1)), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 380 ms. Reduced automaton from 1 states, 4 edges and 3 AP to 1 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 44 ms :[(AND p1 (NOT p2) (NOT p3))]
Finished random walk after 3011 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=158 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1)), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2) p3)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 (NOT p2) p3))]
Knowledge based reduction with 8 factoid took 483 ms. Reduced automaton from 1 states, 4 edges and 3 AP to 1 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 37 ms :[(AND p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 38 ms :[(AND p1 (NOT p2) (NOT p3))]
Support contains 3 out of 8 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 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:42:12] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:42:12] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-20 09:42:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:12] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-20 09:42:12] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3))))]
Knowledge based reduction with 8 factoid took 348 ms. Reduced automaton from 1 states, 4 edges and 3 AP to 1 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 46 ms :[(AND p1 (NOT p2) (NOT p3))]
Finished random walk after 425 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2) p3)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 (NOT p2) p3))]
Knowledge based reduction with 8 factoid took 425 ms. Reduced automaton from 1 states, 4 edges and 3 AP to 1 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 35 ms :[(AND p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 38 ms :[(AND p1 (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 25036 reset in 261 ms.
Product exploration explored 100000 steps with 25047 reset in 270 ms.
Built C files in :
/tmp/ltsmin15545874494363907660
[2022-05-20 09:42:14] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-20 09:42:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 09:42:14] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-20 09:42:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 09:42:14] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-20 09:42:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 09:42:14] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15545874494363907660
Running compilation step : cd /tmp/ltsmin15545874494363907660;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 263 ms.
Running link step : cd /tmp/ltsmin15545874494363907660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15545874494363907660;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10981422083323254834.hoa' '--buchi-type=spotba'
LTSmin run took 93 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-00 finished in 4164 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(p0)))||p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:42:14] [INFO ] Implicit Places using invariants in 31 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LT s5 1) (LT s3 1) (LT s6 1)), p0:(LT s3 1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-02 finished in 192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))||F((F(p2)&&p1)))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:42:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:42:14] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:42:14] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-20 09:42:14] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-20 09:42:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:42:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:42:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s8 1), p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1)), p2:(OR (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6440 reset in 228 ms.
Stack based approach found an accepted trace after 16 steps with 1 reset with depth 6 and stack size 6 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-03 finished in 449 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(p0)&&p1)))||p2)))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:42:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:42:15] [INFO ] Implicit Places using invariants in 23 ms returned [6]
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 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s6 1), p1:(OR (LT s0 1) (LT s1 1) (LT s2 1) (LT s6 1)), p0:(LT s4 1)], 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 10605 reset in 137 ms.
Stack based approach found an accepted trace after 21 steps with 1 reset with depth 15 and stack size 15 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-04 finished in 305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&!(p1 U p1)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 6 transition count 7
Applied a total of 3 rules in 4 ms. Remains 6 /9 variables (removed 3) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2022-05-20 09:42:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 09:42:15] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-20 09:42:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 09:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:42:15] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-20 09:42:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-20 09:42:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 09:42:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 7/8 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s2 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-05 finished in 233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p1) U p0)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:42:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:42:15] [INFO ] Implicit Places using invariants in 31 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1)), p1:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 82872 steps with 6557 reset in 97 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-06 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:16] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:16] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:16] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-20 09:42:16] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:16] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-20 09:42:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s2 1), p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 16083 reset in 225 ms.
Stack based approach found an accepted trace after 23 steps with 5 reset with depth 7 and stack size 7 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-08 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(!F(((F(p0)&&G(p1))||p0))) U p2))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:42:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:42:16] [INFO ] Implicit Places using invariants in 25 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1, 2} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=p0, acceptance={1, 2} source=1 dest: 0}, { cond=(NOT p2), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={1, 2} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={1, 2} source=3 dest: 5}], [{ cond=(AND p2 (NOT p0) p1), acceptance={2} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={1, 2} source=4 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=4 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=5 dest: 4}, { cond=p1, acceptance={1, 2} source=5 dest: 5}], [{ cond=(AND p2 (NOT p0) p1), acceptance={2} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 2} source=6 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={1, 2} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s3 1), p0:(GEQ s4 1), p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 548 reset in 122 ms.
Stack based approach found an accepted trace after 24 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-09 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((p0 U !p1)||G((p1 U F(X(p2))))))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:17] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:17] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-20 09:42:17] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:42:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s5 1)), p0:(GEQ s3 1), p2:(OR (GEQ s3 1) (AND (GEQ s3 1) (GEQ s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 201 ms.
Product exploration explored 100000 steps with 0 reset in 150 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 10 factoid took 724 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 231 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:19] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2)))), (G (OR p0 (NOT p1))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Property proved to be true thanks to knowledge :(G (OR p0 (NOT p1)))
Knowledge based reduction with 14 factoid took 489 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-10 finished in 2580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(p0)))||F(p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:19] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:42:19] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-20 09:42:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:19] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s5 1)), p0:(LT s2 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]]
Product exploration explored 100000 steps with 11816 reset in 79 ms.
Product exploration explored 100000 steps with 11800 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 433 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=216 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 311 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 3 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:20] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:21] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-20 09:42:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 133 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 11896 reset in 71 ms.
Product exploration explored 100000 steps with 11839 reset in 84 ms.
Built C files in :
/tmp/ltsmin14926306808688081140
[2022-05-20 09:42:21] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-20 09:42:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 09:42:21] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-20 09:42:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 09:42:21] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-20 09:42:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 09:42:21] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14926306808688081140
Running compilation step : cd /tmp/ltsmin14926306808688081140;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin14926306808688081140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14926306808688081140;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10961751704991344160.hoa' '--buchi-type=spotba'
LTSmin run took 50 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-11 finished in 2518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(p1)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:42:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:22] [INFO ] Implicit Places using invariants in 25 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3 1), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9958 reset in 66 ms.
Stack based approach found an accepted trace after 24 steps with 3 reset with depth 3 and stack size 3 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-12 finished in 185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(p0)))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:42:22] [INFO ] Implicit Places using invariants in 30 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24862 reset in 56 ms.
Stack based approach found an accepted trace after 77 steps with 18 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-14 finished in 220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((X(X(F(p0)))&&p1))&&G(p0)&&p2))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:42:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:42:22] [INFO ] Implicit Places using invariants in 34 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(GEQ s3 1), p1:(GEQ s2 1), p2:(LT s5 1)], 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 SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0032DC0016-LTLFireability-15 finished in 254 ms.
All properties solved by simple procedures.
Total runtime 13857 ms.

BK_STOP 1653039742954

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="SmallOperatingSystem-PT-MT0032DC0016"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SmallOperatingSystem-PT-MT0032DC0016, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-smll-165303241300060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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