Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068000723.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Echo-PT-d05r03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068000723
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.3M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-00
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-01
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-02
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-03
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-04
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-05
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-06
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-07
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-08
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-09
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-10
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-11
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-12
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-13
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-14
FORMULA_NAME Echo-PT-d05r03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748829892878

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d05r03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 02:04:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 02:04:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 02:04:54] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2025-06-02 02:04:54] [INFO ] Transformed 3717 places.
[2025-06-02 02:04:54] [INFO ] Transformed 3222 transitions.
[2025-06-02 02:04:54] [INFO ] Found NUPN structural information;
[2025-06-02 02:04:54] [INFO ] Parsed PT model containing 3717 places and 3222 transitions and 28404 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA Echo-PT-d05r03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 3717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3717/3717 places, 3222/3222 transitions.
Reduce places removed 243 places and 0 transitions.
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 3474 transition count 3222
Applied a total of 243 rules in 357 ms. Remains 3474 /3717 variables (removed 243) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:05:04] [INFO ] Invariants computation overflowed in 9897 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:05:08] [INFO ] Implicit Places using invariants in 13014 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:05:18] [INFO ] Invariants computation overflowed in 9951 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:07:58] [INFO ] Performed 0/3474 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2025-06-02 02:07:58] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2025-06-02 02:07:58] [INFO ] Implicit Places using invariants and state equation in 170008 ms returned []
Implicit Place search using SMT with State Equation took 183064 ms to find 0 implicit places.
Running 3221 sub problems to find dead transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:08:07] [INFO ] Invariants computation overflowed in 9795 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30086 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 3221/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30051 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 0/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72647ms problems are : Problem set: 0 solved, 3221 unsolved
Search for dead transitions found 0 dead transitions in 72688ms
Starting structural reductions in LTL mode, iteration 1 : 3474/3717 places, 3222/3222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256146 ms. Remains : 3474/3717 places, 3222/3222 transitions.
Support contains 20 out of 3474 places after structural reductions.
[2025-06-02 02:09:11] [INFO ] Flatten gal took : 425 ms
[2025-06-02 02:09:11] [INFO ] Flatten gal took : 239 ms
[2025-06-02 02:09:12] [INFO ] Input system was already deterministic with 3222 transitions.
RANDOM walk for 36966 steps (74 resets) in 3297 ms. (11 steps per ms) remains 0/11 properties
FORMULA Echo-PT-d05r03-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(X(G(p1))&&G(p2)))))'
Support contains 5 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 143 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:09:23] [INFO ] Invariants computation overflowed in 10183 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:09:26] [INFO ] Implicit Places using invariants in 12744 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:09:36] [INFO ] Invariants computation overflowed in 10058 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:12:16] [INFO ] Performed 0/3474 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2025-06-02 02:12:16] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2025-06-02 02:12:16] [INFO ] Implicit Places using invariants and state equation in 170105 ms returned []
Implicit Place search using SMT with State Equation took 182851 ms to find 0 implicit places.
Running 3221 sub problems to find dead transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:12:26] [INFO ] Invariants computation overflowed in 9966 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30057 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 3221/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30051 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 0/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72410ms problems are : Problem set: 0 solved, 3221 unsolved
Search for dead transitions found 0 dead transitions in 72423ms
Finished structural reductions in LTL mode , in 1 iterations and 255437 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 1479 ms.
Product exploration explored 100000 steps with 33333 reset in 1297 ms.
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 35 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d05r03-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLCardinality-08 finished in 260493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 181 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:13:44] [INFO ] Invariants computation overflowed in 10014 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:13:46] [INFO ] Implicit Places using invariants in 12673 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:13:56] [INFO ] Invariants computation overflowed in 10046 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:16:36] [INFO ] Performed 0/3474 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2025-06-02 02:16:36] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2025-06-02 02:16:36] [INFO ] Implicit Places using invariants and state equation in 170101 ms returned []
Implicit Place search using SMT with State Equation took 182775 ms to find 0 implicit places.
Running 3221 sub problems to find dead transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:16:46] [INFO ] Invariants computation overflowed in 9485 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30054 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 3221/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30054 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 0/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71866ms problems are : Problem set: 0 solved, 3221 unsolved
Search for dead transitions found 0 dead transitions in 71881ms
Finished structural reductions in LTL mode , in 1 iterations and 254850 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Echo-PT-d05r03-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d05r03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLCardinality-09 finished in 254957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p1))||p0))))'
Support contains 5 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 147 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:17:58] [INFO ] Invariants computation overflowed in 9527 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:18:01] [INFO ] Implicit Places using invariants in 12317 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:18:10] [INFO ] Invariants computation overflowed in 9445 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:20:50] [INFO ] Performed 0/3474 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2025-06-02 02:20:50] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2025-06-02 02:20:50] [INFO ] Implicit Places using invariants and state equation in 169495 ms returned []
Implicit Place search using SMT with State Equation took 181815 ms to find 0 implicit places.
Running 3221 sub problems to find dead transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:21:00] [INFO ] Invariants computation overflowed in 9520 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30062 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 3221/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30059 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 0/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72129ms problems are : Problem set: 0 solved, 3221 unsolved
Search for dead transitions found 0 dead transitions in 72147ms
Finished structural reductions in LTL mode , in 1 iterations and 254120 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d05r03-LTLCardinality-13
Product exploration explored 100000 steps with 231 reset in 3778 ms.
Product exploration explored 100000 steps with 229 reset in 4131 ms.
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 8907 steps (17 resets) in 501 ms. (17 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 97 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:22:23] [INFO ] Invariants computation overflowed in 9639 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:22:26] [INFO ] Implicit Places using invariants in 12301 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:22:36] [INFO ] Invariants computation overflowed in 10287 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:25:16] [INFO ] Performed 0/3474 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2025-06-02 02:25:16] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2025-06-02 02:25:16] [INFO ] Implicit Places using invariants and state equation in 170334 ms returned []
Implicit Place search using SMT with State Equation took 182640 ms to find 0 implicit places.
Running 3221 sub problems to find dead transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:25:26] [INFO ] Invariants computation overflowed in 9490 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30050 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 3221/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30043 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 0/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71918ms problems are : Problem set: 0 solved, 3221 unsolved
Search for dead transitions found 0 dead transitions in 71925ms
Finished structural reductions in LTL mode , in 1 iterations and 254675 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4015 steps (7 resets) in 192 ms. (20 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 232 reset in 3661 ms.
Product exploration explored 100000 steps with 233 reset in 3994 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.34 ms
Discarding 11 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 441 ms. Remains 3463 /3474 variables (removed 11) and now considering 3221/3222 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:26:40] [INFO ] Redundant transitions in 159 ms returned []
Running 3220 sub problems to find dead transitions.
// Phase 1: matrix 3221 rows 3463 cols
[2025-06-02 02:26:50] [INFO ] Invariants computation overflowed in 10459 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3462 variables, 3462/3462 constraints. Problems are: Problem set: 0 solved, 3220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3462/6684 variables, and 3462 constraints, problems are : Problem set: 0 solved, 3220 unsolved in 30051 ms.
Refiners :[Domain max(s): 3462/3463 constraints, State Equation: 0/3463 constraints, PredecessorRefiner: 3220/3220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3462 variables, 3462/3462 constraints. Problems are: Problem set: 0 solved, 3220 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3462/6684 variables, and 3462 constraints, problems are : Problem set: 0 solved, 3220 unsolved in 30048 ms.
Refiners :[Domain max(s): 3462/3463 constraints, State Equation: 0/3463 constraints, PredecessorRefiner: 0/3220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72802ms problems are : Problem set: 0 solved, 3220 unsolved
Search for dead transitions found 0 dead transitions in 72809ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3463/3474 places, 3221/3222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73421 ms. Remains : 3463/3474 places, 3221/3222 transitions.
Built C files in :
/tmp/ltsmin12978341590070757967
[2025-06-02 02:27:53] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12978341590070757967
Running compilation step : cd /tmp/ltsmin12978341590070757967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12978341590070757967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12978341590070757967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 133 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:28:05] [INFO ] Invariants computation overflowed in 9532 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:28:08] [INFO ] Implicit Places using invariants in 12181 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:28:18] [INFO ] Invariants computation overflowed in 9672 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:30:58] [INFO ] Performed 0/3474 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2025-06-02 02:30:58] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2025-06-02 02:30:58] [INFO ] Implicit Places using invariants and state equation in 169725 ms returned []
Implicit Place search using SMT with State Equation took 181921 ms to find 0 implicit places.
Running 3221 sub problems to find dead transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:31:07] [INFO ] Invariants computation overflowed in 9458 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30049 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 3221/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30050 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 0/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71876ms problems are : Problem set: 0 solved, 3221 unsolved
Search for dead transitions found 0 dead transitions in 71883ms
Finished structural reductions in LTL mode , in 1 iterations and 253951 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Built C files in :
/tmp/ltsmin4177851154091972371
[2025-06-02 02:32:10] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4177851154091972371
Running compilation step : cd /tmp/ltsmin4177851154091972371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4177851154091972371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4177851154091972371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 02:32:13] [INFO ] Flatten gal took : 198 ms
[2025-06-02 02:32:13] [INFO ] Flatten gal took : 207 ms
[2025-06-02 02:32:13] [INFO ] Time to serialize gal into /tmp/LTL5267212633426998872.gal : 52 ms
[2025-06-02 02:32:13] [INFO ] Time to serialize properties into /tmp/LTL17240881774376954108.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5267212633426998872.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8484788996061418379.hoa' '-atoms' '/tmp/LTL17240881774376954108.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17240881774376954108.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8484788996061418379.hoa
Detected timeout of ITS tools.
[2025-06-02 02:32:29] [INFO ] Flatten gal took : 174 ms
[2025-06-02 02:32:29] [INFO ] Flatten gal took : 175 ms
[2025-06-02 02:32:29] [INFO ] Time to serialize gal into /tmp/LTL7756732983578024394.gal : 28 ms
[2025-06-02 02:32:29] [INFO ] Time to serialize properties into /tmp/LTL10159988143486889510.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7756732983578024394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10159988143486889510.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(("((p1902==1)||(p854==0))")||(("(p3118==1)")||(F(G("((p2083==0)||(p3695==1))"))))))))
Formula 0 simplified : XX(!"((p1902==1)||(p854==0))" & !"(p3118==1)" & GF!"((p2083==0)||(p3695==1))")
Detected timeout of ITS tools.
[2025-06-02 02:32:44] [INFO ] Flatten gal took : 177 ms
[2025-06-02 02:32:44] [INFO ] Applying decomposition
[2025-06-02 02:32:45] [INFO ] Flatten gal took : 179 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8415450755556914886.txt' '-o' '/tmp/graph8415450755556914886.bin' '-w' '/tmp/graph8415450755556914886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8415450755556914886.bin' '-l' '-1' '-v' '-w' '/tmp/graph8415450755556914886.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:32:45] [INFO ] Decomposing Gal with order
[2025-06-02 02:32:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:32:46] [INFO ] Removed a total of 8319 redundant transitions.
[2025-06-02 02:32:46] [INFO ] Flatten gal took : 592 ms
[2025-06-02 02:32:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1410 labels/synchronizations in 220 ms.
[2025-06-02 02:32:46] [INFO ] Time to serialize gal into /tmp/LTL17939602896748766804.gal : 61 ms
[2025-06-02 02:32:46] [INFO ] Time to serialize properties into /tmp/LTL4394080963215281294.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17939602896748766804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4394080963215281294.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(("((i2.i0.u40.p1902==1)||(i10.i0.u94.p854==0))")||(("(i10.i1.u159.p3118==1)")||(F(G("((i2.i2.u56.p2083==0)||(i5.i3.u178.p3695==...167
Formula 0 simplified : XX(!"((i2.i0.u40.p1902==1)||(i10.i0.u94.p854==0))" & !"(i10.i1.u159.p3118==1)" & GF!"((i2.i2.u56.p2083==0)||(i5.i3.u178.p3695==1))")
Detected timeout of ITS tools.
Treatment of property Echo-PT-d05r03-LTLCardinality-13 finished in 913191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(F(p0))))&&(G(p1) U !p0))))'
Support contains 3 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 149 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:33:12] [INFO ] Invariants computation overflowed in 10252 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:33:15] [INFO ] Implicit Places using invariants in 12869 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:33:25] [INFO ] Invariants computation overflowed in 10104 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:36:05] [INFO ] Performed 0/3474 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2025-06-02 02:36:05] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2025-06-02 02:36:05] [INFO ] Implicit Places using invariants and state equation in 170164 ms returned []
Implicit Place search using SMT with State Equation took 183036 ms to find 0 implicit places.
Running 3221 sub problems to find dead transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2025-06-02 02:36:15] [INFO ] Invariants computation overflowed in 10000 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30054 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 3221/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3473 variables, 3473/3473 constraints. Problems are: Problem set: 0 solved, 3221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3473/6696 variables, and 3473 constraints, problems are : Problem set: 0 solved, 3221 unsolved in 30040 ms.
Refiners :[Domain max(s): 3473/3474 constraints, State Equation: 0/3474 constraints, PredecessorRefiner: 0/3221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72855ms problems are : Problem set: 0 solved, 3221 unsolved
Search for dead transitions found 0 dead transitions in 72872ms
Finished structural reductions in LTL mode , in 1 iterations and 256068 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (OR (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d05r03-LTLCardinality-14
Stuttering criterion allowed to conclude after 486 steps with 0 reset in 39 ms.
FORMULA Echo-PT-d05r03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLCardinality-14 finished in 256434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.28 ms
Discarding 11 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 473 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2025-06-02 02:37:29] [INFO ] Invariants computation overflowed in 10229 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:37:31] [INFO ] Implicit Places using invariants in 12883 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2025-06-02 02:37:41] [INFO ] Invariants computation overflowed in 9863 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:40:21] [INFO ] Implicit Places using invariants and state equation in 169920 ms returned []
Implicit Place search using SMT with State Equation took 182806 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:40:21] [INFO ] Redundant transitions in 238 ms returned []
Running 3210 sub problems to find dead transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2025-06-02 02:40:32] [INFO ] Invariants computation overflowed in 10457 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3462 variables, 3462/3462 constraints. Problems are: Problem set: 0 solved, 3210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3462/6682 variables, and 3462 constraints, problems are : Problem set: 0 solved, 3210 unsolved in 30057 ms.
Refiners :[Domain max(s): 3462/3462 constraints, State Equation: 0/3462 constraints, PredecessorRefiner: 3210/3210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3462 variables, 3462/3462 constraints. Problems are: Problem set: 0 solved, 3210 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3462/6682 variables, and 3462 constraints, problems are : Problem set: 0 solved, 3210 unsolved in 30044 ms.
Refiners :[Domain max(s): 3462/3462 constraints, State Equation: 0/3462 constraints, PredecessorRefiner: 0/3210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73452ms problems are : Problem set: 0 solved, 3210 unsolved
Search for dead transitions found 0 dead transitions in 73467ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257026 ms. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLCardinality-15
Product exploration explored 100000 steps with 206 reset in 3869 ms.
Product exploration explored 100000 steps with 206 reset in 3983 ms.
Computed a total of 3462 stabilizing places and 3220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3462 transition count 3220
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 898 steps (0 resets) in 106 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 3462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3462/3462 places, 3220/3220 transitions.
Applied a total of 0 rules in 487 ms. Remains 3462 /3462 variables (removed 0) and now considering 3220/3220 (removed 0) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2025-06-02 02:41:56] [INFO ] Invariants computation overflowed in 10270 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:41:59] [INFO ] Implicit Places using invariants in 13080 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2025-06-02 02:42:09] [INFO ] Invariants computation overflowed in 9966 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:44:49] [INFO ] Implicit Places using invariants and state equation in 170021 ms returned []
Implicit Place search using SMT with State Equation took 183106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:44:49] [INFO ] Redundant transitions in 252 ms returned []
Running 3210 sub problems to find dead transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2025-06-02 02:44:59] [INFO ] Invariants computation overflowed in 10143 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3462 variables, 3462/3462 constraints. Problems are: Problem set: 0 solved, 3210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3462/6682 variables, and 3462 constraints, problems are : Problem set: 0 solved, 3210 unsolved in 30058 ms.
Refiners :[Domain max(s): 3462/3462 constraints, State Equation: 0/3462 constraints, PredecessorRefiner: 3210/3210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3462 variables, 3462/3462 constraints. Problems are: Problem set: 0 solved, 3210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3462/6682 variables, and 3462 constraints, problems are : Problem set: 0 solved, 3210 unsolved in 30047 ms.
Refiners :[Domain max(s): 3462/3462 constraints, State Equation: 0/3462 constraints, PredecessorRefiner: 0/3210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73112ms problems are : Problem set: 0 solved, 3210 unsolved
Search for dead transitions found 0 dead transitions in 73126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 256992 ms. Remains : 3462/3462 places, 3220/3220 transitions.
Computed a total of 3462 stabilizing places and 3220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3462 transition count 3220
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 1055 steps (0 resets) in 277 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 206 reset in 3795 ms.
Product exploration explored 100000 steps with 206 reset in 4219 ms.
Built C files in :
/tmp/ltsmin17382584584733908697
[2025-06-02 02:46:12] [INFO ] Too many transitions (3220) to apply POR reductions. Disabling POR matrices.
[2025-06-02 02:46:13] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17382584584733908697
Running compilation step : cd /tmp/ltsmin17382584584733908697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17382584584733908697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17382584584733908697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 3462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3462/3462 places, 3220/3220 transitions.
Applied a total of 0 rules in 573 ms. Remains 3462 /3462 variables (removed 0) and now considering 3220/3220 (removed 0) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2025-06-02 02:46:26] [INFO ] Invariants computation overflowed in 10369 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:46:29] [INFO ] Implicit Places using invariants in 13039 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2025-06-02 02:46:39] [INFO ] Invariants computation overflowed in 10007 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:49:19] [INFO ] Implicit Places using invariants and state equation in 170052 ms returned []
Implicit Place search using SMT with State Equation took 183096 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:49:19] [INFO ] Redundant transitions in 254 ms returned []
Running 3210 sub problems to find dead transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2025-06-02 02:49:29] [INFO ] Invariants computation overflowed in 9708 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3462 variables, 3462/3462 constraints. Problems are: Problem set: 0 solved, 3210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3462/6682 variables, and 3462 constraints, problems are : Problem set: 0 solved, 3210 unsolved in 30060 ms.
Refiners :[Domain max(s): 3462/3462 constraints, State Equation: 0/3462 constraints, PredecessorRefiner: 3210/3210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3462 variables, 3462/3462 constraints. Problems are: Problem set: 0 solved, 3210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3462/6682 variables, and 3462 constraints, problems are : Problem set: 0 solved, 3210 unsolved in 30050 ms.
Refiners :[Domain max(s): 3462/3462 constraints, State Equation: 0/3462 constraints, PredecessorRefiner: 0/3210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72276ms problems are : Problem set: 0 solved, 3210 unsolved
Search for dead transitions found 0 dead transitions in 72290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 256230 ms. Remains : 3462/3462 places, 3220/3220 transitions.
Built C files in :
/tmp/ltsmin8499507858297486897
[2025-06-02 02:50:32] [INFO ] Too many transitions (3220) to apply POR reductions. Disabling POR matrices.
[2025-06-02 02:50:32] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8499507858297486897
Running compilation step : cd /tmp/ltsmin8499507858297486897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8499507858297486897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8499507858297486897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 02:50:36] [INFO ] Flatten gal took : 497 ms
[2025-06-02 02:50:36] [INFO ] Flatten gal took : 240 ms
[2025-06-02 02:50:36] [INFO ] Time to serialize gal into /tmp/LTL11762112191709810153.gal : 61 ms
[2025-06-02 02:50:36] [INFO ] Time to serialize properties into /tmp/LTL11055400283115399396.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11762112191709810153.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14111676196663212589.hoa' '-atoms' '/tmp/LTL11055400283115399396.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11055400283115399396.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14111676196663212589.hoa
Detected timeout of ITS tools.
[2025-06-02 02:50:52] [INFO ] Flatten gal took : 207 ms
[2025-06-02 02:50:52] [INFO ] Flatten gal took : 209 ms
[2025-06-02 02:50:52] [INFO ] Time to serialize gal into /tmp/LTL18000593360320037237.gal : 34 ms
[2025-06-02 02:50:52] [INFO ] Time to serialize properties into /tmp/LTL18014572231871527908.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18000593360320037237.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18014572231871527908.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((p1828==0)||(p3559==1))"))))
Formula 0 simplified : GF!"((p1828==0)||(p3559==1))"
Detected timeout of ITS tools.
[2025-06-02 02:51:07] [INFO ] Flatten gal took : 191 ms
[2025-06-02 02:51:07] [INFO ] Applying decomposition
[2025-06-02 02:51:07] [INFO ] Flatten gal took : 182 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4566124558919961811.txt' '-o' '/tmp/graph4566124558919961811.bin' '-w' '/tmp/graph4566124558919961811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4566124558919961811.bin' '-l' '-1' '-v' '-w' '/tmp/graph4566124558919961811.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:51:08] [INFO ] Decomposing Gal with order
[2025-06-02 02:51:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:51:09] [INFO ] Removed a total of 8191 redundant transitions.
[2025-06-02 02:51:09] [INFO ] Flatten gal took : 472 ms
[2025-06-02 02:51:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 919 labels/synchronizations in 278 ms.
[2025-06-02 02:51:10] [INFO ] Time to serialize gal into /tmp/LTL2289662910014165279.gal : 53 ms
[2025-06-02 02:51:10] [INFO ] Time to serialize properties into /tmp/LTL3763949133270103472.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2289662910014165279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3763949133270103472.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i8.u166.p1828==0)||(i10.u11.p3559==1))"))))
Formula 0 simplified : GF!"((i8.u166.p1828==0)||(i10.u11.p3559==1))"
Detected timeout of ITS tools.
Treatment of property Echo-PT-d05r03-LTLCardinality-15 finished in 846741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p1))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2025-06-02 02:51:25] [INFO ] Flatten gal took : 188 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7808017425402100382
[2025-06-02 02:51:25] [INFO ] Too many transitions (3222) to apply POR reductions. Disabling POR matrices.
[2025-06-02 02:51:25] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7808017425402100382
Running compilation step : cd /tmp/ltsmin7808017425402100382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 02:51:25] [INFO ] Applying decomposition
[2025-06-02 02:51:25] [INFO ] Flatten gal took : 175 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14855892304368264236.txt' '-o' '/tmp/graph14855892304368264236.bin' '-w' '/tmp/graph14855892304368264236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14855892304368264236.bin' '-l' '-1' '-v' '-w' '/tmp/graph14855892304368264236.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:51:26] [INFO ] Decomposing Gal with order
[2025-06-02 02:51:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:51:26] [INFO ] Removed a total of 8176 redundant transitions.
[2025-06-02 02:51:27] [INFO ] Flatten gal took : 354 ms
[2025-06-02 02:51:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1076 labels/synchronizations in 110 ms.
[2025-06-02 02:51:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality15420496064870303616.gal : 44 ms
[2025-06-02 02:51:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality10111700904213264735.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15420496064870303616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10111700904213264735.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(X(("((i4.u37.p1902==1)||(i8.i1.u1.p854==0))")||(("(i8.i0.u144.p3118==1)")||(F(G("((i11.i1.u57.p2083==0)||(i13.u162.p3695==1))")))...160
Formula 0 simplified : XX(!"((i4.u37.p1902==1)||(i8.i1.u1.p854==0))" & !"(i8.i0.u144.p3118==1)" & GF!"((i11.i1.u57.p2083==0)||(i13.u162.p3695==1))")
Compilation finished in 11809 ms.
Running link step : cd /tmp/ltsmin7808017425402100382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin7808017425402100382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d05r03"
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-5832"
echo " Executing tool itstools"
echo " Input is Echo-PT-d05r03, 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 r072-tall-174860068000723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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