About the Execution of ITS-Tools for DiscoveryGPU-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 354.016 | 16351.00 | 28660.00 | 398.80 | TFFFFTTTTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410700315.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DiscoveryGPU-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410700315
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 25 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 28K Mar 5 18:22 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 DiscoveryGPU-PT-08a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678418987714
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 03:29:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 03:29:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 03:29:51] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-10 03:29:51] [INFO ] Transformed 83 places.
[2023-03-10 03:29:51] [INFO ] Transformed 113 transitions.
[2023-03-10 03:29:51] [INFO ] Found NUPN structural information;
[2023-03-10 03:29:51] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 109
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 76 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 76 transition count 106
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 76 transition count 98
Applied a total of 22 rules in 41 ms. Remains 76 /83 variables (removed 7) and now considering 98/113 (removed 15) transitions.
// Phase 1: matrix 98 rows 76 cols
[2023-03-10 03:29:51] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-10 03:29:51] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-10 03:29:51] [INFO ] Invariant cache hit.
[2023-03-10 03:29:52] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-10 03:29:52] [INFO ] Implicit Places using invariants and state equation in 195 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 444 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/83 places, 98/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 489 ms. Remains : 75/83 places, 98/113 transitions.
Support contains 41 out of 75 places after structural reductions.
[2023-03-10 03:29:52] [INFO ] Flatten gal took : 38 ms
[2023-03-10 03:29:52] [INFO ] Flatten gal took : 16 ms
[2023-03-10 03:29:52] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 39 out of 75 places (down from 41) after GAL structural reductions.
Finished random walk after 5860 steps, including 71 resets, run visited all 31 properties in 157 ms. (steps per millisecond=37 )
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 184 edges and 75 vertex of which 71 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p0)))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 65 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 65 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 62 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 62 transition count 85
Applied a total of 26 rules in 11 ms. Remains 62 /75 variables (removed 13) and now considering 85/98 (removed 13) transitions.
// Phase 1: matrix 85 rows 62 cols
[2023-03-10 03:29:53] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-10 03:29:53] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-10 03:29:53] [INFO ] Invariant cache hit.
[2023-03-10 03:29:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:29:53] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-10 03:29:53] [INFO ] Invariant cache hit.
[2023-03-10 03:29:53] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/75 places, 85/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 62/75 places, 85/98 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s53 0) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 73 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-01 finished in 645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&G(p1))) U p0)))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Graph (complete) has 184 edges and 75 vertex of which 72 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 81 edges and 70 vertex of which 59 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 60 edges and 59 vertex of which 30 / 59 are part of one of the 15 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 44 transition count 76
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 33 place count 37 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 32 transition count 51
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 32 transition count 51
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 28 transition count 43
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 28 transition count 43
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 25 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 25 transition count 37
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 22 transition count 34
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 22 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 69 place count 19 transition count 32
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 19 transition count 29
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 14 transition count 24
Applied a total of 77 rules in 37 ms. Remains 14 /75 variables (removed 61) and now considering 24/98 (removed 74) transitions.
[2023-03-10 03:29:53] [INFO ] Flow matrix only has 18 transitions (discarded 6 similar events)
// Phase 1: matrix 18 rows 14 cols
[2023-03-10 03:29:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 03:29:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 03:29:53] [INFO ] Flow matrix only has 18 transitions (discarded 6 similar events)
[2023-03-10 03:29:53] [INFO ] Invariant cache hit.
[2023-03-10 03:29:53] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 03:29:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:29:53] [INFO ] Flow matrix only has 18 transitions (discarded 6 similar events)
[2023-03-10 03:29:53] [INFO ] Invariant cache hit.
[2023-03-10 03:29:53] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/75 places, 24/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 14/75 places, 24/98 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s5 1)), p1:(OR (EQ s12 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-02 finished in 352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 61 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 61 transition count 84
Applied a total of 28 rules in 10 ms. Remains 61 /75 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 61 cols
[2023-03-10 03:29:54] [INFO ] Computed 1 place invariants in 8 ms
[2023-03-10 03:29:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-10 03:29:54] [INFO ] Invariant cache hit.
[2023-03-10 03:29:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:29:54] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-10 03:29:54] [INFO ] Invariant cache hit.
[2023-03-10 03:29:54] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 84/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 61/75 places, 84/98 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (EQ s18 0) (EQ s50 1)), p0:(OR (EQ s58 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24636 reset in 411 ms.
Stack based approach found an accepted trace after 18939 steps with 4705 reset with depth 32 and stack size 30 in 71 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-03 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 61 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 61 transition count 84
Applied a total of 28 rules in 9 ms. Remains 61 /75 variables (removed 14) and now considering 84/98 (removed 14) transitions.
[2023-03-10 03:29:55] [INFO ] Invariant cache hit.
[2023-03-10 03:29:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-10 03:29:55] [INFO ] Invariant cache hit.
[2023-03-10 03:29:55] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:29:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-10 03:29:55] [INFO ] Invariant cache hit.
[2023-03-10 03:29:55] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 84/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 61/75 places, 84/98 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s42 0) (EQ s36 1)), p0:(OR (EQ s42 0) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-04 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 65 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 65 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 63 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 63 transition count 86
Applied a total of 24 rules in 9 ms. Remains 63 /75 variables (removed 12) and now considering 86/98 (removed 12) transitions.
// Phase 1: matrix 86 rows 63 cols
[2023-03-10 03:29:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 03:29:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-10 03:29:55] [INFO ] Invariant cache hit.
[2023-03-10 03:29:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:29:55] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-10 03:29:55] [INFO ] Invariant cache hit.
[2023-03-10 03:29:55] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 86/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 63/75 places, 86/98 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s18 1), p0:(EQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 169 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Detected a total of 10/63 stabilizing places and 9/86 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-05 finished in 1155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 93
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 67 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 67 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 64 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 64 transition count 87
Applied a total of 22 rules in 12 ms. Remains 64 /75 variables (removed 11) and now considering 87/98 (removed 11) transitions.
// Phase 1: matrix 87 rows 64 cols
[2023-03-10 03:29:56] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-10 03:29:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-10 03:29:56] [INFO ] Invariant cache hit.
[2023-03-10 03:29:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:29:56] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-10 03:29:56] [INFO ] Invariant cache hit.
[2023-03-10 03:29:57] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/75 places, 87/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 64/75 places, 87/98 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s48 1)), p1:(OR (EQ s54 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 230 ms.
Product exploration explored 100000 steps with 50000 reset in 333 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 170 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-06 finished in 1156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(G(p2)||p1))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 61 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 61 transition count 84
Applied a total of 28 rules in 8 ms. Remains 61 /75 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 61 cols
[2023-03-10 03:29:57] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 03:29:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-10 03:29:57] [INFO ] Invariant cache hit.
[2023-03-10 03:29:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:29:58] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-10 03:29:58] [INFO ] Invariant cache hit.
[2023-03-10 03:29:58] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 84/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 61/75 places, 84/98 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s42 0) (EQ s34 1)), p2:(OR (EQ s42 0) (EQ s34 1)), p0:(OR (EQ s55 0) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 186 ms.
Product exploration explored 100000 steps with 33333 reset in 199 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 166 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), true, (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-07 finished in 1180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&X(F(p2)))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 69 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 69 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 66 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 66 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 64 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 64 transition count 87
Applied a total of 22 rules in 8 ms. Remains 64 /75 variables (removed 11) and now considering 87/98 (removed 11) transitions.
// Phase 1: matrix 87 rows 64 cols
[2023-03-10 03:29:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 03:29:59] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-10 03:29:59] [INFO ] Invariant cache hit.
[2023-03-10 03:29:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:29:59] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-10 03:29:59] [INFO ] Invariant cache hit.
[2023-03-10 03:29:59] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/75 places, 87/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 64/75 places, 87/98 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s40 0) (EQ s18 1) (EQ s30 0) (EQ s35 1)), p0:(OR (EQ s40 0) (EQ s18 1)), p2:(OR (EQ s60 0) (EQ s57 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 309 ms.
Product exploration explored 100000 steps with 33333 reset in 322 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 170 edges and 64 vertex of which 62 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 8 factoid took 208 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-08 finished in 1319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1))&&F(p2))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 61 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 61 transition count 84
Applied a total of 28 rules in 15 ms. Remains 61 /75 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 61 cols
[2023-03-10 03:30:00] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-10 03:30:00] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-10 03:30:00] [INFO ] Invariant cache hit.
[2023-03-10 03:30:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:30:00] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-10 03:30:00] [INFO ] Invariant cache hit.
[2023-03-10 03:30:00] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 84/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 352 ms. Remains : 61/75 places, 84/98 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s21 1)), p1:(OR (EQ s12 0) (EQ s23 1)), p2:(OR (EQ s10 0) (EQ s21 1) (EQ s12 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-09 finished in 707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(((p2&&F(p3))||p1)))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 69 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 69 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 66 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 66 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 63 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 63 transition count 86
Applied a total of 24 rules in 4 ms. Remains 63 /75 variables (removed 12) and now considering 86/98 (removed 12) transitions.
// Phase 1: matrix 86 rows 63 cols
[2023-03-10 03:30:01] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 03:30:01] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-10 03:30:01] [INFO ] Invariant cache hit.
[2023-03-10 03:30:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:30:01] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-10 03:30:01] [INFO ] Invariant cache hit.
[2023-03-10 03:30:01] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 86/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 63/75 places, 86/98 transitions.
Stuttering acceptance computed with spot in 488 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s37 0) (EQ s46 1) (EQ s54 0) (EQ s60 1)), p1:(OR (EQ s33 0) (EQ s9 1)), p2:(OR (EQ s54 0) (EQ s60 1)), p3:(OR (EQ s60 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2630 steps with 31 reset in 8 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-11 finished in 838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 61 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 61 transition count 84
Applied a total of 28 rules in 4 ms. Remains 61 /75 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 61 cols
[2023-03-10 03:30:01] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 03:30:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-10 03:30:01] [INFO ] Invariant cache hit.
[2023-03-10 03:30:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:30:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-10 03:30:02] [INFO ] Invariant cache hit.
[2023-03-10 03:30:02] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 84/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 61/75 places, 84/98 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s34 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-12 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Graph (complete) has 184 edges and 75 vertex of which 72 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 81 edges and 70 vertex of which 59 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 63 edges and 59 vertex of which 32 / 59 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 43 transition count 76
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 34 place count 36 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 30 transition count 48
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 30 transition count 48
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 25 transition count 38
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 25 transition count 38
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 20 transition count 28
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 20 transition count 28
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 15 transition count 23
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 15 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 13 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 10 transition count 16
Applied a total of 85 rules in 21 ms. Remains 10 /75 variables (removed 65) and now considering 16/98 (removed 82) transitions.
[2023-03-10 03:30:02] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 10 cols
[2023-03-10 03:30:02] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 03:30:02] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-10 03:30:02] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-10 03:30:02] [INFO ] Invariant cache hit.
[2023-03-10 03:30:02] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-10 03:30:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 03:30:02] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-10 03:30:02] [INFO ] Invariant cache hit.
[2023-03-10 03:30:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/75 places, 16/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 10/75 places, 16/98 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s0 0) (EQ s1 1)), p0:(AND (EQ s0 0) (EQ s7 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-13 finished in 326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 61 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 61 transition count 84
Applied a total of 28 rules in 5 ms. Remains 61 /75 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 61 cols
[2023-03-10 03:30:02] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-10 03:30:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-10 03:30:02] [INFO ] Invariant cache hit.
[2023-03-10 03:30:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:30:02] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-10 03:30:02] [INFO ] Invariant cache hit.
[2023-03-10 03:30:02] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 84/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 61/75 places, 84/98 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s45 0) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-15 finished in 413 ms.
All properties solved by simple procedures.
Total runtime 11887 ms.
BK_STOP 1678419004065
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="DiscoveryGPU-PT-08a"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-08a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r133-smll-167819410700315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08a.tgz
mv DiscoveryGPU-PT-08a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;