About the Execution of ITS-Tools for TCPcondis-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 821.119 | 109760.00 | 125020.00 | 478.90 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746500813.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TCPcondis-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746500813
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 24K May 5 16:52 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 TCPcondis-PT-15-00
FORMULA_NAME TCPcondis-PT-15-01
FORMULA_NAME TCPcondis-PT-15-02
FORMULA_NAME TCPcondis-PT-15-03
FORMULA_NAME TCPcondis-PT-15-04
FORMULA_NAME TCPcondis-PT-15-05
FORMULA_NAME TCPcondis-PT-15-06
FORMULA_NAME TCPcondis-PT-15-07
FORMULA_NAME TCPcondis-PT-15-08
FORMULA_NAME TCPcondis-PT-15-09
FORMULA_NAME TCPcondis-PT-15-10
FORMULA_NAME TCPcondis-PT-15-11
FORMULA_NAME TCPcondis-PT-15-12
FORMULA_NAME TCPcondis-PT-15-13
FORMULA_NAME TCPcondis-PT-15-14
FORMULA_NAME TCPcondis-PT-15-15
=== Now, execution of the tool begins
BK_START 1621284955464
Running Version 0
[2021-05-17 20:55:57] [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]
[2021-05-17 20:55:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:55:57] [WARNING] Skipping unknown tool specific annotation : Tina
[2021-05-17 20:55:57] [WARNING] Unknown XML tag in source file: size
[2021-05-17 20:55:57] [WARNING] Unknown XML tag in source file: color
[2021-05-17 20:55:57] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-17 20:55:57] [INFO ] Transformed 30 places.
[2021-05-17 20:55:57] [INFO ] Transformed 32 transitions.
[2021-05-17 20:55:57] [INFO ] Parsed PT model containing 30 places and 32 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 28 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:55:57] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-17 20:55:57] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:55:57] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 20:55:57] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:55:57] [INFO ] Computed 9 place invariants in 10 ms
[2021-05-17 20:55:57] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
[2021-05-17 20:55:57] [INFO ] Flatten gal took : 21 ms
[2021-05-17 20:55:57] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:55:57] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 2145 steps, including 0 resets, run visited all 25 properties in 9 ms. (steps per millisecond=238 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0&&X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:55:57] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 20:55:57] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:55:57] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 20:55:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:55:57] [INFO ] Computed 9 place invariants in 9 ms
[2021-05-17 20:55:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-15-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1 1), p1:(AND (GEQ s2 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 369 ms.
Product exploration explored 100000 steps with 0 reset in 416 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 0 reset in 313 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 14 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 20:55:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 20:55:59] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-17 20:55:59] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 0 reset in 301 ms.
Stack based approach found an accepted trace after 24734 steps with 0 reset with depth 24735 and stack size 24733 in 59 ms.
FORMULA TCPcondis-PT-15-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-00 finished in 2524 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X((G(p1) U (G(p1)&&p2)))) U X((p3 U p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:00] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 20 ms
[2021-05-17 20:56:00] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), true, (NOT p1), (AND (NOT p0) p1), (OR (NOT p2) (NOT p1)), false]
Running random walk in product with property : TCPcondis-PT-15-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p3 p2 p1), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p3 p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s25 1)), p3:(AND (GEQ s8 1) (GEQ s20 1)), p1:(AND (GEQ s12 1) (GEQ s26 1)), p2:(AND (GEQ s9 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-15-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-01 finished in 358 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&X((p0 U (p1||G(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:00] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:00] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-15-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-02 finished in 191 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 26 transition count 26
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 11 place count 25 transition count 26
Applied a total of 11 rules in 8 ms. Remains 25 /30 variables (removed 5) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:00] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-17 20:56:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:56:00] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 108 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-15-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-03 finished in 115 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:00] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:00] [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.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:01] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-15-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s10 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7676 reset in 178 ms.
Product exploration explored 100000 steps with 7735 reset in 203 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 7141 reset in 152 ms.
Product exploration explored 100000 steps with 7472 reset in 165 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 3 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2021-05-17 20:56:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 20:56:02] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:02] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 7658 reset in 163 ms.
Product exploration explored 100000 steps with 7383 reset in 189 ms.
[2021-05-17 20:56:02] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:56:02] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:56:02] [INFO ] Time to serialize gal into /tmp/LTL13541748034029741072.gal : 1 ms
[2021-05-17 20:56:02] [INFO ] Time to serialize properties into /tmp/LTL8475164972072048774.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13541748034029741072.gal, -t, CGAL, -LTL, /tmp/LTL8475164972072048774.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13541748034029741072.gal -t CGAL -LTL /tmp/LTL8475164972072048774.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(ESTAB>=1)"))||(F("((SYN>=1)&&(xSYNSENT>=1))"))))))
Formula 0 simplified : !XG(G"(ESTAB>=1)" | F"((SYN>=1)&&(xSYNSENT>=1))")
Detected timeout of ITS tools.
[2021-05-17 20:56:17] [INFO ] Flatten gal took : 15 ms
[2021-05-17 20:56:17] [INFO ] Applying decomposition
[2021-05-17 20:56:17] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17845327494978789328.txt, -o, /tmp/graph17845327494978789328.bin, -w, /tmp/graph17845327494978789328.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17845327494978789328.bin, -l, -1, -v, -w, /tmp/graph17845327494978789328.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:56:17] [INFO ] Decomposing Gal with order
[2021-05-17 20:56:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:56:17] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 20:56:17] [INFO ] Flatten gal took : 28 ms
[2021-05-17 20:56:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2021-05-17 20:56:17] [INFO ] Time to serialize gal into /tmp/LTL9202963094182062575.gal : 1 ms
[2021-05-17 20:56:17] [INFO ] Time to serialize properties into /tmp/LTL15383392172010756999.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9202963094182062575.gal, -t, CGAL, -LTL, /tmp/LTL15383392172010756999.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9202963094182062575.gal -t CGAL -LTL /tmp/LTL15383392172010756999.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(i0.u2.ESTAB>=1)"))||(F("((u4.SYN>=1)&&(u8.xSYNSENT>=1))"))))))
Formula 0 simplified : !XG(G"(i0.u2.ESTAB>=1)" | F"((u4.SYN>=1)&&(u8.xSYNSENT>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8522863678470957292
[2021-05-17 20:56:32] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8522863678470957292
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8522863678470957292]
Compilation finished in 237 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8522863678470957292]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8522863678470957292]
LTSmin run took 994 ms.
FORMULA TCPcondis-PT-15-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-15-04 finished in 33174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:34] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:34] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-05 automaton TGBA [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:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 898 reset in 199 ms.
Product exploration explored 100000 steps with 924 reset in 229 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 890 reset in 199 ms.
Product exploration explored 100000 steps with 886 reset in 197 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 5 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 20:56:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 20:56:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:35] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 925 reset in 179 ms.
Stack based approach found an accepted trace after 6956 steps with 60 reset with depth 70 and stack size 68 in 13 ms.
FORMULA TCPcondis-PT-15-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-05 finished in 1444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 5 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-05-17 20:56:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:35] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-05-17 20:56:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:35] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-05-17 20:56:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-05-17 20:56:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:35] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s24 1), p0:(OR (AND (GEQ s4 1) (GEQ s17 1)) (LT s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-15-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-06 finished in 189 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
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 18 place count 22 transition count 22
Applied a total of 18 rules in 5 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 20:56:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:35] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 20:56:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-17 20:56:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 20:56:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:35] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s13 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 181 ms.
Stack based approach found an accepted trace after 6936 steps with 0 reset with depth 6937 and stack size 6937 in 14 ms.
FORMULA TCPcondis-PT-15-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-07 finished in 319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:36] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:36] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:36] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0, p0]
Running random walk in product with property : TCPcondis-PT-15-08 automaton TGBA [mat=[[{ cond=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 s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 868 reset in 182 ms.
Product exploration explored 100000 steps with 872 reset in 198 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 897 reset in 182 ms.
Product exploration explored 100000 steps with 901 reset in 198 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 76 ms :[p0, p0, p0]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 5 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 20:56:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 20:56:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:37] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 911 reset in 180 ms.
Stack based approach found an accepted trace after 26882 steps with 258 reset with depth 24 and stack size 22 in 52 ms.
FORMULA TCPcondis-PT-15-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-08 finished in 1422 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:37] [INFO ] Computed 9 place invariants in 7 ms
[2021-05-17 20:56:37] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:37] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), p0]
Running random walk in product with property : TCPcondis-PT-15-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s20 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2420 reset in 250 ms.
Stack based approach found an accepted trace after 78554 steps with 1867 reset with depth 20 and stack size 20 in 218 ms.
FORMULA TCPcondis-PT-15-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-09 finished in 698 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(F((!p1 U (p2||G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 27 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 27
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 9 place count 26 transition count 27
Applied a total of 9 rules in 4 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 26 cols
[2021-05-17 20:56:38] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:38] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2021-05-17 20:56:38] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-17 20:56:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2021-05-17 20:56:38] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : TCPcondis-PT-15-10 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s18 1)), p2:(AND (OR (LT s1 1) (LT s19 1)) (LT s0 1)), p1:(AND (GEQ s1 1) (GEQ s19 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 779 reset in 223 ms.
Product exploration explored 100000 steps with 781 reset in 223 ms.
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 783 reset in 209 ms.
Stack based approach found an accepted trace after 16141 steps with 132 reset with depth 63 and stack size 63 in 36 ms.
FORMULA TCPcondis-PT-15-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-10 finished in 1035 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p0||G(p1)))||(X(F(p3))&&p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:39] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:39] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:39] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : TCPcondis-PT-15-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 3}, { cond=p2, acceptance={} source=7 dest: 5}]], initial=6, aps=[p3:(AND (GEQ s6 1) (GEQ s20 1)), p1:(AND (GEQ s4 1) (GEQ s18 1)), p0:(AND (GEQ s9 1) (GEQ s25 1)), p2:(AND (GEQ s9 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-15-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-11 finished in 289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((((p0||F(p1)) U p2)&&G(p3))))], workingDir=/home/mcc/execution]
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:39] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:39] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p3), (OR (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p2)), true, (OR (NOT p3) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-15-12 automaton TGBA [mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p3), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 p1 p3), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p3), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p3), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={0} source=5 dest: 2}, { cond=(NOT p3), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p2) p0 p3) (AND (NOT p2) p1 p3)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p3:(LT s14 1), p1:(OR (LT s4 1) (LT s21 1)), p2:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p0:(AND (GEQ s11 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-15-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-12 finished in 236 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Applied a total of 4 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 20:56:39] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:39] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 20:56:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:39] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-17 20:56:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 20:56:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:56:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : TCPcondis-PT-15-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (OR (LT s5 1) (LT s16 1)) (OR (LT s13 1) (LT s24 1) (LT s25 1))) (AND (GEQ s4 1) (GEQ s17 1))), p0:(LT s14 1)], nbAcceptance=1, 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 1642 reset in 216 ms.
Product exploration explored 100000 steps with 1667 reset in 228 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 21 ms :[(AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1658 reset in 218 ms.
Stack based approach found an accepted trace after 81557 steps with 1356 reset with depth 37 and stack size 37 in 194 ms.
FORMULA TCPcondis-PT-15-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-13 finished in 1062 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0 U p1) U X((p0||F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:40] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:40] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:40] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:56:40] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:56:40] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-15-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p0:(AND (GEQ s8 1) (GEQ s20 1)), p2:(AND (GEQ s5 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1798 reset in 257 ms.
Product exploration explored 100000 steps with 1804 reset in 232 ms.
Knowledge obtained : [(NOT p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1804 reset in 214 ms.
Product exploration explored 100000 steps with 1799 reset in 232 ms.
[2021-05-17 20:56:42] [INFO ] Flatten gal took : 2 ms
[2021-05-17 20:56:42] [INFO ] Flatten gal took : 2 ms
[2021-05-17 20:56:42] [INFO ] Time to serialize gal into /tmp/LTL8314999698124201111.gal : 0 ms
[2021-05-17 20:56:42] [INFO ] Time to serialize properties into /tmp/LTL9941524311344864867.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8314999698124201111.gal, -t, CGAL, -LTL, /tmp/LTL9941524311344864867.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8314999698124201111.gal -t CGAL -LTL /tmp/LTL9941524311344864867.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((("((LASTACK>=1)&&(xFINACK>=1))")U("(((SYNSENT>=1)&&(xSYN>=1))&&(xSYNACK>=1))"))U(X((F("((FINACK>=1)&&(xLASTACK>=1))"))||("((LASTACK>=1)&&(xFINACK>=1))")))))))
Formula 0 simplified : !FG(("((LASTACK>=1)&&(xFINACK>=1))" U "(((SYNSENT>=1)&&(xSYN>=1))&&(xSYNACK>=1))") U X("((LASTACK>=1)&&(xFINACK>=1))" | F"((FINACK>=1)&&(xLASTACK>=1))"))
Detected timeout of ITS tools.
[2021-05-17 20:56:57] [INFO ] Flatten gal took : 2 ms
[2021-05-17 20:56:57] [INFO ] Applying decomposition
[2021-05-17 20:56:57] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph706185694673600872.txt, -o, /tmp/graph706185694673600872.bin, -w, /tmp/graph706185694673600872.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph706185694673600872.bin, -l, -1, -v, -w, /tmp/graph706185694673600872.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:56:57] [INFO ] Decomposing Gal with order
[2021-05-17 20:56:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:56:57] [INFO ] Removed a total of 22 redundant transitions.
[2021-05-17 20:56:57] [INFO ] Flatten gal took : 10 ms
[2021-05-17 20:56:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 20:56:57] [INFO ] Time to serialize gal into /tmp/LTL6909114473926520258.gal : 2 ms
[2021-05-17 20:56:57] [INFO ] Time to serialize properties into /tmp/LTL4066022455271938739.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6909114473926520258.gal, -t, CGAL, -LTL, /tmp/LTL4066022455271938739.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6909114473926520258.gal -t CGAL -LTL /tmp/LTL4066022455271938739.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G((("((i1.i0.u1.LASTACK>=1)&&(i1.i0.u2.xFINACK>=1))")U("(((u0.SYNSENT>=1)&&(u5.xSYN>=1))&&(i1.i1.u8.xSYNACK>=1))"))U(X((F("((i2.u6.FINACK>=1)&&(i2.u6.xLASTACK>=1))"))||("((i1.i0.u1.LASTACK>=1)&&(i1.i0.u2.xFINACK>=1))")))))))
Formula 0 simplified : !FG(("((i1.i0.u1.LASTACK>=1)&&(i1.i0.u2.xFINACK>=1))" U "(((u0.SYNSENT>=1)&&(u5.xSYN>=1))&&(i1.i1.u8.xSYNACK>=1))") U X("((i1.i0.u1.LASTACK>=1)&&(i1.i0.u2.xFINACK>=1))" | F"((i2.u6.FINACK>=1)&&(i2.u6.xLASTACK>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17345514554409769388
[2021-05-17 20:57:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17345514554409769388
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17345514554409769388]
Compilation finished in 218 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17345514554409769388]
Link finished in 32 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((((LTLAPp0==true) U (LTLAPp1==true)) U X((<>((LTLAPp2==true))||(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17345514554409769388]
LTSmin run took 217 ms.
FORMULA TCPcondis-PT-15-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-15-14 finished in 32059 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((X(!p0)&&(p0 U p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:57:12] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:57:12] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:57:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:57:12] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:57:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:57:12] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-15-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(OR p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p1:(GEQ s15 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33253 reset in 84 ms.
Product exploration explored 100000 steps with 33228 reset in 116 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33254 reset in 83 ms.
Product exploration explored 100000 steps with 33204 reset in 109 ms.
[2021-05-17 20:57:13] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:57:13] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:57:13] [INFO ] Time to serialize gal into /tmp/LTL18051119531621932203.gal : 1 ms
[2021-05-17 20:57:13] [INFO ] Time to serialize properties into /tmp/LTL4403652402363250374.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18051119531621932203.gal, -t, CGAL, -LTL, /tmp/LTL4403652402363250374.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18051119531621932203.gal -t CGAL -LTL /tmp/LTL4403652402363250374.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((X("(CLOSEWAIT<1)"))&&(("(CLOSEWAIT>=1)")U("(xCLOSED>=1)"))))))
Formula 0 simplified : !GF(X"(CLOSEWAIT<1)" & ("(CLOSEWAIT>=1)" U "(xCLOSED>=1)"))
Detected timeout of ITS tools.
[2021-05-17 20:57:28] [INFO ] Flatten gal took : 2 ms
[2021-05-17 20:57:28] [INFO ] Applying decomposition
[2021-05-17 20:57:28] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8213963753507554416.txt, -o, /tmp/graph8213963753507554416.bin, -w, /tmp/graph8213963753507554416.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8213963753507554416.bin, -l, -1, -v, -w, /tmp/graph8213963753507554416.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:57:28] [INFO ] Decomposing Gal with order
[2021-05-17 20:57:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:57:28] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 20:57:28] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:57:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 20:57:28] [INFO ] Time to serialize gal into /tmp/LTL8554583647579086491.gal : 3 ms
[2021-05-17 20:57:28] [INFO ] Time to serialize properties into /tmp/LTL8707183647002829758.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8554583647579086491.gal, -t, CGAL, -LTL, /tmp/LTL8707183647002829758.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8554583647579086491.gal -t CGAL -LTL /tmp/LTL8707183647002829758.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F((X("(i1.i1.u3.CLOSEWAIT<1)"))&&(("(i1.i1.u3.CLOSEWAIT>=1)")U("(u4.xCLOSED>=1)"))))))
Formula 0 simplified : !GF(X"(i1.i1.u3.CLOSEWAIT<1)" & ("(i1.i1.u3.CLOSEWAIT>=1)" U "(u4.xCLOSED>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12147963378081152866
[2021-05-17 20:57:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12147963378081152866
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12147963378081152866]
Compilation finished in 172 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12147963378081152866]
Link finished in 33 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((X((LTLAPp0==true))&&(!(LTLAPp0==true) U (LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12147963378081152866]
LTSmin run took 358 ms.
FORMULA TCPcondis-PT-15-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-15-15 finished in 31478 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621285065224
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="TCPcondis-PT-15"
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 TCPcondis-PT-15, 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 r254-tall-162106746500813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-15.tgz
mv TCPcondis-PT-15 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 '
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 ;