Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 132K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717354091163

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:48:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:48:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:48:12] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-02 18:48:12] [INFO ] Transformed 545 places.
[2024-06-02 18:48:12] [INFO ] Transformed 617 transitions.
[2024-06-02 18:48:12] [INFO ] Found NUPN structural information;
[2024-06-02 18:48:12] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 202 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 3 formulas.
Deduced a syphon composed of 157 places in 14 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-11-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 377 transition count 438
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 73 place count 317 transition count 376
Iterating global reduction 1 with 60 rules applied. Total rules applied 133 place count 317 transition count 376
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 177 place count 273 transition count 332
Iterating global reduction 1 with 44 rules applied. Total rules applied 221 place count 273 transition count 332
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 224 place count 273 transition count 329
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 247 place count 250 transition count 306
Iterating global reduction 2 with 23 rules applied. Total rules applied 270 place count 250 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 271 place count 250 transition count 305
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 285 place count 236 transition count 291
Iterating global reduction 3 with 14 rules applied. Total rules applied 299 place count 236 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 301 place count 236 transition count 289
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 306 place count 231 transition count 284
Iterating global reduction 4 with 5 rules applied. Total rules applied 311 place count 231 transition count 284
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 313 place count 229 transition count 282
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 229 transition count 282
Applied a total of 315 rules in 111 ms. Remains 229 /388 variables (removed 159) and now considering 282/440 (removed 158) transitions.
// Phase 1: matrix 282 rows 229 cols
[2024-06-02 18:48:13] [INFO ] Computed 4 invariants in 18 ms
[2024-06-02 18:48:13] [INFO ] Implicit Places using invariants in 236 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 265 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 228/388 places, 282/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 228 /228 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 397 ms. Remains : 228/388 places, 282/440 transitions.
Support contains 18 out of 228 places after structural reductions.
[2024-06-02 18:48:13] [INFO ] Flatten gal took : 43 ms
[2024-06-02 18:48:13] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:48:13] [INFO ] Input system was already deterministic with 282 transitions.
RANDOM walk for 40000 steps (50 resets) in 1561 ms. (25 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40000 steps (73 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (48 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (33 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (23 resets) in 423 ms. (94 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (47 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (18 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (56 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (27 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (67 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
// Phase 1: matrix 282 rows 228 cols
[2024-06-02 18:48:14] [INFO ] Computed 3 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 27/42 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 97/139 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 171/310 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 10/320 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 10/330 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 139/469 variables, 79/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/469 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 29/498 variables, 21/224 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 8/506 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 4/510 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/510 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/510 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 231 constraints, problems are : Problem set: 0 solved, 9 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 27/42 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 97/139 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 171/310 variables, 77/127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 10/320 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 10/330 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 18:48:15] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 139/469 variables, 79/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 29/498 variables, 21/234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 8/506 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/506 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 4/510 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/510 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/510 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 241 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 1800ms problems are : Problem set: 0 solved, 9 unsolved
Finished Parikh walk after 103 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 9 properties in 1270 ms.
FORMULA CO4-PT-11-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 353 edges and 228 vertex of which 222 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 281
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 219 transition count 273
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 219 transition count 273
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 214 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 214 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 212 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 212 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 210 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 210 transition count 264
Applied a total of 36 rules in 20 ms. Remains 210 /228 variables (removed 18) and now considering 264/282 (removed 18) transitions.
// Phase 1: matrix 264 rows 210 cols
[2024-06-02 18:48:18] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:48:18] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:48:18] [INFO ] Invariant cache hit.
[2024-06-02 18:48:18] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-02 18:48:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/474 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 18:48:22] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 3 ms to minimize.
[2024-06-02 18:48:22] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 0/474 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 215 constraints, problems are : Problem set: 0 solved, 263 unsolved in 11060 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 264/474 variables, 210/215 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 263/478 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/474 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 478 constraints, problems are : Problem set: 0 solved, 263 unsolved in 13566 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
After SMT, in 24718ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 24730ms
Starting structural reductions in LTL mode, iteration 1 : 210/228 places, 264/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24951 ms. Remains : 210/228 places, 264/282 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-11-LTLCardinality-01
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 3 ms.
FORMULA CO4-PT-11-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-01 finished in 25287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Graph (trivial) has 239 edges and 228 vertex of which 3 / 228 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 351 edges and 226 vertex of which 220 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 219 transition count 178
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 190 place count 125 transition count 178
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 190 place count 125 transition count 160
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 226 place count 107 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 228 place count 105 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 105 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 230 place count 105 transition count 156
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 234 place count 103 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 236 place count 101 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 101 transition count 154
Performed 41 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 320 place count 60 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 323 place count 60 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 325 place count 58 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 58 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 355 place count 44 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 363 place count 44 transition count 90
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 373 place count 34 transition count 70
Iterating global reduction 4 with 10 rules applied. Total rules applied 383 place count 34 transition count 70
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 390 place count 34 transition count 63
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 393 place count 31 transition count 54
Iterating global reduction 5 with 3 rules applied. Total rules applied 396 place count 31 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 398 place count 31 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 400 place count 30 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 415 place count 30 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 417 place count 28 transition count 45
Applied a total of 417 rules in 50 ms. Remains 28 /228 variables (removed 200) and now considering 45/282 (removed 237) transitions.
[2024-06-02 18:48:43] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
// Phase 1: matrix 41 rows 28 cols
[2024-06-02 18:48:43] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:48:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 18:48:43] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2024-06-02 18:48:43] [INFO ] Invariant cache hit.
[2024-06-02 18:48:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:48:43] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-02 18:48:43] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2024-06-02 18:48:43] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2024-06-02 18:48:43] [INFO ] Invariant cache hit.
[2024-06-02 18:48:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 40/68 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 1/69 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 32 constraints, problems are : Problem set: 0 solved, 35 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 40/68 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 35/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1/69 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 67 constraints, problems are : Problem set: 0 solved, 35 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 711ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/228 places, 45/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 834 ms. Remains : 28/228 places, 45/282 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA CO4-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-04 finished in 1047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(X(X(X(p2)))&&p1)))))'
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 281
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 220 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 220 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 215 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 215 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 215 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 214 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 214 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 213 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 213 transition count 266
Applied a total of 31 rules in 14 ms. Remains 213 /228 variables (removed 15) and now considering 266/282 (removed 16) transitions.
// Phase 1: matrix 266 rows 213 cols
[2024-06-02 18:48:44] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:48:44] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:48:44] [INFO ] Invariant cache hit.
[2024-06-02 18:48:44] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-06-02 18:48:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/479 variables, 213/216 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:48:49] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:48:49] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 0/479 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 218 constraints, problems are : Problem set: 0 solved, 265 unsolved in 11066 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/479 variables, 213/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 265/483 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 483 constraints, problems are : Problem set: 0 solved, 265 unsolved in 17633 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 2/2 constraints]
After SMT, in 28749ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 28752ms
Starting structural reductions in LTL mode, iteration 1 : 213/228 places, 266/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28934 ms. Remains : 213/228 places, 266/282 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-07 finished in 29152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Graph (trivial) has 237 edges and 228 vertex of which 3 / 228 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 351 edges and 226 vertex of which 220 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 219 transition count 180
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 187 place count 127 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 188 place count 126 transition count 179
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 188 place count 126 transition count 161
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 224 place count 108 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 226 place count 106 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 106 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 228 place count 106 transition count 157
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 232 place count 104 transition count 157
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 234 place count 102 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 102 transition count 155
Performed 40 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 316 place count 62 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 319 place count 62 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 321 place count 60 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 323 place count 60 transition count 99
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 351 place count 46 transition count 100
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 359 place count 46 transition count 92
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 369 place count 36 transition count 72
Iterating global reduction 5 with 10 rules applied. Total rules applied 379 place count 36 transition count 72
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 386 place count 36 transition count 65
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 389 place count 33 transition count 56
Iterating global reduction 6 with 3 rules applied. Total rules applied 392 place count 33 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 394 place count 33 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 396 place count 32 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 410 place count 32 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 412 place count 30 transition count 47
Applied a total of 412 rules in 38 ms. Remains 30 /228 variables (removed 198) and now considering 47/282 (removed 235) transitions.
[2024-06-02 18:49:13] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
// Phase 1: matrix 44 rows 30 cols
[2024-06-02 18:49:13] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:49:13] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 18:49:13] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 18:49:13] [INFO ] Invariant cache hit.
[2024-06-02 18:49:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:49:13] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-02 18:49:13] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2024-06-02 18:49:13] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 18:49:13] [INFO ] Invariant cache hit.
[2024-06-02 18:49:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 43/73 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 1/74 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 34 constraints, problems are : Problem set: 0 solved, 37 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 43/73 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 37/70 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 71 constraints, problems are : Problem set: 0 solved, 37 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 771ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 772ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/228 places, 47/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 896 ms. Remains : 30/228 places, 47/282 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-09 finished in 952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Graph (trivial) has 238 edges and 228 vertex of which 3 / 228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 351 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 223 transition count 179
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 197 place count 126 transition count 179
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 197 place count 126 transition count 161
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 233 place count 108 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 235 place count 106 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 106 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 237 place count 106 transition count 157
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 241 place count 104 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 243 place count 102 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 245 place count 102 transition count 155
Performed 40 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 325 place count 62 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 328 place count 62 transition count 103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 60 transition count 101
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 60 transition count 101
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 360 place count 46 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 368 place count 46 transition count 94
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 379 place count 35 transition count 72
Iterating global reduction 4 with 11 rules applied. Total rules applied 390 place count 35 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 398 place count 35 transition count 64
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 401 place count 32 transition count 55
Iterating global reduction 5 with 3 rules applied. Total rules applied 404 place count 32 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 406 place count 32 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 408 place count 31 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 422 place count 31 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 424 place count 29 transition count 45
Applied a total of 424 rules in 36 ms. Remains 29 /228 variables (removed 199) and now considering 45/282 (removed 237) transitions.
[2024-06-02 18:49:14] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
// Phase 1: matrix 43 rows 29 cols
[2024-06-02 18:49:14] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:49:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 18:49:14] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-02 18:49:14] [INFO ] Invariant cache hit.
[2024-06-02 18:49:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:49:14] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-02 18:49:14] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2024-06-02 18:49:14] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-02 18:49:14] [INFO ] Invariant cache hit.
[2024-06-02 18:49:14] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 42/70 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1/71 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/72 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 34 constraints, problems are : Problem set: 0 solved, 35 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 42/70 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 1/71 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 1/72 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 69 constraints, problems are : Problem set: 0 solved, 35 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 951ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 951ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/228 places, 45/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1055 ms. Remains : 29/228 places, 45/282 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-14
Product exploration explored 100000 steps with 17 reset in 134 ms.
Product exploration explored 100000 steps with 4 reset in 77 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Graph (complete) has 83 edges and 29 vertex of which 27 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 37 ms :[(NOT p0)]
RANDOM walk for 2267 steps (325 resets) in 22 ms. (98 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 18:49:16] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-02 18:49:16] [INFO ] Invariant cache hit.
[2024-06-02 18:49:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 18:49:16] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-02 18:49:16] [INFO ] Invariant cache hit.
[2024-06-02 18:49:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:49:16] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-02 18:49:16] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2024-06-02 18:49:16] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-02 18:49:16] [INFO ] Invariant cache hit.
[2024-06-02 18:49:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 42/70 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1/71 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/72 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 34 constraints, problems are : Problem set: 0 solved, 35 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 42/70 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 1/71 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 1/72 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 69 constraints, problems are : Problem set: 0 solved, 35 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 933ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 933ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1013 ms. Remains : 29/29 places, 45/45 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Graph (complete) has 83 edges and 29 vertex of which 27 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 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 44 ms :[(NOT p0)]
RANDOM walk for 757 steps (105 resets) in 10 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-14 finished in 3050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Graph (trivial) has 234 edges and 228 vertex of which 3 / 228 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 351 edges and 226 vertex of which 220 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 219 transition count 182
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 183 place count 129 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 184 place count 128 transition count 181
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 184 place count 128 transition count 163
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 220 place count 110 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 222 place count 108 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 108 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 224 place count 108 transition count 159
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 106 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 230 place count 104 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 104 transition count 157
Performed 39 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 310 place count 65 transition count 111
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 317 place count 65 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 319 place count 63 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 321 place count 63 transition count 102
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 349 place count 49 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 357 place count 49 transition count 95
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 366 place count 40 transition count 77
Iterating global reduction 5 with 9 rules applied. Total rules applied 375 place count 40 transition count 77
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 381 place count 40 transition count 71
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 383 place count 38 transition count 65
Iterating global reduction 6 with 2 rules applied. Total rules applied 385 place count 38 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 386 place count 38 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 389 place count 38 transition count 61
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 398 place count 38 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 400 place count 36 transition count 59
Applied a total of 400 rules in 25 ms. Remains 36 /228 variables (removed 192) and now considering 59/282 (removed 223) transitions.
[2024-06-02 18:49:17] [INFO ] Flow matrix only has 56 transitions (discarded 3 similar events)
// Phase 1: matrix 56 rows 36 cols
[2024-06-02 18:49:17] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:49:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 18:49:17] [INFO ] Flow matrix only has 56 transitions (discarded 3 similar events)
[2024-06-02 18:49:17] [INFO ] Invariant cache hit.
[2024-06-02 18:49:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:49:17] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-02 18:49:17] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 18:49:17] [INFO ] Flow matrix only has 56 transitions (discarded 3 similar events)
[2024-06-02 18:49:17] [INFO ] Invariant cache hit.
[2024-06-02 18:49:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 55/91 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/92 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 41 constraints, problems are : Problem set: 0 solved, 49 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 36/36 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 55/91 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 49/89 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/92 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 90 constraints, problems are : Problem set: 0 solved, 49 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 36/36 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/228 places, 59/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1196 ms. Remains : 36/228 places, 59/282 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-11-LTLCardinality-15
Product exploration explored 100000 steps with 19 reset in 128 ms.
Product exploration explored 100000 steps with 1 reset in 130 ms.
Computed a total of 7 stabilizing places and 12 stable transitions
Computed a total of 7 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5636 resets) in 324 ms. (123 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (954 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
[2024-06-02 18:49:19] [INFO ] Flow matrix only has 56 transitions (discarded 3 similar events)
[2024-06-02 18:49:19] [INFO ] Invariant cache hit.
[2024-06-02 18:49:19] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/55 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/79 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/81 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/87 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/91 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/92 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/92 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/92 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 36/36 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/55 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 79/92 variables, and 30 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 28/36 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-11-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-11-LTLCardinality-15 finished in 2114 ms.
All properties solved by simple procedures.
Total runtime 67369 ms.
ITS solved all properties within timeout

BK_STOP 1717354159766

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CO4-PT-11, 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 r549-tall-171734897800083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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