About the Execution of ITS-Tools for GPPP-PT-C1000N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1724.523 | 57742.00 | 107285.00 | 415.70 | FFFFTFFFFTFFFFFF | 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.r102-smll-162075331400277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C1000N0000000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331400277
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 11:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 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 GPPP-PT-C1000N0000000010-00
FORMULA_NAME GPPP-PT-C1000N0000000010-01
FORMULA_NAME GPPP-PT-C1000N0000000010-02
FORMULA_NAME GPPP-PT-C1000N0000000010-03
FORMULA_NAME GPPP-PT-C1000N0000000010-04
FORMULA_NAME GPPP-PT-C1000N0000000010-05
FORMULA_NAME GPPP-PT-C1000N0000000010-06
FORMULA_NAME GPPP-PT-C1000N0000000010-07
FORMULA_NAME GPPP-PT-C1000N0000000010-08
FORMULA_NAME GPPP-PT-C1000N0000000010-09
FORMULA_NAME GPPP-PT-C1000N0000000010-10
FORMULA_NAME GPPP-PT-C1000N0000000010-11
FORMULA_NAME GPPP-PT-C1000N0000000010-12
FORMULA_NAME GPPP-PT-C1000N0000000010-13
FORMULA_NAME GPPP-PT-C1000N0000000010-14
FORMULA_NAME GPPP-PT-C1000N0000000010-15
=== Now, execution of the tool begins
BK_START 1621231191765
Running Version 0
[2021-05-17 05:59:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 05:59:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 05:59:54] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-17 05:59:54] [INFO ] Transformed 33 places.
[2021-05-17 05:59:54] [INFO ] Transformed 22 transitions.
[2021-05-17 05:59:54] [INFO ] Parsed PT model containing 33 places and 22 transitions in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Support contains 27 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 19 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:55] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-17 05:59:55] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:55] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 05:59:55] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:55] [INFO ] Invariants computation overflowed in 9 ms
[2021-05-17 05:59:55] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:55] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 05:59:55] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:55] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:59:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-17 05:59:55] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 05:59:55] [INFO ] Flatten gal took : 47 ms
FORMULA GPPP-PT-C1000N0000000010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 05:59:56] [INFO ] Flatten gal took : 15 ms
[2021-05-17 05:59:56] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100008 steps, including 231 resets, run finished after 298 ms. (steps per millisecond=335 ) properties (out of 22) seen :18
Running SMT prover for 4 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:56] [INFO ] Invariants computation overflowed in 5 ms
[2021-05-17 05:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 05:59:56] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2021-05-17 05:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 05:59:56] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2021-05-17 05:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 05:59:56] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2021-05-17 05:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 05:59:56] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA GPPP-PT-C1000N0000000010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:56] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:59:56] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:56] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:56] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 05:59:56] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 170 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:57] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:57] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s15 1), p1:(AND (GEQ s6 1) (GEQ s26 2000))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 448 steps with 2 reset in 17 ms.
FORMULA GPPP-PT-C1000N0000000010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-00 finished in 817 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 29 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:57] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:57] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:57] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 116 ms to find 2 implicit places.
[2021-05-17 05:59:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:57] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Applied a total of 2 rules in 8 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 21 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:57] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:57] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s14 1)), p0:(AND (GEQ s3 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-01 finished in 396 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:57] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 05:59:57] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:57] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 05:59:58] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 141 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:58] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:58] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-03 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:(AND (GEQ s13 1) (GEQ s24 3000))], 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 GPPP-PT-C1000N0000000010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-03 finished in 363 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((!p0||(p1&&(p2||X(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:58] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:58] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:58] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 121 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 05:59:58] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR p0 p1), true]
Running random walk in product with property : GPPP-PT-C1000N0000000010-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND p1 p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s23 1)), p1:(OR (LT s1 1) (LT s12 1)), p2:(GEQ s5 2)], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 427 steps with 0 reset in 6 ms.
FORMULA GPPP-PT-C1000N0000000010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-05 finished in 479 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 05:59:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:58] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 05:59:58] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 141 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 05:59:58] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:58] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-06 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:(OR (LT s9 1) (LT s10 1) (LT s28 7000))], 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 21 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-06 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
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 2 with 2 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 14 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-17 05:59:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-17 05:59:59] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:59] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [0, 2, 12, 16]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 119 ms to find 4 implicit places.
[2021-05-17 05:59:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 19/32 places, 15/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 14
Applied a total of 2 rules in 4 ms. Remains 18 /19 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:59] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:59] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s6 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 23 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-07 finished in 348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:59:59] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:59] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:59] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 134 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:59] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (GEQ s13 1) (GEQ s24 3000)), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 2 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-08 finished in 404 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:59] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 05:59:59] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 06:00:00] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 140 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 06:00:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 06:00:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:00] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s10 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]]
Product exploration explored 100000 steps with 8539 reset in 437 ms.
Product exploration explored 100000 steps with 8428 reset in 346 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8428 reset in 172 ms.
Product exploration explored 100000 steps with 8524 reset in 191 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 65 ms :[(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, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 30 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 22
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 29 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 28 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 28 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 9 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 06:00:01] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
[2021-05-17 06:00:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 06:00:01] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:01] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 20/22 transitions.
Product exploration explored 100000 steps with 8789 reset in 464 ms.
Product exploration explored 100000 steps with 8753 reset in 313 ms.
[2021-05-17 06:00:02] [INFO ] Flatten gal took : 8 ms
[2021-05-17 06:00:02] [INFO ] Flatten gal took : 7 ms
[2021-05-17 06:00:02] [INFO ] Time to serialize gal into /tmp/LTL6962224888760216007.gal : 2 ms
[2021-05-17 06:00:02] [INFO ] Time to serialize properties into /tmp/LTL8940928583871377453.ltl : 2 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/LTL6962224888760216007.gal, -t, CGAL, -LTL, /tmp/LTL8940928583871377453.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/LTL6962224888760216007.gal -t CGAL -LTL /tmp/LTL8940928583871377453.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(GAP>=1)"))))
Formula 0 simplified : !XF"(GAP>=1)"
Detected timeout of ITS tools.
[2021-05-17 06:00:17] [INFO ] Flatten gal took : 5 ms
[2021-05-17 06:00:17] [INFO ] Applying decomposition
[2021-05-17 06:00:17] [INFO ] Flatten gal took : 4 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/graph17143783667754820287.txt, -o, /tmp/graph17143783667754820287.bin, -w, /tmp/graph17143783667754820287.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/graph17143783667754820287.bin, -l, -1, -v, -w, /tmp/graph17143783667754820287.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:00:17] [INFO ] Decomposing Gal with order
[2021-05-17 06:00:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:00:17] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 06:00:17] [INFO ] Flatten gal took : 55 ms
[2021-05-17 06:00:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 06:00:17] [INFO ] Time to serialize gal into /tmp/LTL3389370506704168245.gal : 2 ms
[2021-05-17 06:00:17] [INFO ] Time to serialize properties into /tmp/LTL1125427133357296623.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/LTL3389370506704168245.gal, -t, CGAL, -LTL, /tmp/LTL1125427133357296623.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/LTL3389370506704168245.gal -t CGAL -LTL /tmp/LTL1125427133357296623.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i2.u4.GAP>=1)"))))
Formula 0 simplified : !XF"(i2.u4.GAP>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15564091627299237261
[2021-05-17 06:00:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15564091627299237261
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/ltsmin15564091627299237261]
Compilation finished in 491 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15564091627299237261]
Link finished in 67 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin15564091627299237261]
LTSmin run took 11832 ms.
FORMULA GPPP-PT-C1000N0000000010-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C1000N0000000010-09 finished in 45562 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:45] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:45] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 06:00:45] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 100 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 06:00:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 06:00:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 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]]
Product exploration explored 100000 steps with 10887 reset in 131 ms.
Stack based approach found an accepted trace after 56 steps with 6 reset with depth 10 and stack size 10 in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-10 finished in 400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(p1)||G(!p2)))], workingDir=/home/mcc/execution]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 06:00:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:45] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:45] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 94 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 06:00:45] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 06:00:45] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-11 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s7 1) (GEQ s11 1)), p1:(AND (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p2:(OR (LT s1 1) (LT s23 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 2426 reset in 437 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-11 finished in 851 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(G(p1))&&F(p2)&&p0) U X(!p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:46] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:46] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:46] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 138 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 06:00:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:46] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 06:00:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:46] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 223 ms :[p2, p2, p2, true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={0} 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=0, aps=[p0:(AND (GEQ s7 1) (GEQ s28 1)), p2:(OR (LT s7 1) (LT s28 1)), p1:(AND (GEQ s2 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-12 finished in 513 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||X((p1 U p2)))) U (p1&&(!p3||(p4 U (p5||G(p4)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:47] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 06:00:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:47] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 06:00:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:47] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 133 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 06:00:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 06:00:47] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 06:00:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 572 ms :[(OR (NOT p1) (AND p3 (NOT p4) (NOT p5))), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p4) (NOT p5)), (OR (AND (NOT p1) (NOT p4) (NOT p5)) (AND p3 (NOT p4) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p4) (NOT p5)) (AND p0 (NOT p2) (NOT p4) (NOT p5))), true, (AND (NOT p5) (NOT p4))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-14 automaton TGBA [mat=[[{ cond=(OR (NOT p1) (AND p3 (NOT p5) (NOT p4))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p5) (NOT p4) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (AND p3 (NOT p5) (NOT p4))), acceptance={} source=0 dest: 2}, { cond=(AND p1 p3 (NOT p5) p4), acceptance={} source=0 dest: 3}, { cond=(AND p1 p3 (NOT p5) p4), acceptance={} source=0 dest: 4}, { cond=(AND p1 p3 (NOT p5) p4 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p5) (NOT p4) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p5) (NOT p4)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p5) p4), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p5) p4 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p5) (NOT p4)) (AND p3 (NOT p5) (NOT p4))), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p5) p4) (AND p3 (NOT p5) p4)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p5) (NOT p4) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p5) p4 p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p5) (NOT p4) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p5) p4 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p5) (NOT p4)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p5) p4), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(GEQ s15 1), p3:(GEQ s5 2), p5:(AND (LT s15 1) (OR (LT s7 1) (LT s8 1))), p4:(OR (LT s7 1) (LT s8 1)), p0:(AND (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p2:(AND (GEQ s15 1) (GEQ s2 2) (GEQ s13 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 1 ms.
FORMULA GPPP-PT-C1000N0000000010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-14 finished in 852 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(!p0))&&F((p1 U (G(p1)||p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 31 transition count 20
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 3 place count 30 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 25 transition count 17
Applied a total of 11 rules in 11 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 06:00:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 06:00:48] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 06:00:48] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 06:00:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 06:00:48] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 95 ms to find 1 implicit places.
[2021-05-17 06:00:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-17 06:00:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 24/32 places, 17/22 transitions.
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 2 place count 23 transition count 16
Applied a total of 2 rules in 5 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 06:00:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:48] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 06:00:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 06:00:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 06:00:48] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 23/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s7 1)), p2:(OR (LT s11 1) (LT s13 1)), p1:(OR (LT s11 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-15 finished in 444 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621231249507
--------------------
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="GPPP-PT-C1000N0000000010"
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 GPPP-PT-C1000N0000000010, 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 r102-smll-162075331400277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 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 ;