fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124156000133
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for GPUForwardProgress-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
346.279 9761.00 18091.00 195.30 FFFFFTFFFFFFFFFF 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.r292-tall-162124156000133.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 GPUForwardProgress-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156000133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.3K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.7K May 11 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 11 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 15K May 12 08:13 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 GPUForwardProgress-PT-12a-00
FORMULA_NAME GPUForwardProgress-PT-12a-01
FORMULA_NAME GPUForwardProgress-PT-12a-02
FORMULA_NAME GPUForwardProgress-PT-12a-03
FORMULA_NAME GPUForwardProgress-PT-12a-04
FORMULA_NAME GPUForwardProgress-PT-12a-05
FORMULA_NAME GPUForwardProgress-PT-12a-06
FORMULA_NAME GPUForwardProgress-PT-12a-07
FORMULA_NAME GPUForwardProgress-PT-12a-08
FORMULA_NAME GPUForwardProgress-PT-12a-09
FORMULA_NAME GPUForwardProgress-PT-12a-10
FORMULA_NAME GPUForwardProgress-PT-12a-11
FORMULA_NAME GPUForwardProgress-PT-12a-12
FORMULA_NAME GPUForwardProgress-PT-12a-13
FORMULA_NAME GPUForwardProgress-PT-12a-14
FORMULA_NAME GPUForwardProgress-PT-12a-15

=== Now, execution of the tool begins

BK_START 1621269725170

Running Version 0
[2021-05-17 16:42:06] [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 16:42:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:42:06] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-17 16:42:06] [INFO ] Transformed 56 places.
[2021-05-17 16:42:06] [INFO ] Transformed 69 transitions.
[2021-05-17 16:42:06] [INFO ] Found NUPN structural information;
[2021-05-17 16:42:06] [INFO ] Parsed PT model containing 56 places and 69 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 16:42:06] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA GPUForwardProgress-PT-12a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Applied a total of 0 rules in 9 ms. Remains 56 /56 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 56 cols
[2021-05-17 16:42:06] [INFO ] Computed 14 place invariants in 10 ms
[2021-05-17 16:42:07] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 55 rows 56 cols
[2021-05-17 16:42:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 16:42:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:07] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 56 cols
[2021-05-17 16:42:07] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-17 16:42:07] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 55/55 transitions.
[2021-05-17 16:42:07] [INFO ] Flatten gal took : 27 ms
[2021-05-17 16:42:07] [INFO ] Flatten gal took : 9 ms
[2021-05-17 16:42:07] [INFO ] Input system was already deterministic with 55 transitions.
Finished random walk after 2761 steps, including 13 resets, run visited all 27 properties in 27 ms. (steps per millisecond=102 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 55 transition count 44
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 44 transition count 44
Applied a total of 22 rules in 16 ms. Remains 44 /56 variables (removed 12) and now considering 44/55 (removed 11) transitions.
// Phase 1: matrix 44 rows 44 cols
[2021-05-17 16:42:07] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-17 16:42:07] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 44 rows 44 cols
[2021-05-17 16:42:07] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-17 16:42:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:07] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2021-05-17 16:42:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 44 cols
[2021-05-17 16:42:07] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:07] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/56 places, 44/55 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s32 1) (EQ s39 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-00 finished in 336 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 2 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:07] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-17 16:42:07] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:07] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:07] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:07] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:07] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-12a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s11 1), p0:(EQ s19 0)], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 113 steps with 1 reset in 6 ms.
FORMULA GPUForwardProgress-PT-12a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-01 finished in 332 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p1)||X(!p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 2 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:08] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-17 16:42:08] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:08] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-17 16:42:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:08] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:08] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:08] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 123 ms :[p1, false, false, true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12a-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s36 0) (EQ s50 0) (EQ s54 0)), p1:(EQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-02 finished in 269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 54 transition count 43
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 43 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 42 transition count 42
Applied a total of 24 rules in 7 ms. Remains 42 /56 variables (removed 14) and now considering 42/55 (removed 13) transitions.
// Phase 1: matrix 42 rows 42 cols
[2021-05-17 16:42:08] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:08] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2021-05-17 16:42:08] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 16:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 16:42:08] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2021-05-17 16:42:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2021-05-17 16:42:08] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:08] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/56 places, 42/55 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12a-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-03 finished in 150 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U G((G(p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 1 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:08] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 16:42:08] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:08] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:08] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:08] [INFO ] Computed 13 place invariants in 6 ms
[2021-05-17 16:42:08] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p2), (NOT p2), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-12a-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=1 dest: 8}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 9}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(OR p2 p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=7 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=7 dest: 7}, { cond=(AND p2 p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 9}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=8 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=8 dest: 8}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=8 dest: 9}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=9 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=9 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND p2 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(EQ s49 1), p1:(OR (EQ s53 1) (AND (EQ s34 1) (EQ s50 1) (EQ s54 1))), p0:(OR (EQ s36 0) (EQ s50 0) (EQ s54 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-04 finished in 455 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 17 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 56 cols
[2021-05-17 16:42:09] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-17 16:42:09] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 55 rows 56 cols
[2021-05-17 16:42:09] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 16:42:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 56 cols
[2021-05-17 16:42:09] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-17 16:42:09] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : GPUForwardProgress-PT-12a-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s38 1), p0:(AND (NEQ s53 1) (NEQ s19 1) (OR (NEQ s1 1) (NEQ s5 1) (NEQ s9 1) (NEQ s13 1) (NEQ s17 1) (NEQ s21 1) (NEQ s25 1) (NEQ s29 1) (NEQ s33 1) (NEQ s37 1) (NEQ s41 1) (NEQ s45 1) (NEQ s49 1) (NEQ s52 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 305 ms.
Product exploration explored 100000 steps with 33333 reset in 235 ms.
Graph (complete) has 174 edges and 56 vertex of which 42 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 33333 reset in 187 ms.
Product exploration explored 100000 steps with 33333 reset in 190 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 17 out of 56 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 56 transition count 65
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 56 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 56 transition count 65
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 11 rules in 6 ms. Remains 56 /56 variables (removed 0) and now considering 65/55 (removed -10) transitions.
[2021-05-17 16:42:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 56 cols
[2021-05-17 16:42:10] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 16:42:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 65/55 transitions.
Product exploration explored 100000 steps with 33333 reset in 316 ms.
Product exploration explored 100000 steps with 33333 reset in 276 ms.
[2021-05-17 16:42:11] [INFO ] Flatten gal took : 6 ms
[2021-05-17 16:42:11] [INFO ] Flatten gal took : 6 ms
[2021-05-17 16:42:11] [INFO ] Time to serialize gal into /tmp/LTL4371970837509294017.gal : 2 ms
[2021-05-17 16:42:11] [INFO ] Time to serialize properties into /tmp/LTL10276226245112394656.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/LTL4371970837509294017.gal, -t, CGAL, -LTL, /tmp/LTL10276226245112394656.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/LTL4371970837509294017.gal -t CGAL -LTL /tmp/LTL10276226245112394656.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((p53==0)&&(p19==0))")&&(X(F("(p38==0)"))))&&("((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p52==0))"))))
Formula 0 simplified : !X("((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p52==0))" & "((p53==0)&&(p19==0))" & XF"(p38==0)")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/51/4/55
Computing Next relation with stutter on 4096 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.151658,20684,1,0,113,27681,146,61,2039,19119,129
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-12a-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPUForwardProgress-PT-12a-05 finished in 2385 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 2 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:11] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:11] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:11] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-17 16:42:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:11] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:11] [INFO ] Computed 13 place invariants in 6 ms
[2021-05-17 16:42:11] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12a-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s7 1), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-06 finished in 283 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(F(p0)) U (p1||F(p2)))&&(p3 U p4))))], workingDir=/home/mcc/execution]
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 1 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:11] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:11] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:11] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-17 16:42:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:11] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:11] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:11] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p4) (AND (NOT p1) (NOT p2))), (OR (NOT p4) (AND (NOT p1) (NOT p2))), true, (NOT p4), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-12a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0) p4) (AND (NOT p1) (NOT p2) (NOT p0) p3)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p4:(AND (EQ s10 1) (EQ s3 1)), p3:(EQ s10 1), p1:(EQ s30 1), p2:(EQ s3 1), p0:(AND (EQ s38 1) (EQ s50 1) (EQ s54 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-07 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 2 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 16:42:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12a-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-08 finished in 199 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 2 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 4 ms
[2021-05-17 16:42:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s27 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][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-09 finished in 184 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((G(p1)&&p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 1 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12a-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s46 1) (EQ s50 1) (EQ s54 1) (EQ s39 1)), p1:(EQ s31 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-11 finished in 222 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 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 54 transition count 43
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 43 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 42 transition count 42
Applied a total of 24 rules in 5 ms. Remains 42 /56 variables (removed 14) and now considering 42/55 (removed 13) transitions.
// Phase 1: matrix 42 rows 42 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2021-05-17 16:42:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/56 places, 42/55 transitions.
Stuttering acceptance computed with spot in 27 ms :[p0]
Running random walk in product with property : GPUForwardProgress-PT-12a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-12 finished in 135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 54 transition count 43
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 43 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 42 transition count 42
Applied a total of 24 rules in 6 ms. Remains 42 /56 variables (removed 14) and now considering 42/55 (removed 13) transitions.
// Phase 1: matrix 42 rows 42 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2021-05-17 16:42:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:12] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/56 places, 42/55 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12a-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-13 finished in 168 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0||G(!p1)||X(p2)))&&F(!p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 1 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 16:42:12] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:13] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:13] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR p3 (AND (NOT p0) p1 (NOT p2))), (OR p3 (AND (NOT p0) p1 (NOT p2))), (NOT p2), (AND (NOT p0) p1 (NOT p2)), p3, (AND p1 (NOT p2)), true, p1]
Running random walk in product with property : GPUForwardProgress-PT-12a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p3, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s19 1), p1:(EQ s3 1), p3:(EQ s11 1), p2:(OR (NEQ s40 1) (NEQ s50 1) (NEQ s54 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 3306 steps with 40 reset in 9 ms.
FORMULA GPUForwardProgress-PT-12a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-14 finished in 344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((((X(p1)&&p0) U G(p2)) U p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 1 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:13] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 16:42:13] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:13] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 16:42:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 16:42:13] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 55 cols
[2021-05-17 16:42:13] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 16:42:13] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 55/55 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p3), (AND (NOT p3) (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) p0 p1)]
Running random walk in product with property : GPUForwardProgress-PT-12a-15 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p3 p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p0)), acceptance={0, 1} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=0 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={1} source=1 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=2 dest: 1}, { cond=(AND p3 p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=2 dest: 5}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=3 dest: 5}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={0, 1} source=4 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=5 dest: 5}, { cond=(OR (AND p3 p2) (AND p2 p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p3:(OR (EQ s18 0) (EQ s50 0) (EQ s54 0)), p2:(EQ s53 1), p0:(AND (EQ s18 1) (EQ s50 1) (EQ s54 1)), p1:(AND (EQ s22 1) (EQ s50 1) (EQ s54 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 624 reset in 304 ms.
Stack based approach found an accepted trace after 328 steps with 3 reset with depth 34 and stack size 29 in 1 ms.
FORMULA GPUForwardProgress-PT-12a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12a-15 finished in 687 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621269734931

--------------------
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="GPUForwardProgress-PT-12a"
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 GPUForwardProgress-PT-12a, 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 r292-tall-162124156000133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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