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.r496-tall-171640603800587.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 ltsminxred
Input is GPUForwardProgress-PT-32b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603800587
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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.1K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 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 160K 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 GPUForwardProgress-PT-32b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717198750091

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:39:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:39:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:39:11] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-31 23:39:11] [INFO ] Transformed 644 places.
[2024-05-31 23:39:11] [INFO ] Transformed 677 transitions.
[2024-05-31 23:39:11] [INFO ] Found NUPN structural information;
[2024-05-31 23:39:11] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 677/677 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 677
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 67 place count 577 transition count 611
Iterating global reduction 1 with 66 rules applied. Total rules applied 133 place count 577 transition count 611
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 162 place count 548 transition count 582
Iterating global reduction 1 with 29 rules applied. Total rules applied 191 place count 548 transition count 582
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 217 place count 548 transition count 556
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 547 transition count 555
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 547 transition count 555
Applied a total of 219 rules in 161 ms. Remains 547 /644 variables (removed 97) and now considering 555/677 (removed 122) transitions.
// Phase 1: matrix 555 rows 547 cols
[2024-05-31 23:39:11] [INFO ] Computed 33 invariants in 27 ms
[2024-05-31 23:39:12] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-31 23:39:12] [INFO ] Invariant cache hit.
[2024-05-31 23:39:12] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 554 sub problems to find dead transitions.
[2024-05-31 23:39:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 555/1101 variables, 546/579 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 1/1102 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 580 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 555/1101 variables, 546/579 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 554/1133 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1101 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (OVERLAPS) 1/1102 variables, 1/1134 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 1134 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 547/644 places, 555/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61130 ms. Remains : 547/644 places, 555/677 transitions.
Support contains 32 out of 547 places after structural reductions.
[2024-05-31 23:40:12] [INFO ] Flatten gal took : 76 ms
[2024-05-31 23:40:13] [INFO ] Flatten gal took : 31 ms
[2024-05-31 23:40:13] [INFO ] Input system was already deterministic with 555 transitions.
Support contains 30 out of 547 places (down from 32) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (145 resets) in 1177 ms. (33 steps per ms) remains 6/17 properties
BEST_FIRST walk for 40004 steps (14 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 66 ms. (597 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
[2024-05-31 23:40:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 159/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 377/546 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 555/1101 variables, 546/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1101 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/1102 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1102 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1102 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 580 constraints, problems are : Problem set: 0 solved, 5 unsolved in 466 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 159/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 377/546 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 555/1101 variables, 546/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1101 variables, 5/584 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1101 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1102 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1102 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1102 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 585 constraints, problems are : Problem set: 0 solved, 5 unsolved in 607 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1089ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 338 steps, including 0 resets, run visited all 5 properties in 11 ms. (steps per millisecond=30 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 17 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 102 stabilizing places and 102 stable transitions
Graph (complete) has 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.20 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 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 555/555 transitions.
Graph (trivial) has 452 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 263 place count 541 transition count 286
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 270 rules applied. Total rules applied 533 place count 279 transition count 278
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 537 place count 276 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 538 place count 275 transition count 277
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 69 Pre rules applied. Total rules applied 538 place count 275 transition count 208
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 676 place count 206 transition count 208
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 864 place count 112 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 865 place count 112 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 866 place count 111 transition count 112
Iterating global reduction 5 with 1 rules applied. Total rules applied 867 place count 111 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 871 place count 109 transition count 111
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 873 place count 109 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 874 place count 108 transition count 110
Applied a total of 874 rules in 95 ms. Remains 108 /547 variables (removed 439) and now considering 110/555 (removed 445) transitions.
[2024-05-31 23:40:15] [INFO ] Flow matrix only has 80 transitions (discarded 30 similar events)
// Phase 1: matrix 80 rows 108 cols
[2024-05-31 23:40:15] [INFO ] Computed 33 invariants in 1 ms
[2024-05-31 23:40:15] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 23:40:15] [INFO ] Flow matrix only has 80 transitions (discarded 30 similar events)
[2024-05-31 23:40:15] [INFO ] Invariant cache hit.
[2024-05-31 23:40:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:40:15] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-31 23:40:15] [INFO ] Redundant transitions in 2 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-31 23:40:15] [INFO ] Flow matrix only has 80 transitions (discarded 30 similar events)
[2024-05-31 23:40:15] [INFO ] Invariant cache hit.
[2024-05-31 23:40:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 14/108 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 79/187 variables, 108/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/188 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 142 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1960 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 14/108 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 79/187 variables, 108/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 83/224 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/188 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 225 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3637 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 5711ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5712ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/547 places, 110/555 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6027 ms. Remains : 108/547 places, 110/555 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-01 finished in 6240 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)&&F(G(p2)))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 555/555 transitions.
Graph (trivial) has 452 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 264 place count 541 transition count 285
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 271 rules applied. Total rules applied 535 place count 278 transition count 277
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 538 place count 275 transition count 277
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 538 place count 275 transition count 208
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 676 place count 206 transition count 208
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 868 place count 110 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 869 place count 110 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 870 place count 109 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 871 place count 109 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 875 place count 107 transition count 109
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 877 place count 107 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 878 place count 106 transition count 108
Applied a total of 878 rules in 65 ms. Remains 106 /547 variables (removed 441) and now considering 108/555 (removed 447) transitions.
[2024-05-31 23:40:21] [INFO ] Flow matrix only has 77 transitions (discarded 31 similar events)
// Phase 1: matrix 77 rows 106 cols
[2024-05-31 23:40:21] [INFO ] Computed 33 invariants in 0 ms
[2024-05-31 23:40:21] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-31 23:40:21] [INFO ] Flow matrix only has 77 transitions (discarded 31 similar events)
[2024-05-31 23:40:21] [INFO ] Invariant cache hit.
[2024-05-31 23:40:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:40:21] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-31 23:40:21] [INFO ] Redundant transitions in 2 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-31 23:40:21] [INFO ] Flow matrix only has 77 transitions (discarded 31 similar events)
[2024-05-31 23:40:21] [INFO ] Invariant cache hit.
[2024-05-31 23:40:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 32/106 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 76/182 variables, 106/139 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 1/183 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 140 constraints, problems are : Problem set: 0 solved, 42 unsolved in 849 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 32/106 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 76/182 variables, 106/139 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/183 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 182 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1712 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 2609ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/547 places, 108/555 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2946 ms. Remains : 106/547 places, 108/555 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-02 finished in 3111 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(F(p0)))))'
Support contains 1 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 555/555 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 538 transition count 546
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 538 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 538 transition count 542
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 536 transition count 540
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 536 transition count 540
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 536 transition count 538
Applied a total of 28 rules in 67 ms. Remains 536 /547 variables (removed 11) and now considering 538/555 (removed 17) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-31 23:40:24] [INFO ] Computed 33 invariants in 3 ms
[2024-05-31 23:40:24] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-31 23:40:24] [INFO ] Invariant cache hit.
[2024-05-31 23:40:24] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-31 23:40:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 536/547 places, 538/555 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60689 ms. Remains : 536/547 places, 538/555 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-07
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-07 finished in 60845 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(G(p0)))'
Support contains 1 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 555/555 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 538 transition count 546
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 538 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 538 transition count 542
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 536 transition count 540
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 536 transition count 540
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 536 transition count 538
Applied a total of 28 rules in 29 ms. Remains 536 /547 variables (removed 11) and now considering 538/555 (removed 17) transitions.
[2024-05-31 23:41:25] [INFO ] Invariant cache hit.
[2024-05-31 23:41:25] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 23:41:25] [INFO ] Invariant cache hit.
[2024-05-31 23:41:25] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-31 23:41:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 536/547 places, 538/555 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60608 ms. Remains : 536/547 places, 538/555 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-09 finished in 60705 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(p0)&&(p1 U p2)&&F(p3))))'
Support contains 8 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 555/555 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 542 transition count 550
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 542 transition count 550
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 542 transition count 548
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 540 transition count 546
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 540 transition count 546
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 540 transition count 544
Applied a total of 18 rules in 35 ms. Remains 540 /547 variables (removed 7) and now considering 544/555 (removed 11) transitions.
// Phase 1: matrix 544 rows 540 cols
[2024-05-31 23:42:26] [INFO ] Computed 33 invariants in 2 ms
[2024-05-31 23:42:26] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-31 23:42:26] [INFO ] Invariant cache hit.
[2024-05-31 23:42:26] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 543 sub problems to find dead transitions.
[2024-05-31 23:42:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 544/1083 variables, 539/572 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1/1084 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 573 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/540 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 544/1083 variables, 539/572 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 543/1115 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (OVERLAPS) 1/1084 variables, 1/1116 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 1116 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/540 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 540/547 places, 544/555 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60618 ms. Remains : 540/547 places, 544/555 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p2) (NOT p3) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-12 finished in 60862 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 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 555/555 transitions.
Graph (trivial) has 450 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 846 edges and 542 vertex of which 506 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 259 rules applied. Total rules applied 261 place count 505 transition count 286
Reduce places removed 259 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 268 rules applied. Total rules applied 529 place count 246 transition count 277
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 534 place count 242 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 535 place count 241 transition count 276
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 535 place count 241 transition count 210
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 667 place count 175 transition count 210
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 697 place count 145 transition count 180
Iterating global reduction 4 with 30 rules applied. Total rules applied 727 place count 145 transition count 180
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 921 place count 48 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 922 place count 48 transition count 82
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 951 place count 19 transition count 25
Iterating global reduction 5 with 29 rules applied. Total rules applied 980 place count 19 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 986 place count 16 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 987 place count 15 transition count 23
Applied a total of 987 rules in 24 ms. Remains 15 /547 variables (removed 532) and now considering 23/555 (removed 532) transitions.
[2024-05-31 23:43:26] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 15 cols
[2024-05-31 23:43:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:43:26] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 23:43:26] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2024-05-31 23:43:26] [INFO ] Invariant cache hit.
[2024-05-31 23:43:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:43:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-31 23:43:26] [INFO ] Redundant transitions in 14 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-31 23:43:26] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2024-05-31 23:43:26] [INFO ] Invariant cache hit.
[2024-05-31 23:43:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/35 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 16 constraints, problems are : Problem set: 0 solved, 20 unsolved in 168 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/35 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 174 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 349ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 349ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/547 places, 23/555 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 15/547 places, 23/555 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-13
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-13 finished in 487 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)&&F((X(X(p3))&&p2)))))'
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 555/555 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 538 transition count 546
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 538 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 538 transition count 542
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 536 transition count 540
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 536 transition count 540
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 536 transition count 538
Applied a total of 28 rules in 26 ms. Remains 536 /547 variables (removed 11) and now considering 538/555 (removed 17) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-31 23:43:27] [INFO ] Computed 33 invariants in 3 ms
[2024-05-31 23:43:27] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-31 23:43:27] [INFO ] Invariant cache hit.
[2024-05-31 23:43:27] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-31 23:43:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 536/547 places, 538/555 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60577 ms. Remains : 536/547 places, 538/555 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-14
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-14 finished in 60950 ms.
All properties solved by simple procedures.
Total runtime 317080 ms.
ITS solved all properties within timeout

BK_STOP 1717199068305

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPUForwardProgress-PT-32b, 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 r496-tall-171640603800587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-32b.tgz
mv GPUForwardProgress-PT-32b 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;