About the Execution of ITS-Tools for GPUForwardProgress-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 892.632 | 92380.00 | 67409.00 | 12309.60 | FTTFTFFTFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156100172.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-20b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156100172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.9K May 11 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 70K May 12 08:13 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GPUForwardProgress-PT-20b-00
FORMULA_NAME GPUForwardProgress-PT-20b-01
FORMULA_NAME GPUForwardProgress-PT-20b-02
FORMULA_NAME GPUForwardProgress-PT-20b-03
FORMULA_NAME GPUForwardProgress-PT-20b-04
FORMULA_NAME GPUForwardProgress-PT-20b-05
FORMULA_NAME GPUForwardProgress-PT-20b-06
FORMULA_NAME GPUForwardProgress-PT-20b-07
FORMULA_NAME GPUForwardProgress-PT-20b-08
FORMULA_NAME GPUForwardProgress-PT-20b-09
FORMULA_NAME GPUForwardProgress-PT-20b-10
FORMULA_NAME GPUForwardProgress-PT-20b-11
FORMULA_NAME GPUForwardProgress-PT-20b-12
FORMULA_NAME GPUForwardProgress-PT-20b-13
FORMULA_NAME GPUForwardProgress-PT-20b-14
FORMULA_NAME GPUForwardProgress-PT-20b-15
=== Now, execution of the tool begins
BK_START 1621272556217
Running Version 0
[2021-05-17 17:29:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 17:29:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 17:29:30] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-17 17:29:30] [INFO ] Transformed 416 places.
[2021-05-17 17:29:30] [INFO ] Transformed 437 transitions.
[2021-05-17 17:29:30] [INFO ] Found NUPN structural information;
[2021-05-17 17:29:30] [INFO ] Parsed PT model containing 416 places and 437 transitions in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 17:29:30] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPUForwardProgress-PT-20b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 437/437 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 415 transition count 437
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 44 place count 372 transition count 394
Iterating global reduction 1 with 43 rules applied. Total rules applied 87 place count 372 transition count 394
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 104 place count 355 transition count 377
Iterating global reduction 1 with 17 rules applied. Total rules applied 121 place count 355 transition count 377
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 135 place count 355 transition count 363
Applied a total of 135 rules in 83 ms. Remains 355 /416 variables (removed 61) and now considering 363/437 (removed 74) transitions.
// Phase 1: matrix 363 rows 355 cols
[2021-05-17 17:29:30] [INFO ] Computed 21 place invariants in 20 ms
[2021-05-17 17:29:31] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 363 rows 355 cols
[2021-05-17 17:29:31] [INFO ] Computed 21 place invariants in 9 ms
[2021-05-17 17:29:31] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
// Phase 1: matrix 363 rows 355 cols
[2021-05-17 17:29:31] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 17:29:31] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Finished structural reductions, in 1 iterations. Remains : 355/416 places, 363/437 transitions.
[2021-05-17 17:29:31] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 17:29:31] [INFO ] Flatten gal took : 54 ms
FORMULA GPUForwardProgress-PT-20b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 17:29:31] [INFO ] Flatten gal took : 25 ms
[2021-05-17 17:29:31] [INFO ] Input system was already deterministic with 363 transitions.
Incomplete random walk after 100000 steps, including 569 resets, run finished after 355 ms. (steps per millisecond=281 ) properties (out of 15) seen :13
Running SMT prover for 2 properties.
// Phase 1: matrix 363 rows 355 cols
[2021-05-17 17:29:32] [INFO ] Computed 21 place invariants in 20 ms
[2021-05-17 17:29:32] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-17 17:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 17:29:32] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-17 17:29:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 17:29:32] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-17 17:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 17:29:32] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-17 17:29:32] [INFO ] Computed and/alt/rep : 357/472/357 causal constraints (skipped 5 transitions) in 35 ms.
[2021-05-17 17:29:33] [INFO ] Added : 110 causal constraints over 22 iterations in 477 ms. Result :sat
[2021-05-17 17:29:33] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-17 17:29:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 17:29:33] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-17 17:29:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 17:29:33] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-17 17:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 17:29:33] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2021-05-17 17:29:33] [INFO ] Computed and/alt/rep : 357/472/357 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-17 17:29:33] [INFO ] Added : 131 causal constraints over 27 iterations in 488 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U p1) U p2)))], workingDir=/home/mcc/execution]
Support contains 7 out of 355 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 355/355 places, 363/363 transitions.
Graph (trivial) has 290 edges and 355 vertex of which 6 / 355 are part of one of the 1 SCC in 8 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 removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 162 place count 349 transition count 195
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 169 rules applied. Total rules applied 331 place count 188 transition count 187
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 336 place count 185 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 338 place count 183 transition count 185
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 338 place count 183 transition count 140
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 428 place count 138 transition count 140
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 538 place count 83 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 539 place count 83 transition count 84
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 540 place count 82 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 541 place count 82 transition count 83
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 5 with 4 rules applied. Total rules applied 545 place count 80 transition count 82
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 548 place count 80 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 549 place count 79 transition count 81
Applied a total of 549 rules in 62 ms. Remains 79 /355 variables (removed 276) and now considering 81/363 (removed 282) transitions.
[2021-05-17 17:29:34] [INFO ] Flow matrix only has 63 transitions (discarded 18 similar events)
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 17:29:34] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:29:34] [INFO ] Implicit Places using invariants in 43 ms returned []
[2021-05-17 17:29:34] [INFO ] Flow matrix only has 63 transitions (discarded 18 similar events)
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 17:29:34] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:29:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 17:29:34] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2021-05-17 17:29:34] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 17:29:34] [INFO ] Flow matrix only has 63 transitions (discarded 18 similar events)
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 17:29:34] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:29:34] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/355 places, 81/363 transitions.
Stuttering acceptance computed with spot in 518 ms :[(NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-20b-03 automaton TGBA [mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s61 0) (EQ s38 1) (EQ s52 0)), p1:(OR (EQ s55 0) (EQ s21 1)), p0:(OR (EQ s2 0) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 102 steps with 4 reset in 4 ms.
FORMULA GPUForwardProgress-PT-20b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-03 finished in 793 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0 U p1)&&X(X(G(p0)))) U X(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 355 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 355/355 places, 363/363 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 355
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 347 transition count 352
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 345 transition count 350
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 345 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 345 transition count 348
Applied a total of 25 rules in 36 ms. Remains 345 /355 variables (removed 10) and now considering 348/363 (removed 15) transitions.
// Phase 1: matrix 348 rows 345 cols
[2021-05-17 17:29:34] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 17:29:34] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 348 rows 345 cols
[2021-05-17 17:29:34] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 17:29:35] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
// Phase 1: matrix 348 rows 345 cols
[2021-05-17 17:29:35] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:29:35] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Finished structural reductions, in 1 iterations. Remains : 345/355 places, 348/363 transitions.
Stuttering acceptance computed with spot in 11739 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20b-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s142 0) (EQ s110 1)), p0:(OR (EQ s50 0) (EQ s28 1)), p2:(NEQ s119 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 454 ms.
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Graph (complete) has 537 edges and 345 vertex of which 321 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Knowledge obtained : [p1, p0, p2]
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1)]
Support contains 5 out of 345 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 345/345 places, 348/348 transitions.
Graph (trivial) has 275 edges and 345 vertex of which 6 / 345 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.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 340 transition count 342
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 27 Pre rules applied. Total rules applied 160 place count 340 transition count 764
Deduced a syphon composed of 186 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 187 place count 340 transition count 764
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 286 place count 241 transition count 425
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 385 place count 241 transition count 425
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 1 with 57 rules applied. Total rules applied 442 place count 241 transition count 425
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 444 place count 241 transition count 423
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 483 place count 202 transition count 384
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 522 place count 202 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 523 place count 202 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 524 place count 201 transition count 383
Deduced a syphon composed of 105 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 525 place count 201 transition count 383
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -165
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 544 place count 201 transition count 548
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 564 place count 181 transition count 508
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 584 place count 181 transition count 508
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 584 rules in 120 ms. Remains 181 /345 variables (removed 164) and now considering 508/348 (removed -160) transitions.
[2021-05-17 17:29:49] [INFO ] Redundant transitions in 31 ms returned []
[2021-05-17 17:29:49] [INFO ] Flow matrix only has 440 transitions (discarded 68 similar events)
// Phase 1: matrix 440 rows 181 cols
[2021-05-17 17:29:49] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 17:29:49] [INFO ] Dead Transitions using invariants and state equation in 202 ms returned []
Finished structural reductions, in 1 iterations. Remains : 181/345 places, 508/348 transitions.
Product exploration explored 100000 steps with 50000 reset in 379 ms.
Product exploration explored 100000 steps with 50000 reset in 330 ms.
[2021-05-17 17:29:50] [INFO ] Flatten gal took : 17 ms
[2021-05-17 17:29:50] [INFO ] Flatten gal took : 17 ms
[2021-05-17 17:29:50] [INFO ] Time to serialize gal into /tmp/LTL7927480899960156918.gal : 9 ms
[2021-05-17 17:29:50] [INFO ] Time to serialize properties into /tmp/LTL17475104322217197841.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7927480899960156918.gal, -t, CGAL, -LTL, /tmp/LTL17475104322217197841.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7927480899960156918.gal -t CGAL -LTL /tmp/LTL17475104322217197841.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((("((p56==0)||(p28==1))")U("((p165==0)||(p128==1))"))&&(X(X(G("((p56==0)||(p28==1))")))))U(X("(p138!=1)"))))
Formula 0 simplified : !((("((p56==0)||(p28==1))" U "((p165==0)||(p128==1))") & XXG"((p56==0)||(p28==1))") U X"(p138!=1)")
Detected timeout of ITS tools.
[2021-05-17 17:30:05] [INFO ] Flatten gal took : 27 ms
[2021-05-17 17:30:05] [INFO ] Applying decomposition
[2021-05-17 17:30:05] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10625957053914216133.txt, -o, /tmp/graph10625957053914216133.bin, -w, /tmp/graph10625957053914216133.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10625957053914216133.bin, -l, -1, -v, -w, /tmp/graph10625957053914216133.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:30:05] [INFO ] Decomposing Gal with order
[2021-05-17 17:30:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:30:05] [INFO ] Removed a total of 48 redundant transitions.
[2021-05-17 17:30:05] [INFO ] Flatten gal took : 56 ms
[2021-05-17 17:30:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 17:30:05] [INFO ] Time to serialize gal into /tmp/LTL16721655428989844935.gal : 7 ms
[2021-05-17 17:30:05] [INFO ] Time to serialize properties into /tmp/LTL1641503754640910543.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16721655428989844935.gal, -t, CGAL, -LTL, /tmp/LTL1641503754640910543.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16721655428989844935.gal -t CGAL -LTL /tmp/LTL1641503754640910543.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((("((i2.u23.p56==0)||(i1.u10.p28==1))")U("((i9.u70.p165==0)||(i6.u43.p128==1))"))&&(X(X(G("((i2.u23.p56==0)||(i1.u10.p28==1))")))))U(X("(i7.u50.p138!=1)"))))
Formula 0 simplified : !((("((i2.u23.p56==0)||(i1.u10.p28==1))" U "((i9.u70.p165==0)||(i6.u43.p128==1))") & XXG"((i2.u23.p56==0)||(i1.u10.p28==1))") U X"(i7.u50.p138!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12329619879580898085
[2021-05-17 17:30:25] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12329619879580898085
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12329619879580898085]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12329619879580898085] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12329619879580898085] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property GPUForwardProgress-PT-20b-04 finished in 52239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 355 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 355/355 places, 363/363 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 356
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 348 transition count 354
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 346 transition count 352
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 346 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 346 transition count 350
Applied a total of 22 rules in 42 ms. Remains 346 /355 variables (removed 9) and now considering 350/363 (removed 13) transitions.
// Phase 1: matrix 350 rows 346 cols
[2021-05-17 17:30:27] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 17:30:27] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 350 rows 346 cols
[2021-05-17 17:30:27] [INFO ] Computed 21 place invariants in 8 ms
[2021-05-17 17:30:27] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
// Phase 1: matrix 350 rows 346 cols
[2021-05-17 17:30:27] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-17 17:30:27] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 1 iterations. Remains : 346/355 places, 350/363 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s83 0) (EQ s266 1)) (AND (EQ s264 0) (EQ s269 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-06 finished in 587 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 355/355 places, 363/363 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 355
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 347 transition count 351
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 345 transition count 349
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 345 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 345 transition count 347
Applied a total of 26 rules in 17 ms. Remains 345 /355 variables (removed 10) and now considering 347/363 (removed 16) transitions.
// Phase 1: matrix 347 rows 345 cols
[2021-05-17 17:30:27] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:30:27] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 347 rows 345 cols
[2021-05-17 17:30:27] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:30:27] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
// Phase 1: matrix 347 rows 345 cols
[2021-05-17 17:30:27] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 17:30:27] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 345/355 places, 347/363 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s69 0) (NEQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-08 finished in 487 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 355 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 355/355 places, 363/363 transitions.
Graph (trivial) has 292 edges and 355 vertex of which 6 / 355 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 removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 162 place count 349 transition count 195
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 171 rules applied. Total rules applied 333 place count 188 transition count 185
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 339 place count 184 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 341 place count 182 transition count 183
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 341 place count 182 transition count 138
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 431 place count 137 transition count 138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 432 place count 136 transition count 137
Iterating global reduction 4 with 1 rules applied. Total rules applied 433 place count 136 transition count 137
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 547 place count 79 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 548 place count 79 transition count 79
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 549 place count 78 transition count 78
Iterating global reduction 5 with 1 rules applied. Total rules applied 550 place count 78 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 552 place count 77 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 553 place count 77 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 554 place count 76 transition count 76
Applied a total of 554 rules in 32 ms. Remains 76 /355 variables (removed 279) and now considering 76/363 (removed 287) transitions.
[2021-05-17 17:30:28] [INFO ] Flow matrix only has 60 transitions (discarded 16 similar events)
// Phase 1: matrix 60 rows 76 cols
[2021-05-17 17:30:28] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:30:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2021-05-17 17:30:28] [INFO ] Flow matrix only has 60 transitions (discarded 16 similar events)
// Phase 1: matrix 60 rows 76 cols
[2021-05-17 17:30:28] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:30:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 17:30:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2021-05-17 17:30:28] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 17:30:28] [INFO ] Flow matrix only has 60 transitions (discarded 16 similar events)
// Phase 1: matrix 60 rows 76 cols
[2021-05-17 17:30:28] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:30:28] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/355 places, 76/363 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p1), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-20b-12 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (EQ s52 1) (OR (EQ s1 0) (EQ s57 1))), p1:(OR (EQ s44 0) (EQ s11 1)), p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-12 finished in 309 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 355/355 places, 363/363 transitions.
Graph (trivial) has 297 edges and 355 vertex of which 6 / 355 are part of one of the 1 SCC in 0 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 removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 166 place count 349 transition count 191
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 175 rules applied. Total rules applied 341 place count 184 transition count 181
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 346 place count 180 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 347 place count 179 transition count 180
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 347 place count 179 transition count 134
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 439 place count 133 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 440 place count 132 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 441 place count 132 transition count 133
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 561 place count 72 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 562 place count 72 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 563 place count 71 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 564 place count 71 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 566 place count 70 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 567 place count 69 transition count 69
Applied a total of 567 rules in 22 ms. Remains 69 /355 variables (removed 286) and now considering 69/363 (removed 294) transitions.
[2021-05-17 17:30:28] [INFO ] Flow matrix only has 50 transitions (discarded 19 similar events)
// Phase 1: matrix 50 rows 69 cols
[2021-05-17 17:30:28] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:30:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2021-05-17 17:30:28] [INFO ] Flow matrix only has 50 transitions (discarded 19 similar events)
// Phase 1: matrix 50 rows 69 cols
[2021-05-17 17:30:28] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:30:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 17:30:28] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2021-05-17 17:30:28] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 17:30:28] [INFO ] Flow matrix only has 50 transitions (discarded 19 similar events)
// Phase 1: matrix 50 rows 69 cols
[2021-05-17 17:30:28] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:30:28] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 69/355 places, 69/363 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s50 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-13 finished in 202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((G(p2)||p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 355 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 355/355 places, 363/363 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 355
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 347 transition count 351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 346 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 346 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 346 transition count 349
Applied a total of 23 rules in 16 ms. Remains 346 /355 variables (removed 9) and now considering 349/363 (removed 14) transitions.
// Phase 1: matrix 349 rows 346 cols
[2021-05-17 17:30:28] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 17:30:28] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 349 rows 346 cols
[2021-05-17 17:30:28] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:30:28] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
// Phase 1: matrix 349 rows 346 cols
[2021-05-17 17:30:28] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 17:30:28] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 1 iterations. Remains : 346/355 places, 349/363 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-20b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s273 1) (OR (EQ s179 0) (EQ s105 1))), p1:(OR (EQ s94 0) (EQ s149 1)), p2:(OR (EQ s179 0) (EQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1553 reset in 183 ms.
Product exploration explored 100000 steps with 1535 reset in 211 ms.
Graph (complete) has 538 edges and 346 vertex of which 322 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 1552 reset in 153 ms.
Product exploration explored 100000 steps with 1542 reset in 313 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 346 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 346/346 places, 349/349 transitions.
Graph (trivial) has 278 edges and 346 vertex of which 6 / 346 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 341 transition count 343
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 24 Pre rules applied. Total rules applied 160 place count 341 transition count 719
Deduced a syphon composed of 183 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 184 place count 341 transition count 719
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 279 place count 246 transition count 420
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 374 place count 246 transition count 420
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 435 place count 246 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 437 place count 246 transition count 418
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 479 place count 204 transition count 376
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 521 place count 204 transition count 376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 522 place count 204 transition count 376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 523 place count 203 transition count 375
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 524 place count 203 transition count 375
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -171
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 545 place count 203 transition count 546
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 565 place count 183 transition count 506
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 585 place count 183 transition count 506
Deduced a syphon composed of 108 places in 0 ms
Applied a total of 585 rules in 48 ms. Remains 183 /346 variables (removed 163) and now considering 506/349 (removed -157) transitions.
[2021-05-17 17:30:30] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-17 17:30:30] [INFO ] Flow matrix only has 446 transitions (discarded 60 similar events)
// Phase 1: matrix 446 rows 183 cols
[2021-05-17 17:30:30] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 17:30:30] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/346 places, 506/349 transitions.
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 2 ms.
FORMULA GPUForwardProgress-PT-20b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-14 finished in 1981 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16609147237376615999
[2021-05-17 17:30:30] [INFO ] Computing symmetric may disable matrix : 363 transitions.
[2021-05-17 17:30:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 17:30:30] [INFO ] Computing symmetric may enable matrix : 363 transitions.
[2021-05-17 17:30:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 17:30:30] [INFO ] Applying decomposition
[2021-05-17 17:30:30] [INFO ] Flatten gal took : 17 ms
[2021-05-17 17:30:30] [INFO ] Computing Do-Not-Accords matrix : 363 transitions.
[2021-05-17 17:30:30] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3518566014904451864.txt, -o, /tmp/graph3518566014904451864.bin, -w, /tmp/graph3518566014904451864.weights], workingDir=null]
[2021-05-17 17:30:30] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16609147237376615999
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16609147237376615999]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3518566014904451864.bin, -l, -1, -v, -w, /tmp/graph3518566014904451864.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:30:30] [INFO ] Decomposing Gal with order
[2021-05-17 17:30:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:30:30] [INFO ] Removed a total of 41 redundant transitions.
[2021-05-17 17:30:30] [INFO ] Flatten gal took : 28 ms
[2021-05-17 17:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-17 17:30:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality8891192484524432314.gal : 12 ms
[2021-05-17 17:30:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality9990386550467429540.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality8891192484524432314.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9990386550467429540.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality8891192484524432314.gal -t CGAL -LTL /tmp/LTLCardinality9990386550467429540.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((("((i2.i2.u22.p56==0)||(i1.i0.u10.p28==1))")U("((i9.i1.u64.p165==0)||(i6.i0.u43.p128==1))"))&&(X(X(G("((i2.i2.u22.p56==0)||(i1.i0.u10.p28==1))")))))U(X("(i7.i0.u52.p138!=1)"))))
Formula 0 simplified : !((("((i2.i2.u22.p56==0)||(i1.i0.u10.p28==1))" U "((i9.i1.u64.p165==0)||(i6.i0.u43.p128==1))") & XXG"((i2.i2.u22.p56==0)||(i1.i0.u10.p28==1))") U X"(i7.i0.u52.p138!=1)")
Compilation finished in 16039 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16609147237376615999]
Link finished in 56 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((((LTLAPp0==true) U (LTLAPp1==true))&&X(X([]((LTLAPp0==true))))) U X((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16609147237376615999]
LTSmin run took 886 ms.
FORMULA GPUForwardProgress-PT-20b-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1621272648597
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-20b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-20b, 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 r292-tall-162124156100172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-20b.tgz
mv GPUForwardProgress-PT-20b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;