fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r258-tall-165303545600364
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SwimmingPool-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
262.972 10780.00 17450.00 257.10 TTTTFTTFFTFFTFFF 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.r258-tall-165303545600364.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 SwimmingPool-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545600364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 6.1K Apr 29 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-01-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653123293568

Running Version 202205111006
[2022-05-21 08:54:54] [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-21 08:54:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 08:54:54] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2022-05-21 08:54:54] [INFO ] Transformed 9 places.
[2022-05-21 08:54:54] [INFO ] Transformed 7 transitions.
[2022-05-21 08:54:54] [INFO ] Parsed PT model containing 9 places and 7 transitions in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SwimmingPool-PT-01-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:54:54] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 08:54:55] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:54:55] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 08:54:55] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:54:55] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 08:54:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Support contains 8 out of 9 places after structural reductions.
[2022-05-21 08:54:55] [INFO ] Flatten gal took : 13 ms
[2022-05-21 08:54:55] [INFO ] Flatten gal took : 2 ms
[2022-05-21 08:54:55] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 66 steps, including 0 resets, run visited all 9 properties in 13 ms. (steps per millisecond=5 )
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(((X(p1) U X(p1)) U p2))&&p0)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 7 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:55] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:54:55] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-21 08:54:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(AND (GEQ s0 1) (GEQ s7 1)), p0:(AND (GEQ s2 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13472 reset in 208 ms.
Product exploration explored 100000 steps with 13458 reset in 109 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 p2) (NOT p0)), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 6 factoid took 259 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 75 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Finished random walk after 23 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F p0), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 6 factoid took 532 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 66 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:54:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 08:54:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:54:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:54:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-21 08:54:57] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 08:54:57] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:54:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-21 08:54:57] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 08:54:57] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:54:57] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:57] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-21 08:54:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 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 p2) (NOT p0)), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 6 factoid took 277 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 57 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Finished random walk after 23 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F p0), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 6 factoid took 333 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 62 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:54:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 08:54:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:54:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:54:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 08:54:58] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 08:54:58] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:54:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:54:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-21 08:54:58] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 08:54:58] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 13436 reset in 105 ms.
Product exploration explored 100000 steps with 13461 reset in 110 ms.
Built C files in :
/tmp/ltsmin8988731069234029538
[2022-05-21 08:54:58] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 08:54:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:54:58] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 08:54:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:54:58] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 08:54:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:54:58] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8988731069234029538
Running compilation step : cd /tmp/ltsmin8988731069234029538;'/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 141 ms.
Running link step : cd /tmp/ltsmin8988731069234029538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8988731069234029538;'/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/stateBased4282908881439088215.hoa' '--buchi-type=spotba'
LTSmin run took 128 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-01-LTLFireability-01 finished in 3558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(X(p0))||(G(!p0) U !p0))))))'
Support contains 0 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, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 08:54:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:59] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 08:54:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:54:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-21 08:54:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 08:54:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:54:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 16 ms :[false]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-02 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-02 TRUE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-02 finished in 103 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 08:54:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:54:59] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 08:54:59] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 08:54:59] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-21 08:54:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 08:54:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:54:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (OR (LT s1 1) (LT s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-04 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p0)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 3 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:54:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:54:59] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:54:59] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 08:54:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-21 08:54:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:54:59] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 08:54:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24933 reset in 51 ms.
Product exploration explored 100000 steps with 25050 reset in 52 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:00] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 08:55:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:55:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 08:55:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:55:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 08:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:55:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 08:55:00] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 08:55:00] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:00] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:00] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-21 08:55:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:55:00] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:55:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 08:55:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:55:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-21 08:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:55:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 08:55:00] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 08:55:00] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25065 reset in 47 ms.
Product exploration explored 100000 steps with 24990 reset in 53 ms.
Built C files in :
/tmp/ltsmin6185571310542392112
[2022-05-21 08:55:00] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-21 08:55:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:55:00] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-21 08:55:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:55:00] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-21 08:55:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:55:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6185571310542392112
Running compilation step : cd /tmp/ltsmin6185571310542392112;'/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 79 ms.
Running link step : cd /tmp/ltsmin6185571310542392112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6185571310542392112;'/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/stateBased13864145260859803393.hoa' '--buchi-type=spotba'
LTSmin run took 49 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-01-LTLFireability-06 finished in 1508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:01] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:55:01] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-21 08:55:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:01] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 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 16051 reset in 67 ms.
Product exploration explored 100000 steps with 15989 reset in 59 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:55:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:55:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 08:55:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:55:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-21 08:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:55:01] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 08:55:01] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 08:55:01] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:01] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:01] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-21 08:55:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:01] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 08:55:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:55:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:55:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 08:55:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:55:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 08:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:55:02] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 08:55:02] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 08:55:02] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16341 reset in 53 ms.
Product exploration explored 100000 steps with 15799 reset in 57 ms.
Built C files in :
/tmp/ltsmin12267403407437164512
[2022-05-21 08:55:02] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-21 08:55:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:55:02] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-21 08:55:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:55:02] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-21 08:55:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:55:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12267403407437164512
Running compilation step : cd /tmp/ltsmin12267403407437164512;'/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 77 ms.
Running link step : cd /tmp/ltsmin12267403407437164512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12267403407437164512;'/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/stateBased17804923963790280500.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-01-LTLFireability-09 finished in 1793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:55:02] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:02] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:02] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-10 finished in 177 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((!p1 U p2))&&p0))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:03] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:55:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(GEQ s6 1), p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 1 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-11 finished in 253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p0 U (X(!p1)||p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:55:03] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:03] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, p1, false]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s3 1) (GEQ s7 1)), p0:(GEQ s5 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 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 50 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)), (X (NOT p1)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-01-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-01-LTLFireability-12 finished in 340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F((G(F(G(p0)))&&(X(p1) U 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, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:55:03] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:03] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-21 08:55:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:03] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s6 1)), p2:(GEQ s1 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 2 reset in 87 ms.
Stack based approach found an accepted trace after 136 steps with 2 reset with depth 124 and stack size 120 in 0 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-13 finished in 279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(X(X(p0)))))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:03] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-21 08:55:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 08:55:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:03] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-14 finished in 208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p0&&F(p0)&&F(p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:04] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 08:55:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 08:55:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 08:55:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LT s6 1), p1:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-15 finished in 202 ms.
All properties solved by simple procedures.
Total runtime 9560 ms.

BK_STOP 1653123304348

--------------------
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="SwimmingPool-PT-01"
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 SwimmingPool-PT-01, 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 r258-tall-165303545600364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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