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.r216-tall-162098205700812.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 ShieldPPPt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205700812
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 128K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 569K May 5 16:52 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 ShieldPPPt-PT-030B-00
FORMULA_NAME ShieldPPPt-PT-030B-01
FORMULA_NAME ShieldPPPt-PT-030B-02
FORMULA_NAME ShieldPPPt-PT-030B-03
FORMULA_NAME ShieldPPPt-PT-030B-04
FORMULA_NAME ShieldPPPt-PT-030B-05
FORMULA_NAME ShieldPPPt-PT-030B-06
FORMULA_NAME ShieldPPPt-PT-030B-07
FORMULA_NAME ShieldPPPt-PT-030B-08
FORMULA_NAME ShieldPPPt-PT-030B-09
FORMULA_NAME ShieldPPPt-PT-030B-10
FORMULA_NAME ShieldPPPt-PT-030B-11
FORMULA_NAME ShieldPPPt-PT-030B-12
FORMULA_NAME ShieldPPPt-PT-030B-13
FORMULA_NAME ShieldPPPt-PT-030B-14
FORMULA_NAME ShieldPPPt-PT-030B-15

=== Now, execution of the tool begins

BK_START 1621181446151

Running Version 0
[2021-05-16 16:10:47] [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-16 16:10:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 16:10:47] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2021-05-16 16:10:47] [INFO ] Transformed 2343 places.
[2021-05-16 16:10:47] [INFO ] Transformed 2133 transitions.
[2021-05-16 16:10:47] [INFO ] Found NUPN structural information;
[2021-05-16 16:10:47] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 16:10:47] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldPPPt-PT-030B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 2343 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 2022 transition count 1812
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 2022 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 2021 transition count 1811
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 2021 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 645 place count 2020 transition count 1810
Iterating global reduction 0 with 1 rules applied. Total rules applied 646 place count 2020 transition count 1810
Applied a total of 646 rules in 1025 ms. Remains 2020 /2343 variables (removed 323) and now considering 1810/2133 (removed 323) transitions.
// Phase 1: matrix 1810 rows 2020 cols
[2021-05-16 16:10:49] [INFO ] Computed 331 place invariants in 32 ms
[2021-05-16 16:10:49] [INFO ] Implicit Places using invariants in 789 ms returned []
// Phase 1: matrix 1810 rows 2020 cols
[2021-05-16 16:10:49] [INFO ] Computed 331 place invariants in 15 ms
[2021-05-16 16:10:51] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
// Phase 1: matrix 1810 rows 2020 cols
[2021-05-16 16:10:51] [INFO ] Computed 331 place invariants in 6 ms
[2021-05-16 16:10:52] [INFO ] Dead Transitions using invariants and state equation in 1039 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2020/2343 places, 1810/2133 transitions.
[2021-05-16 16:10:52] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 16:10:52] [INFO ] Flatten gal took : 147 ms
FORMULA ShieldPPPt-PT-030B-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 16:10:52] [INFO ] Flatten gal took : 89 ms
[2021-05-16 16:10:53] [INFO ] Input system was already deterministic with 1810 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 775 ms. (steps per millisecond=129 ) properties (out of 10) seen :6
Running SMT prover for 4 properties.
// Phase 1: matrix 1810 rows 2020 cols
[2021-05-16 16:10:53] [INFO ] Computed 331 place invariants in 6 ms
[2021-05-16 16:10:54] [INFO ] [Real]Absence check using 331 positive place invariants in 92 ms returned sat
[2021-05-16 16:10:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:10:54] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2021-05-16 16:10:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:10:55] [INFO ] [Nat]Absence check using 331 positive place invariants in 93 ms returned sat
[2021-05-16 16:10:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:10:55] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2021-05-16 16:10:56] [INFO ] Deduced a trap composed of 19 places in 428 ms of which 4 ms to minimize.
[2021-05-16 16:10:56] [INFO ] Deduced a trap composed of 27 places in 415 ms of which 2 ms to minimize.
[2021-05-16 16:10:57] [INFO ] Deduced a trap composed of 31 places in 423 ms of which 1 ms to minimize.
[2021-05-16 16:10:57] [INFO ] Deduced a trap composed of 20 places in 397 ms of which 2 ms to minimize.
[2021-05-16 16:10:58] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 1 ms to minimize.
[2021-05-16 16:10:58] [INFO ] Deduced a trap composed of 16 places in 396 ms of which 1 ms to minimize.
[2021-05-16 16:10:59] [INFO ] Deduced a trap composed of 18 places in 372 ms of which 4 ms to minimize.
[2021-05-16 16:10:59] [INFO ] Deduced a trap composed of 16 places in 392 ms of which 1 ms to minimize.
[2021-05-16 16:11:00] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 1 ms to minimize.
[2021-05-16 16:11:00] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 1 ms to minimize.
[2021-05-16 16:11:00] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 1 ms to minimize.
[2021-05-16 16:11:01] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 1 ms to minimize.
[2021-05-16 16:11:01] [INFO ] Deduced a trap composed of 18 places in 338 ms of which 2 ms to minimize.
[2021-05-16 16:11:02] [INFO ] Deduced a trap composed of 31 places in 320 ms of which 1 ms to minimize.
[2021-05-16 16:11:02] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 1 ms to minimize.
[2021-05-16 16:11:02] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 1 ms to minimize.
[2021-05-16 16:11:03] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 1 ms to minimize.
[2021-05-16 16:11:03] [INFO ] Deduced a trap composed of 28 places in 306 ms of which 1 ms to minimize.
[2021-05-16 16:11:03] [INFO ] Deduced a trap composed of 28 places in 299 ms of which 1 ms to minimize.
[2021-05-16 16:11:04] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 0 ms to minimize.
[2021-05-16 16:11:04] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 0 ms to minimize.
[2021-05-16 16:11:04] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 1 ms to minimize.
[2021-05-16 16:11:05] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 1 ms to minimize.
[2021-05-16 16:11:05] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 0 ms to minimize.
[2021-05-16 16:11:05] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 1 ms to minimize.
[2021-05-16 16:11:06] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 0 ms to minimize.
[2021-05-16 16:11:06] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 1 ms to minimize.
[2021-05-16 16:11:06] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 1 ms to minimize.
[2021-05-16 16:11:07] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2021-05-16 16:11:07] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 1 ms to minimize.
[2021-05-16 16:11:07] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 0 ms to minimize.
[2021-05-16 16:11:08] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 1 ms to minimize.
[2021-05-16 16:11:08] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 1 ms to minimize.
[2021-05-16 16:11:08] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 5 ms to minimize.
[2021-05-16 16:11:08] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 1 ms to minimize.
[2021-05-16 16:11:09] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 0 ms to minimize.
[2021-05-16 16:11:09] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 1 ms to minimize.
[2021-05-16 16:11:09] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 0 ms to minimize.
[2021-05-16 16:11:09] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 0 ms to minimize.
[2021-05-16 16:11:10] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 1 ms to minimize.
[2021-05-16 16:11:10] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2021-05-16 16:11:10] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 0 ms to minimize.
[2021-05-16 16:11:10] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 0 ms to minimize.
[2021-05-16 16:11:10] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 0 ms to minimize.
[2021-05-16 16:11:11] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 1 ms to minimize.
[2021-05-16 16:11:11] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 1 ms to minimize.
[2021-05-16 16:11:11] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2021-05-16 16:11:11] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 1 ms to minimize.
[2021-05-16 16:11:11] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 1 ms to minimize.
[2021-05-16 16:11:12] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 16222 ms
[2021-05-16 16:11:12] [INFO ] Computed and/alt/rep : 1809/2685/1809 causal constraints (skipped 0 transitions) in 93 ms.
[2021-05-16 16:11:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-16 16:11:15] [INFO ] [Real]Absence check using 331 positive place invariants in 96 ms returned sat
[2021-05-16 16:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:11:15] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2021-05-16 16:11:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:11:16] [INFO ] [Nat]Absence check using 331 positive place invariants in 92 ms returned sat
[2021-05-16 16:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:11:16] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2021-05-16 16:11:17] [INFO ] Deduced a trap composed of 19 places in 397 ms of which 1 ms to minimize.
[2021-05-16 16:11:17] [INFO ] Deduced a trap composed of 22 places in 378 ms of which 1 ms to minimize.
[2021-05-16 16:11:18] [INFO ] Deduced a trap composed of 26 places in 371 ms of which 1 ms to minimize.
[2021-05-16 16:11:18] [INFO ] Deduced a trap composed of 24 places in 367 ms of which 1 ms to minimize.
[2021-05-16 16:11:18] [INFO ] Deduced a trap composed of 16 places in 363 ms of which 1 ms to minimize.
[2021-05-16 16:11:19] [INFO ] Deduced a trap composed of 18 places in 361 ms of which 1 ms to minimize.
[2021-05-16 16:11:19] [INFO ] Deduced a trap composed of 18 places in 355 ms of which 1 ms to minimize.
[2021-05-16 16:11:20] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 1 ms to minimize.
[2021-05-16 16:11:20] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 1 ms to minimize.
[2021-05-16 16:11:21] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 1 ms to minimize.
[2021-05-16 16:11:21] [INFO ] Deduced a trap composed of 28 places in 332 ms of which 1 ms to minimize.
[2021-05-16 16:11:21] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 1 ms to minimize.
[2021-05-16 16:11:22] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 1 ms to minimize.
[2021-05-16 16:11:22] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 1 ms to minimize.
[2021-05-16 16:11:22] [INFO ] Deduced a trap composed of 20 places in 304 ms of which 1 ms to minimize.
[2021-05-16 16:11:23] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 0 ms to minimize.
[2021-05-16 16:11:23] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 0 ms to minimize.
[2021-05-16 16:11:23] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 1 ms to minimize.
[2021-05-16 16:11:24] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 1 ms to minimize.
[2021-05-16 16:11:24] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 1 ms to minimize.
[2021-05-16 16:11:24] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2021-05-16 16:11:25] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 1 ms to minimize.
[2021-05-16 16:11:25] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 0 ms to minimize.
[2021-05-16 16:11:25] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 2 ms to minimize.
[2021-05-16 16:11:26] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 1 ms to minimize.
[2021-05-16 16:11:26] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 1 ms to minimize.
[2021-05-16 16:11:26] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 0 ms to minimize.
[2021-05-16 16:11:26] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 1 ms to minimize.
[2021-05-16 16:11:27] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 1 ms to minimize.
[2021-05-16 16:11:27] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2021-05-16 16:11:27] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 0 ms to minimize.
[2021-05-16 16:11:28] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 1 ms to minimize.
[2021-05-16 16:11:28] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 1 ms to minimize.
[2021-05-16 16:11:28] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 1 ms to minimize.
[2021-05-16 16:11:28] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 1 ms to minimize.
[2021-05-16 16:11:29] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 1 ms to minimize.
[2021-05-16 16:11:29] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 1 ms to minimize.
[2021-05-16 16:11:29] [INFO ] Deduced a trap composed of 57 places in 181 ms of which 0 ms to minimize.
[2021-05-16 16:11:29] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 0 ms to minimize.
[2021-05-16 16:11:30] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 1 ms to minimize.
[2021-05-16 16:11:30] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 1 ms to minimize.
[2021-05-16 16:11:30] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2021-05-16 16:11:30] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 1 ms to minimize.
[2021-05-16 16:11:30] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2021-05-16 16:11:31] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 1 ms to minimize.
[2021-05-16 16:11:31] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 1 ms to minimize.
[2021-05-16 16:11:31] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 0 ms to minimize.
[2021-05-16 16:11:31] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 0 ms to minimize.
[2021-05-16 16:11:31] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 0 ms to minimize.
[2021-05-16 16:11:32] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2021-05-16 16:11:32] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 15307 ms
[2021-05-16 16:11:32] [INFO ] Computed and/alt/rep : 1809/2685/1809 causal constraints (skipped 0 transitions) in 93 ms.
[2021-05-16 16:11:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-16 16:11:36] [INFO ] [Real]Absence check using 331 positive place invariants in 93 ms returned sat
[2021-05-16 16:11:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:11:36] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2021-05-16 16:11:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:11:37] [INFO ] [Nat]Absence check using 331 positive place invariants in 93 ms returned sat
[2021-05-16 16:11:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:11:37] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2021-05-16 16:11:38] [INFO ] Deduced a trap composed of 27 places in 465 ms of which 1 ms to minimize.
[2021-05-16 16:11:38] [INFO ] Deduced a trap composed of 16 places in 461 ms of which 1 ms to minimize.
[2021-05-16 16:11:39] [INFO ] Deduced a trap composed of 16 places in 455 ms of which 1 ms to minimize.
[2021-05-16 16:11:39] [INFO ] Deduced a trap composed of 17 places in 447 ms of which 2 ms to minimize.
[2021-05-16 16:11:40] [INFO ] Deduced a trap composed of 17 places in 442 ms of which 1 ms to minimize.
[2021-05-16 16:11:40] [INFO ] Deduced a trap composed of 28 places in 432 ms of which 1 ms to minimize.
[2021-05-16 16:11:41] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2021-05-16 16:11:41] [INFO ] Deduced a trap composed of 18 places in 418 ms of which 1 ms to minimize.
[2021-05-16 16:11:42] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 1 ms to minimize.
[2021-05-16 16:11:42] [INFO ] Deduced a trap composed of 18 places in 406 ms of which 1 ms to minimize.
[2021-05-16 16:11:43] [INFO ] Deduced a trap composed of 28 places in 392 ms of which 1 ms to minimize.
[2021-05-16 16:11:43] [INFO ] Deduced a trap composed of 34 places in 392 ms of which 1 ms to minimize.
[2021-05-16 16:11:44] [INFO ] Deduced a trap composed of 23 places in 386 ms of which 1 ms to minimize.
[2021-05-16 16:11:44] [INFO ] Deduced a trap composed of 19 places in 382 ms of which 1 ms to minimize.
[2021-05-16 16:11:44] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 1 ms to minimize.
[2021-05-16 16:11:45] [INFO ] Deduced a trap composed of 27 places in 367 ms of which 1 ms to minimize.
[2021-05-16 16:11:45] [INFO ] Deduced a trap composed of 28 places in 363 ms of which 1 ms to minimize.
[2021-05-16 16:11:46] [INFO ] Deduced a trap composed of 27 places in 356 ms of which 1 ms to minimize.
[2021-05-16 16:11:46] [INFO ] Deduced a trap composed of 31 places in 352 ms of which 1 ms to minimize.
[2021-05-16 16:11:47] [INFO ] Deduced a trap composed of 28 places in 348 ms of which 1 ms to minimize.
[2021-05-16 16:11:47] [INFO ] Deduced a trap composed of 26 places in 342 ms of which 1 ms to minimize.
[2021-05-16 16:11:47] [INFO ] Deduced a trap composed of 27 places in 335 ms of which 1 ms to minimize.
[2021-05-16 16:11:48] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 1 ms to minimize.
[2021-05-16 16:11:48] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 1 ms to minimize.
[2021-05-16 16:11:48] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 1 ms to minimize.
[2021-05-16 16:11:49] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 1 ms to minimize.
[2021-05-16 16:11:49] [INFO ] Deduced a trap composed of 24 places in 325 ms of which 1 ms to minimize.
[2021-05-16 16:11:50] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 1 ms to minimize.
[2021-05-16 16:11:50] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 1 ms to minimize.
[2021-05-16 16:11:50] [INFO ] Deduced a trap composed of 39 places in 308 ms of which 1 ms to minimize.
[2021-05-16 16:11:51] [INFO ] Deduced a trap composed of 34 places in 305 ms of which 1 ms to minimize.
[2021-05-16 16:11:51] [INFO ] Deduced a trap composed of 29 places in 302 ms of which 0 ms to minimize.
[2021-05-16 16:11:51] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 1 ms to minimize.
[2021-05-16 16:11:52] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 1 ms to minimize.
[2021-05-16 16:11:52] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 1 ms to minimize.
[2021-05-16 16:11:52] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 1 ms to minimize.
[2021-05-16 16:11:53] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 1 ms to minimize.
[2021-05-16 16:11:53] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 1 ms to minimize.
[2021-05-16 16:11:53] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 0 ms to minimize.
[2021-05-16 16:11:54] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 0 ms to minimize.
[2021-05-16 16:11:54] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 1 ms to minimize.
[2021-05-16 16:11:54] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 1 ms to minimize.
[2021-05-16 16:11:55] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 1 ms to minimize.
[2021-05-16 16:11:55] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 1 ms to minimize.
[2021-05-16 16:11:55] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 1 ms to minimize.
[2021-05-16 16:11:55] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 1 ms to minimize.
[2021-05-16 16:11:56] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 1 ms to minimize.
[2021-05-16 16:11:56] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 1 ms to minimize.
[2021-05-16 16:11:56] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 0 ms to minimize.
[2021-05-16 16:11:57] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 0 ms to minimize.
[2021-05-16 16:11:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-16 16:11:57] [INFO ] [Real]Absence check using 331 positive place invariants in 91 ms returned sat
[2021-05-16 16:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:11:57] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2021-05-16 16:11:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:11:58] [INFO ] [Nat]Absence check using 331 positive place invariants in 24 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2011 transition count 1801
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2011 transition count 1801
Applied a total of 18 rules in 194 ms. Remains 2011 /2020 variables (removed 9) and now considering 1801/1810 (removed 9) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:11:58] [INFO ] Computed 331 place invariants in 6 ms
[2021-05-16 16:11:59] [INFO ] Implicit Places using invariants in 596 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:11:59] [INFO ] Computed 331 place invariants in 6 ms
[2021-05-16 16:12:00] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:12:00] [INFO ] Computed 331 place invariants in 5 ms
[2021-05-16 16:12:01] [INFO ] Dead Transitions using invariants and state equation in 1000 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2011/2020 places, 1801/1810 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s470 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 189 reset in 559 ms.
Product exploration explored 100000 steps with 189 reset in 578 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 190 reset in 427 ms.
Product exploration explored 100000 steps with 190 reset in 470 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2011 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2011/2011 places, 1801/1801 transitions.
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2011 transition count 1801
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 150 Pre rules applied. Total rules applied 420 place count 2011 transition count 1921
Deduced a syphon composed of 570 places in 2 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 570 place count 2011 transition count 1921
Performed 568 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1138 places in 2 ms
Iterating global reduction 1 with 568 rules applied. Total rules applied 1138 place count 2011 transition count 1921
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1139 place count 2011 transition count 1920
Renaming transitions due to excessive name length > 1024 char.
Discarding 211 places :
Symmetric choice reduction at 2 with 211 rule applications. Total rules 1350 place count 1800 transition count 1709
Deduced a syphon composed of 927 places in 3 ms
Iterating global reduction 2 with 211 rules applied. Total rules applied 1561 place count 1800 transition count 1709
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 928 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1562 place count 1800 transition count 1709
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1564 place count 1798 transition count 1707
Deduced a syphon composed of 926 places in 7 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1566 place count 1798 transition count 1707
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1027 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1667 place count 1798 transition count 2137
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1768 place count 1697 transition count 1935
Deduced a syphon composed of 926 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1869 place count 1697 transition count 1935
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 944 places in 2 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1887 place count 1697 transition count 2010
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1905 place count 1679 transition count 1974
Deduced a syphon composed of 926 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1923 place count 1679 transition count 1974
Deduced a syphon composed of 926 places in 1 ms
Applied a total of 1923 rules in 1318 ms. Remains 1679 /2011 variables (removed 332) and now considering 1974/1801 (removed -173) transitions.
[2021-05-16 16:12:05] [INFO ] Redundant transitions in 193 ms returned []
// Phase 1: matrix 1974 rows 1679 cols
[2021-05-16 16:12:05] [INFO ] Computed 331 place invariants in 13 ms
[2021-05-16 16:12:06] [INFO ] Dead Transitions using invariants and state equation in 992 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1679/2011 places, 1974/1801 transitions.
Product exploration explored 100000 steps with 11998 reset in 2405 ms.
Stack based approach found an accepted trace after 10 steps with 1 reset with depth 5 and stack size 4 in 0 ms.
FORMULA ShieldPPPt-PT-030B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-00 finished in 10716 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 2019 transition count 1385
Reduce places removed 424 places and 0 transitions.
Iterating post reduction 1 with 424 rules applied. Total rules applied 848 place count 1595 transition count 1385
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 848 place count 1595 transition count 1151
Deduced a syphon composed of 234 places in 2 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1316 place count 1361 transition count 1151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1322 place count 1355 transition count 1145
Iterating global reduction 2 with 6 rules applied. Total rules applied 1328 place count 1355 transition count 1145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1328 place count 1355 transition count 1141
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1336 place count 1351 transition count 1141
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2350 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2351 place count 844 transition count 633
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 2353 place count 843 transition count 632
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2531 place count 754 transition count 632
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2532 place count 754 transition count 632
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2533 place count 753 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2534 place count 752 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2534 place count 752 transition count 629
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2538 place count 750 transition count 629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2539 place count 749 transition count 628
Applied a total of 2539 rules in 376 ms. Remains 749 /2020 variables (removed 1271) and now considering 628/1810 (removed 1182) transitions.
// Phase 1: matrix 628 rows 749 cols
[2021-05-16 16:12:09] [INFO ] Computed 330 place invariants in 1 ms
[2021-05-16 16:12:09] [INFO ] Implicit Places using invariants in 363 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 365 ms to find 2 implicit places.
[2021-05-16 16:12:09] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 628 rows 747 cols
[2021-05-16 16:12:09] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:12:10] [INFO ] Dead Transitions using invariants and state equation in 308 ms returned []
Starting structural reductions, iteration 1 : 747/2020 places, 628/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 626
Applied a total of 4 rules in 26 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2021-05-16 16:12:10] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:12:10] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 626 rows 745 cols
[2021-05-16 16:12:10] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:12:11] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 745/2020 places, 626/1810 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-02 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:(NEQ s371 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 40710 steps with 0 reset in 239 ms.
FORMULA ShieldPPPt-PT-030B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-02 finished in 2362 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2020 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 232 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:12:11] [INFO ] Computed 331 place invariants in 5 ms
[2021-05-16 16:12:12] [INFO ] Implicit Places using invariants in 575 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:12:12] [INFO ] Computed 331 place invariants in 20 ms
[2021-05-16 16:12:13] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:12:13] [INFO ] Computed 331 place invariants in 18 ms
[2021-05-16 16:12:14] [INFO ] Dead Transitions using invariants and state equation in 1009 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s216 0) (EQ s1045 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 941 ms.
Product exploration explored 100000 steps with 50000 reset in 950 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 938 ms.
Product exploration explored 100000 steps with 50000 reset in 946 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2012 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2012 transition count 1802
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 149 Pre rules applied. Total rules applied 420 place count 2012 transition count 1921
Deduced a syphon composed of 569 places in 2 ms
Iterating global reduction 1 with 149 rules applied. Total rules applied 569 place count 2012 transition count 1921
Performed 570 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1139 places in 2 ms
Iterating global reduction 1 with 570 rules applied. Total rules applied 1139 place count 2012 transition count 1921
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1140 place count 2012 transition count 1920
Renaming transitions due to excessive name length > 1024 char.
Discarding 213 places :
Symmetric choice reduction at 2 with 213 rule applications. Total rules 1353 place count 1799 transition count 1707
Deduced a syphon composed of 926 places in 2 ms
Iterating global reduction 2 with 213 rules applied. Total rules applied 1566 place count 1799 transition count 1707
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 927 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1567 place count 1799 transition count 1707
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1569 place count 1797 transition count 1705
Deduced a syphon composed of 925 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1571 place count 1797 transition count 1705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 1026 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1672 place count 1797 transition count 2132
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1773 place count 1696 transition count 1930
Deduced a syphon composed of 925 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1874 place count 1696 transition count 1930
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 942 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1891 place count 1696 transition count 2003
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1908 place count 1679 transition count 1969
Deduced a syphon composed of 925 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1925 place count 1679 transition count 1969
Deduced a syphon composed of 925 places in 1 ms
Applied a total of 1925 rules in 829 ms. Remains 1679 /2012 variables (removed 333) and now considering 1969/1802 (removed -167) transitions.
[2021-05-16 16:12:19] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1969 rows 1679 cols
[2021-05-16 16:12:19] [INFO ] Computed 331 place invariants in 10 ms
[2021-05-16 16:12:20] [INFO ] Dead Transitions using invariants and state equation in 968 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1679/2012 places, 1969/1802 transitions.
Product exploration explored 100000 steps with 50000 reset in 5736 ms.
Product exploration explored 100000 steps with 50000 reset in 5701 ms.
[2021-05-16 16:12:32] [INFO ] Flatten gal took : 68 ms
[2021-05-16 16:12:32] [INFO ] Flatten gal took : 66 ms
[2021-05-16 16:12:32] [INFO ] Time to serialize gal into /tmp/LTL15870950116980560716.gal : 29 ms
[2021-05-16 16:12:32] [INFO ] Time to serialize properties into /tmp/LTL13690889910979196557.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/LTL15870950116980560716.gal, -t, CGAL, -LTL, /tmp/LTL13690889910979196557.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/LTL15870950116980560716.gal -t CGAL -LTL /tmp/LTL13690889910979196557.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p243==0)||(p1209==1))"))))
Formula 0 simplified : !XF"((p243==0)||(p1209==1))"
Detected timeout of ITS tools.
[2021-05-16 16:12:47] [INFO ] Flatten gal took : 58 ms
[2021-05-16 16:12:47] [INFO ] Applying decomposition
[2021-05-16 16:12:47] [INFO ] Flatten gal took : 58 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/graph268955444396157477.txt, -o, /tmp/graph268955444396157477.bin, -w, /tmp/graph268955444396157477.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/graph268955444396157477.bin, -l, -1, -v, -w, /tmp/graph268955444396157477.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:12:47] [INFO ] Decomposing Gal with order
[2021-05-16 16:12:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:12:47] [INFO ] Removed a total of 301 redundant transitions.
[2021-05-16 16:12:47] [INFO ] Flatten gal took : 142 ms
[2021-05-16 16:12:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2021-05-16 16:12:47] [INFO ] Time to serialize gal into /tmp/LTL12115527304206792123.gal : 21 ms
[2021-05-16 16:12:47] [INFO ] Time to serialize properties into /tmp/LTL9733548720067399226.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/LTL12115527304206792123.gal, -t, CGAL, -LTL, /tmp/LTL9733548720067399226.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/LTL12115527304206792123.gal -t CGAL -LTL /tmp/LTL9733548720067399226.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i3.u77.p243==0)||(i15.u375.p1209==1))"))))
Formula 0 simplified : !XF"((i3.u77.p243==0)||(i15.u375.p1209==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13100752120047008173
[2021-05-16 16:13:03] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13100752120047008173
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/ltsmin13100752120047008173]
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/ltsmin13100752120047008173] 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/ltsmin13100752120047008173] 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 ShieldPPPt-PT-030B-03 finished in 52731 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 2020 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2011 transition count 1801
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2011 transition count 1801
Applied a total of 18 rules in 280 ms. Remains 2011 /2020 variables (removed 9) and now considering 1801/1810 (removed 9) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:13:04] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:13:04] [INFO ] Implicit Places using invariants in 551 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:13:04] [INFO ] Computed 331 place invariants in 3 ms
[2021-05-16 16:13:06] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:13:06] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:13:07] [INFO ] Dead Transitions using invariants and state equation in 1007 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2011/2020 places, 1801/1810 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-030B-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s127 0) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-06 finished in 3463 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 280 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:13:07] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:13:08] [INFO ] Implicit Places using invariants in 583 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:13:08] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:13:09] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:13:09] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:13:10] [INFO ] Dead Transitions using invariants and state equation in 997 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (NEQ s272 0) (NEQ s1114 1)), p0:(AND (NEQ s1818 0) (NEQ s1722 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-13 finished in 3483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 425 rules applied. Total rules applied 425 place count 2019 transition count 1384
Reduce places removed 425 places and 0 transitions.
Iterating post reduction 1 with 425 rules applied. Total rules applied 850 place count 1594 transition count 1384
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 850 place count 1594 transition count 1150
Deduced a syphon composed of 234 places in 2 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1318 place count 1360 transition count 1150
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1323 place count 1355 transition count 1145
Iterating global reduction 2 with 5 rules applied. Total rules applied 1328 place count 1355 transition count 1145
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1328 place count 1355 transition count 1142
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1334 place count 1352 transition count 1142
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2352 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2353 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 2355 place count 842 transition count 631
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2533 place count 753 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2534 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2535 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2535 place count 751 transition count 628
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 2539 place count 749 transition count 628
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2540 place count 748 transition count 627
Applied a total of 2540 rules in 339 ms. Remains 748 /2020 variables (removed 1272) and now considering 627/1810 (removed 1183) transitions.
// Phase 1: matrix 627 rows 748 cols
[2021-05-16 16:13:11] [INFO ] Computed 330 place invariants in 5 ms
[2021-05-16 16:13:11] [INFO ] Implicit Places using invariants in 359 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 360 ms to find 2 implicit places.
[2021-05-16 16:13:11] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 627 rows 746 cols
[2021-05-16 16:13:11] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:13:12] [INFO ] Dead Transitions using invariants and state equation in 312 ms returned []
Starting structural reductions, iteration 1 : 746/2020 places, 627/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 625
Applied a total of 4 rules in 29 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2021-05-16 16:13:12] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:13:12] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 625 rows 744 cols
[2021-05-16 16:13:12] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:13:13] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 744/2020 places, 625/1810 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s473 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 594 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldPPPt-PT-030B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-14 finished in 2683 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(F((p0&&X(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2013 transition count 1803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2013 transition count 1803
Applied a total of 14 rules in 285 ms. Remains 2013 /2020 variables (removed 7) and now considering 1803/1810 (removed 7) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2021-05-16 16:13:13] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:13:14] [INFO ] Implicit Places using invariants in 578 ms returned []
// Phase 1: matrix 1803 rows 2013 cols
[2021-05-16 16:13:14] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:13:16] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
// Phase 1: matrix 1803 rows 2013 cols
[2021-05-16 16:13:16] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:13:17] [INFO ] Dead Transitions using invariants and state equation in 1007 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2013/2020 places, 1803/1810 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1865 0), p1:(OR (EQ s812 0) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13 reset in 597 ms.
Product exploration explored 100000 steps with 7 reset in 791 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 35 reset in 577 ms.
Product exploration explored 100000 steps with 1 reset in 751 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2013 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2013/2013 places, 1803/1803 transitions.
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2013 transition count 1803
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 149 Pre rules applied. Total rules applied 418 place count 2013 transition count 1922
Deduced a syphon composed of 567 places in 2 ms
Iterating global reduction 1 with 149 rules applied. Total rules applied 567 place count 2013 transition count 1922
Performed 571 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1138 places in 2 ms
Iterating global reduction 1 with 571 rules applied. Total rules applied 1138 place count 2013 transition count 1923
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1139 place count 2013 transition count 1922
Renaming transitions due to excessive name length > 1024 char.
Discarding 212 places :
Symmetric choice reduction at 2 with 212 rule applications. Total rules 1351 place count 1801 transition count 1709
Deduced a syphon composed of 926 places in 2 ms
Iterating global reduction 2 with 212 rules applied. Total rules applied 1563 place count 1801 transition count 1709
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 927 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1564 place count 1801 transition count 1709
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1566 place count 1799 transition count 1707
Deduced a syphon composed of 925 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1568 place count 1799 transition count 1707
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 1026 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1669 place count 1799 transition count 2135
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1770 place count 1698 transition count 1933
Deduced a syphon composed of 925 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1871 place count 1698 transition count 1933
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 942 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1888 place count 1698 transition count 2006
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1905 place count 1681 transition count 1972
Deduced a syphon composed of 925 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1922 place count 1681 transition count 1972
Deduced a syphon composed of 925 places in 2 ms
Applied a total of 1922 rules in 780 ms. Remains 1681 /2013 variables (removed 332) and now considering 1972/1803 (removed -169) transitions.
[2021-05-16 16:13:20] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1972 rows 1681 cols
[2021-05-16 16:13:20] [INFO ] Computed 331 place invariants in 10 ms
[2021-05-16 16:13:21] [INFO ] Dead Transitions using invariants and state equation in 960 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1681/2013 places, 1972/1803 transitions.
Product exploration explored 100000 steps with 5 reset in 582 ms.
Product exploration explored 100000 steps with 0 reset in 747 ms.
[2021-05-16 16:13:23] [INFO ] Flatten gal took : 49 ms
[2021-05-16 16:13:23] [INFO ] Flatten gal took : 50 ms
[2021-05-16 16:13:23] [INFO ] Time to serialize gal into /tmp/LTL8360697294755222732.gal : 6 ms
[2021-05-16 16:13:23] [INFO ] Time to serialize properties into /tmp/LTL15679339905032545333.ltl : 99 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/LTL8360697294755222732.gal, -t, CGAL, -LTL, /tmp/LTL15679339905032545333.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/LTL8360697294755222732.gal -t CGAL -LTL /tmp/LTL15679339905032545333.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(p2165==0)")||(X(F(("(p2165==0)")&&(X(F("((p937==0)||(p85==1))")))))))))
Formula 0 simplified : !G("(p2165==0)" | XF("(p2165==0)" & XF"((p937==0)||(p85==1))"))
Detected timeout of ITS tools.
[2021-05-16 16:13:38] [INFO ] Flatten gal took : 46 ms
[2021-05-16 16:13:38] [INFO ] Applying decomposition
[2021-05-16 16:13:38] [INFO ] Flatten gal took : 46 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/graph15834992813268105063.txt, -o, /tmp/graph15834992813268105063.bin, -w, /tmp/graph15834992813268105063.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/graph15834992813268105063.bin, -l, -1, -v, -w, /tmp/graph15834992813268105063.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:13:38] [INFO ] Decomposing Gal with order
[2021-05-16 16:13:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:13:38] [INFO ] Removed a total of 300 redundant transitions.
[2021-05-16 16:13:39] [INFO ] Flatten gal took : 93 ms
[2021-05-16 16:13:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-16 16:13:39] [INFO ] Time to serialize gal into /tmp/LTL8236419605039259151.gal : 12 ms
[2021-05-16 16:13:39] [INFO ] Time to serialize properties into /tmp/LTL15257728210951558764.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/LTL8236419605039259151.gal, -t, CGAL, -LTL, /tmp/LTL15257728210951558764.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/LTL8236419605039259151.gal -t CGAL -LTL /tmp/LTL15257728210951558764.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("(i27.u658.p2165==0)")||(X(F(("(i27.u658.p2165==0)")&&(X(F("((i11.u289.p937==0)||(i1.u29.p85==1))")))))))))
Formula 0 simplified : !G("(i27.u658.p2165==0)" | XF("(i27.u658.p2165==0)" & XF"((i11.u289.p937==0)||(i1.u29.p85==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6382117580011785288
[2021-05-16 16:13:54] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6382117580011785288
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/ltsmin6382117580011785288]
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/ltsmin6382117580011785288] 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/ltsmin6382117580011785288] 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 ShieldPPPt-PT-030B-15 finished in 41412 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6157158092526625280
[2021-05-16 16:13:55] [INFO ] Too many transitions (1810) to apply POR reductions. Disabling POR matrices.
[2021-05-16 16:13:55] [INFO ] Applying decomposition
[2021-05-16 16:13:55] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6157158092526625280
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/ltsmin6157158092526625280]
[2021-05-16 16:13:55] [INFO ] Flatten gal took : 74 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/graph2410330678350657116.txt, -o, /tmp/graph2410330678350657116.bin, -w, /tmp/graph2410330678350657116.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/graph2410330678350657116.bin, -l, -1, -v, -w, /tmp/graph2410330678350657116.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:13:55] [INFO ] Decomposing Gal with order
[2021-05-16 16:13:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:13:55] [INFO ] Removed a total of 296 redundant transitions.
[2021-05-16 16:13:55] [INFO ] Flatten gal took : 84 ms
[2021-05-16 16:13:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-16 16:13:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality12414764988408614807.gal : 12 ms
[2021-05-16 16:13:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality2201463484122623855.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/LTLCardinality12414764988408614807.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2201463484122623855.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/LTLCardinality12414764988408614807.gal -t CGAL -LTL /tmp/LTLCardinality2201463484122623855.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(F("((i2.u80.p243==0)||(i15.i0.i0.u379.p1209==1))"))))
Formula 0 simplified : !XF"((i2.u80.p243==0)||(i15.i0.i0.u379.p1209==1))"
Compilation finished in 16198 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6157158092526625280]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6157158092526625280]
LTSmin run took 819 ms.
FORMULA ShieldPPPt-PT-030B-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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, [](((LTLAPp1==true)||X(<>(((LTLAPp1==true)&&X(<>((LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6157158092526625280]
LTSmin run took 2936 ms.
FORMULA ShieldPPPt-PT-030B-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621181656104

--------------------
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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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 r216-tall-162098205700812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 ;