Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132600428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DiscoveryGPU-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132600428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 02:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 02:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 36K May 18 16:42 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-10a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716377179061

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 11:26:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 11:26:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:26:20] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-22 11:26:20] [INFO ] Transformed 103 places.
[2024-05-22 11:26:20] [INFO ] Transformed 141 transitions.
[2024-05-22 11:26:20] [INFO ] Found NUPN structural information;
[2024-05-22 11:26:20] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 95 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 95 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 92 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 92 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 92 transition count 120
Applied a total of 29 rules in 33 ms. Remains 92 /103 variables (removed 11) and now considering 120/141 (removed 21) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-22 11:26:20] [INFO ] Computed 2 invariants in 11 ms
[2024-05-22 11:26:20] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-22 11:26:20] [INFO ] Invariant cache hit.
[2024-05-22 11:26:20] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 11:26:20] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-22 11:26:20] [INFO ] Invariant cache hit.
[2024-05-22 11:26:20] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 77/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 171 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2720 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 77/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 119/290 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 290 constraints, problems are : Problem set: 0 solved, 119 unsolved in 1869 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4646ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4660ms
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 120/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5081 ms. Remains : 92/103 places, 120/141 transitions.
Support contains 25 out of 92 places after structural reductions.
[2024-05-22 11:26:25] [INFO ] Flatten gal took : 26 ms
[2024-05-22 11:26:25] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:26:25] [INFO ] Input system was already deterministic with 120 transitions.
Support contains 24 out of 92 places (down from 25) after GAL structural reductions.
RANDOM walk for 11047 steps (100 resets) in 328 ms. (33 steps per ms) remains 0/21 properties
FORMULA DiscoveryGPU-PT-10a-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 267 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 86 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 86 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 80 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 80 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 77 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 77 transition count 105
Applied a total of 30 rules in 8 ms. Remains 77 /92 variables (removed 15) and now considering 105/120 (removed 15) transitions.
// Phase 1: matrix 105 rows 77 cols
[2024-05-22 11:26:26] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:26:26] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 11:26:26] [INFO ] Invariant cache hit.
[2024-05-22 11:26:26] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:26:26] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-22 11:26:26] [INFO ] Invariant cache hit.
[2024-05-22 11:26:26] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/182 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 71/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 150 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/182 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 71/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 104/254 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 254 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1453 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3411ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3412ms
Starting structural reductions in LTL mode, iteration 1 : 77/92 places, 105/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3549 ms. Remains : 77/92 places, 105/120 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 77 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-00 finished in 3887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 86 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 86 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 80 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 80 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 76 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 76 transition count 104
Applied a total of 32 rules in 7 ms. Remains 76 /92 variables (removed 16) and now considering 104/120 (removed 16) transitions.
// Phase 1: matrix 104 rows 76 cols
[2024-05-22 11:26:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:26:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 11:26:30] [INFO ] Invariant cache hit.
[2024-05-22 11:26:30] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:26:30] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 203 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/92 places, 104/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 212 ms. Remains : 75/92 places, 104/120 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-01 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 86 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 86 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 84 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 84 transition count 112
Applied a total of 16 rules in 7 ms. Remains 84 /92 variables (removed 8) and now considering 112/120 (removed 8) transitions.
// Phase 1: matrix 112 rows 84 cols
[2024-05-22 11:26:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:26:30] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 11:26:30] [INFO ] Invariant cache hit.
[2024-05-22 11:26:30] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-22 11:26:30] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/92 places, 112/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 83/92 places, 112/120 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-06 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Graph (complete) has 267 edges and 92 vertex of which 88 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 88 transition count 109
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 81 transition count 109
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 20 place count 76 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 25 place count 76 transition count 104
Applied a total of 25 rules in 25 ms. Remains 76 /92 variables (removed 16) and now considering 104/120 (removed 16) transitions.
// Phase 1: matrix 104 rows 76 cols
[2024-05-22 11:26:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:26:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 11:26:30] [INFO ] Invariant cache hit.
[2024-05-22 11:26:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 11:26:30] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-22 11:26:30] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-22 11:26:30] [INFO ] Invariant cache hit.
[2024-05-22 11:26:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 72/150 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 150 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1781 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 72/150 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 103/253 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 253 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1464 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 3260ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 3262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/92 places, 104/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3419 ms. Remains : 76/92 places, 104/120 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-07
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-07 finished in 3468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Graph (complete) has 267 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 87 transition count 109
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 81 transition count 109
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 76 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 76 transition count 104
Applied a total of 23 rules in 12 ms. Remains 76 /92 variables (removed 16) and now considering 104/120 (removed 16) transitions.
// Phase 1: matrix 104 rows 76 cols
[2024-05-22 11:26:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:26:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 11:26:34] [INFO ] Invariant cache hit.
[2024-05-22 11:26:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 11:26:34] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 132 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/92 places, 104/120 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 55 transition count 84
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 47 transition count 68
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 47 transition count 68
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 39 transition count 52
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 39 transition count 52
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 31 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 31 transition count 44
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 23 transition count 28
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 23 transition count 28
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 15 transition count 20
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 15 transition count 20
Applied a total of 120 rules in 13 ms. Remains 15 /75 variables (removed 60) and now considering 20/104 (removed 84) transitions.
[2024-05-22 11:26:34] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2024-05-22 11:26:34] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:26:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 11:26:34] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2024-05-22 11:26:34] [INFO ] Invariant cache hit.
[2024-05-22 11:26:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:26:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/92 places, 20/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 15/92 places, 20/120 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-08 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(p1))))))'
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Graph (complete) has 267 edges and 92 vertex of which 88 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 88 transition count 109
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 81 transition count 109
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 20 place count 76 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 25 place count 76 transition count 104
Applied a total of 25 rules in 17 ms. Remains 76 /92 variables (removed 16) and now considering 104/120 (removed 16) transitions.
// Phase 1: matrix 104 rows 76 cols
[2024-05-22 11:26:34] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:26:34] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 11:26:34] [INFO ] Invariant cache hit.
[2024-05-22 11:26:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 11:26:34] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/92 places, 104/120 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 56 transition count 85
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 48 transition count 69
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 48 transition count 69
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 40 transition count 53
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 40 transition count 53
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 33 transition count 46
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 33 transition count 46
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 26 transition count 32
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 26 transition count 32
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 19 transition count 25
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 19 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 113 place count 19 transition count 25
Applied a total of 113 rules in 14 ms. Remains 19 /75 variables (removed 56) and now considering 25/104 (removed 79) transitions.
[2024-05-22 11:26:34] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 19 cols
[2024-05-22 11:26:34] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:26:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 11:26:34] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2024-05-22 11:26:34] [INFO ] Invariant cache hit.
[2024-05-22 11:26:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 11:26:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/92 places, 25/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 200 ms. Remains : 19/92 places, 25/120 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-09
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-09 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Graph (complete) has 267 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 87 transition count 108
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 80 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 74 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 74 transition count 102
Applied a total of 27 rules in 11 ms. Remains 74 /92 variables (removed 18) and now considering 102/120 (removed 18) transitions.
// Phase 1: matrix 102 rows 74 cols
[2024-05-22 11:26:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:26:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 11:26:34] [INFO ] Invariant cache hit.
[2024-05-22 11:26:35] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:26:35] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/92 places, 102/120 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 54 transition count 83
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 46 transition count 67
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 46 transition count 67
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 38 transition count 51
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 38 transition count 51
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 30 transition count 43
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 30 transition count 43
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 22 transition count 27
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 22 transition count 27
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 110 place count 14 transition count 19
Iterating global reduction 0 with 8 rules applied. Total rules applied 118 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 14 transition count 19
Applied a total of 119 rules in 9 ms. Remains 14 /73 variables (removed 59) and now considering 19/102 (removed 83) transitions.
[2024-05-22 11:26:35] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-22 11:26:35] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:26:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 11:26:35] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2024-05-22 11:26:35] [INFO ] Invariant cache hit.
[2024-05-22 11:26:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:26:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/92 places, 19/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 14/92 places, 19/120 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-11
Stuttering criterion allowed to conclude after 95 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-11 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Graph (complete) has 267 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 87 transition count 108
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 80 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 74 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 74 transition count 102
Applied a total of 27 rules in 12 ms. Remains 74 /92 variables (removed 18) and now considering 102/120 (removed 18) transitions.
// Phase 1: matrix 102 rows 74 cols
[2024-05-22 11:26:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:26:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 11:26:35] [INFO ] Invariant cache hit.
[2024-05-22 11:26:35] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:26:35] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-22 11:26:35] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-22 11:26:35] [INFO ] Invariant cache hit.
[2024-05-22 11:26:35] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/176 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 71/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/176 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 147 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/176 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 71/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 101/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/176 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 248 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 3096ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 3097ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/92 places, 102/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3217 ms. Remains : 74/92 places, 102/120 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-12
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 6 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-12 finished in 3262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Graph (complete) has 267 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 87 transition count 108
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 80 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 74 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 74 transition count 102
Applied a total of 27 rules in 11 ms. Remains 74 /92 variables (removed 18) and now considering 102/120 (removed 18) transitions.
[2024-05-22 11:26:38] [INFO ] Invariant cache hit.
[2024-05-22 11:26:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:26:38] [INFO ] Invariant cache hit.
[2024-05-22 11:26:38] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:26:38] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-22 11:26:38] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-22 11:26:38] [INFO ] Invariant cache hit.
[2024-05-22 11:26:38] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/176 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 71/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/176 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 147 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1755 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/176 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 71/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 101/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/176 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 248 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1372 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 3142ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 3144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/92 places, 102/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3273 ms. Remains : 74/92 places, 102/120 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-13
Stuttering criterion allowed to conclude after 139 steps with 2 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-13 finished in 3422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((p1||X(((p2 U p0) U (p1&&(p2 U p0))))))))'
Support contains 3 out of 92 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Graph (complete) has 267 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 87 transition count 108
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 80 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 74 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 74 transition count 102
Applied a total of 27 rules in 11 ms. Remains 74 /92 variables (removed 18) and now considering 102/120 (removed 18) transitions.
[2024-05-22 11:26:41] [INFO ] Invariant cache hit.
[2024-05-22 11:26:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:26:41] [INFO ] Invariant cache hit.
[2024-05-22 11:26:41] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:26:41] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 116 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/92 places, 102/120 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 54 transition count 83
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 46 transition count 67
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 46 transition count 67
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 39 transition count 53
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 39 transition count 53
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 32 transition count 46
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 32 transition count 46
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 25 transition count 32
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 25 transition count 32
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 19 transition count 26
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 19 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 109 place count 19 transition count 26
Applied a total of 109 rules in 8 ms. Remains 19 /73 variables (removed 54) and now considering 26/102 (removed 76) transitions.
[2024-05-22 11:26:41] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2024-05-22 11:26:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:26:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 11:26:41] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2024-05-22 11:26:41] [INFO ] Invariant cache hit.
[2024-05-22 11:26:42] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:26:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/92 places, 26/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 19/92 places, 26/120 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-14 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((X(p0)&&(p1||(!p1 U (p2||G(!p1)))))))))'
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 120/120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 86 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 86 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 80 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 80 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 76 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 76 transition count 104
Applied a total of 32 rules in 7 ms. Remains 76 /92 variables (removed 16) and now considering 104/120 (removed 16) transitions.
// Phase 1: matrix 104 rows 76 cols
[2024-05-22 11:26:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:26:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 11:26:42] [INFO ] Invariant cache hit.
[2024-05-22 11:26:42] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:26:42] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-22 11:26:42] [INFO ] Invariant cache hit.
[2024-05-22 11:26:42] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 149 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 252 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 3390ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 3391ms
Starting structural reductions in LTL mode, iteration 1 : 76/92 places, 104/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3507 ms. Remains : 76/92 places, 104/120 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-15 finished in 3904 ms.
All properties solved by simple procedures.
Total runtime 25834 ms.

BK_STOP 1716377206038

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-10a"
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-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-10a, 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 r136-tall-171631132600428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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