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.r553-tall-171734900900115.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CO4-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900900115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 6.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 255K 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-15-LTLCardinality-00
FORMULA_NAME CO4-PT-15-LTLCardinality-01
FORMULA_NAME CO4-PT-15-LTLCardinality-02
FORMULA_NAME CO4-PT-15-LTLCardinality-03
FORMULA_NAME CO4-PT-15-LTLCardinality-04
FORMULA_NAME CO4-PT-15-LTLCardinality-05
FORMULA_NAME CO4-PT-15-LTLCardinality-06
FORMULA_NAME CO4-PT-15-LTLCardinality-07
FORMULA_NAME CO4-PT-15-LTLCardinality-08
FORMULA_NAME CO4-PT-15-LTLCardinality-09
FORMULA_NAME CO4-PT-15-LTLCardinality-10
FORMULA_NAME CO4-PT-15-LTLCardinality-11
FORMULA_NAME CO4-PT-15-LTLCardinality-12
FORMULA_NAME CO4-PT-15-LTLCardinality-13
FORMULA_NAME CO4-PT-15-LTLCardinality-14
FORMULA_NAME CO4-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717351813157

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:10:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:10:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:10:14] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-02 18:10:14] [INFO ] Transformed 833 places.
[2024-06-02 18:10:14] [INFO ] Transformed 1106 transitions.
[2024-06-02 18:10:14] [INFO ] Found NUPN structural information;
[2024-06-02 18:10:14] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 124 places in 10 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 689 transition count 906
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 180 place count 532 transition count 748
Iterating global reduction 1 with 157 rules applied. Total rules applied 337 place count 532 transition count 748
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 344 place count 532 transition count 741
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 422 place count 454 transition count 652
Iterating global reduction 2 with 78 rules applied. Total rules applied 500 place count 454 transition count 652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 501 place count 454 transition count 651
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 517 place count 438 transition count 626
Iterating global reduction 3 with 16 rules applied. Total rules applied 533 place count 438 transition count 626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 534 place count 438 transition count 625
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 542 place count 430 transition count 617
Iterating global reduction 4 with 8 rules applied. Total rules applied 550 place count 430 transition count 617
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 555 place count 425 transition count 612
Iterating global reduction 4 with 5 rules applied. Total rules applied 560 place count 425 transition count 612
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 565 place count 425 transition count 607
Applied a total of 565 rules in 154 ms. Remains 425 /709 variables (removed 284) and now considering 607/909 (removed 302) transitions.
// Phase 1: matrix 607 rows 425 cols
[2024-06-02 18:10:14] [INFO ] Computed 7 invariants in 25 ms
[2024-06-02 18:10:15] [INFO ] Implicit Places using invariants in 300 ms returned [5, 361]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 330 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 423/709 places, 607/909 transitions.
Applied a total of 0 rules in 11 ms. Remains 423 /423 variables (removed 0) and now considering 607/607 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 513 ms. Remains : 423/709 places, 607/909 transitions.
Support contains 26 out of 423 places after structural reductions.
[2024-06-02 18:10:15] [INFO ] Flatten gal took : 63 ms
[2024-06-02 18:10:15] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:10:15] [INFO ] Input system was already deterministic with 607 transitions.
RANDOM walk for 40000 steps (646 resets) in 2540 ms. (15 steps per ms) remains 7/16 properties
BEST_FIRST walk for 40003 steps (153 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (158 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (163 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (162 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (154 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (146 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (120 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
// Phase 1: matrix 607 rows 423 cols
[2024-06-02 18:10:16] [INFO ] Computed 5 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 27/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 274/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 19/331 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 8/339 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 449/788 variables, 211/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/788 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 215/1003 variables, 139/408 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 25/1028 variables, 19/427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1028 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/1030 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1030 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1030 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1030/1030 variables, and 428 constraints, problems are : Problem set: 0 solved, 7 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 27/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 274/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 19/331 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 8/339 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 449/788 variables, 211/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/788 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 215/1003 variables, 139/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 25/1028 variables, 19/434 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1028 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/1030 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1030 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/1030 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1030/1030 variables, and 435 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1958ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 7 properties in 253 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 895 edges and 423 vertex of which 420 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 406 transition count 589
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 406 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 406 transition count 588
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 401 transition count 583
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 401 transition count 583
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 401 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 400 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 400 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 400 transition count 578
Applied a total of 51 rules in 50 ms. Remains 400 /423 variables (removed 23) and now considering 578/607 (removed 29) transitions.
// Phase 1: matrix 578 rows 400 cols
[2024-06-02 18:10:19] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:10:19] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 18:10:19] [INFO ] Invariant cache hit.
[2024-06-02 18:10:19] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2024-06-02 18:10:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-06-02 18:10:29] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (OVERLAPS) 578/978 variables, 400/406 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-06-02 18:10:37] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 4 ms to minimize.
[2024-06-02 18:10:37] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 408 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (OVERLAPS) 578/978 variables, 400/408 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 577/985 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 985 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 3/3 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 400/423 places, 578/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60697 ms. Remains : 400/423 places, 578/607 transitions.
Stuttering acceptance computed with spot in 398 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA CO4-PT-15-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-01 finished in 61165 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 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Graph (trivial) has 459 edges and 423 vertex of which 2 / 423 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 894 edges and 422 vertex of which 419 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 418 transition count 443
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 318 place count 262 transition count 442
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 318 place count 262 transition count 398
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 406 place count 218 transition count 398
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 414 place count 210 transition count 390
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 210 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 210 transition count 388
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 424 place count 210 transition count 384
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 432 place count 206 transition count 384
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 435 place count 203 transition count 380
Iterating global reduction 3 with 3 rules applied. Total rules applied 438 place count 203 transition count 380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 441 place count 203 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 442 place count 202 transition count 377
Performed 64 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 570 place count 138 transition count 296
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 18 rules applied. Total rules applied 588 place count 138 transition count 278
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 592 place count 136 transition count 276
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 595 place count 133 transition count 270
Iterating global reduction 7 with 3 rules applied. Total rules applied 598 place count 133 transition count 270
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 606 place count 129 transition count 266
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 607 place count 128 transition count 264
Iterating global reduction 7 with 1 rules applied. Total rules applied 608 place count 128 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 609 place count 128 transition count 263
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 691 place count 87 transition count 306
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 712 place count 87 transition count 285
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 740 place count 59 transition count 173
Iterating global reduction 9 with 28 rules applied. Total rules applied 768 place count 59 transition count 173
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 787 place count 59 transition count 154
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 794 place count 52 transition count 116
Iterating global reduction 10 with 7 rules applied. Total rules applied 801 place count 52 transition count 116
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 806 place count 52 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 808 place count 51 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 11 with 17 rules applied. Total rules applied 825 place count 51 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 827 place count 49 transition count 109
Applied a total of 827 rules in 146 ms. Remains 49 /423 variables (removed 374) and now considering 109/607 (removed 498) transitions.
[2024-06-02 18:11:20] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
// Phase 1: matrix 81 rows 49 cols
[2024-06-02 18:11:20] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:11:20] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:11:20] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
[2024-06-02 18:11:20] [INFO ] Invariant cache hit.
[2024-06-02 18:11:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:11:20] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-06-02 18:11:20] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-02 18:11:20] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
[2024-06-02 18:11:20] [INFO ] Invariant cache hit.
[2024-06-02 18:11:20] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 80/129 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 57 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 80/129 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 89/145 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 146 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1444 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 2857ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 2859ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/423 places, 109/607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3149 ms. Remains : 49/423 places, 109/607 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-03
Stuttering criterion allowed to conclude after 1722 steps with 145 reset in 18 ms.
FORMULA CO4-PT-15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-03 finished in 3241 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))&&F(p1)))'
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Graph (trivial) has 456 edges and 423 vertex of which 2 / 423 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 894 edges and 422 vertex of which 419 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 418 transition count 447
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 154 rules applied. Total rules applied 311 place count 266 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 312 place count 265 transition count 445
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 312 place count 265 transition count 401
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 400 place count 221 transition count 401
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 408 place count 213 transition count 392
Iterating global reduction 3 with 8 rules applied. Total rules applied 416 place count 213 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 418 place count 213 transition count 390
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 418 place count 213 transition count 387
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 424 place count 210 transition count 387
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 426 place count 208 transition count 384
Iterating global reduction 4 with 2 rules applied. Total rules applied 428 place count 208 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 429 place count 208 transition count 383
Performed 66 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 561 place count 142 transition count 300
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 17 rules applied. Total rules applied 578 place count 142 transition count 283
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 582 place count 140 transition count 281
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 585 place count 137 transition count 275
Iterating global reduction 7 with 3 rules applied. Total rules applied 588 place count 137 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 594 place count 134 transition count 272
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 595 place count 133 transition count 270
Iterating global reduction 7 with 1 rules applied. Total rules applied 596 place count 133 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 597 place count 133 transition count 269
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 679 place count 92 transition count 317
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 700 place count 92 transition count 296
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 728 place count 64 transition count 184
Iterating global reduction 9 with 28 rules applied. Total rules applied 756 place count 64 transition count 184
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 775 place count 64 transition count 165
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 782 place count 57 transition count 127
Iterating global reduction 10 with 7 rules applied. Total rules applied 789 place count 57 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 794 place count 57 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 798 place count 55 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 820 place count 55 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 822 place count 53 transition count 123
Applied a total of 822 rules in 67 ms. Remains 53 /423 variables (removed 370) and now considering 123/607 (removed 484) transitions.
[2024-06-02 18:11:23] [INFO ] Flow matrix only has 92 transitions (discarded 31 similar events)
// Phase 1: matrix 92 rows 53 cols
[2024-06-02 18:11:23] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:11:23] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 18:11:23] [INFO ] Flow matrix only has 92 transitions (discarded 31 similar events)
[2024-06-02 18:11:23] [INFO ] Invariant cache hit.
[2024-06-02 18:11:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 18:11:23] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-02 18:11:23] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-02 18:11:23] [INFO ] Flow matrix only has 92 transitions (discarded 31 similar events)
[2024-06-02 18:11:23] [INFO ] Invariant cache hit.
[2024-06-02 18:11:23] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 91/144 variables, 53/58 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 1/145 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 62 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 91/144 variables, 53/58 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 103/164 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1/145 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 165 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1700 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 3142ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 3143ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/423 places, 123/607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3307 ms. Remains : 53/423 places, 123/607 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-05 finished in 3440 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' '!((!p0 U (G(p1)&&X(F(p0)))))'
Support contains 6 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 409 transition count 592
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 409 transition count 592
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 405 transition count 588
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 405 transition count 588
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 405 transition count 586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 404 transition count 585
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 404 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 404 transition count 584
Applied a total of 41 rules in 22 ms. Remains 404 /423 variables (removed 19) and now considering 584/607 (removed 23) transitions.
// Phase 1: matrix 584 rows 404 cols
[2024-06-02 18:11:27] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:11:27] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:11:27] [INFO ] Invariant cache hit.
[2024-06-02 18:11:27] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2024-06-02 18:11:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 584/988 variables, 404/409 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-02 18:11:44] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 3 ms to minimize.
[2024-06-02 18:11:44] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 3 ms to minimize.
[2024-06-02 18:11:45] [INFO ] Deduced a trap composed of 153 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/988 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/988 variables, and 412 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-02 18:12:04] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (OVERLAPS) 584/988 variables, 404/413 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/988 variables, 583/996 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/988 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/988 variables, and 996 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 4/4 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Starting structural reductions in LTL mode, iteration 1 : 404/423 places, 584/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60567 ms. Remains : 404/423 places, 584/607 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-15-LTLCardinality-06
Product exploration explored 100000 steps with 50 reset in 177 ms.
Product exploration explored 100000 steps with 460 reset in 142 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 864 edges and 404 vertex of which 401 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 222 ms. Reduced automaton from 5 states, 14 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (744 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (166 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1496514 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :0 out of 1
Probabilistic random walk after 1496514 steps, saw 262351 distinct states, run finished after 3006 ms. (steps per millisecond=497 ) properties seen :0
[2024-06-02 18:12:31] [INFO ] Invariant cache hit.
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) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 212/226 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/243 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/251 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 409/660 variables, 176/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/660 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 284/944 variables, 166/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/944 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 37/981 variables, 26/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/981 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/988 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/988 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/988 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 988/988 variables, and 409 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 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) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 212/226 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 17/243 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/251 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 409/660 variables, 176/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/660 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 284/944 variables, 166/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/944 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/981 variables, 26/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/981 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/988 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/988 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/988 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 988/988 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 496ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 13 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-15-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-15-LTLCardinality-06 finished in 65121 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))||(F(p1)&&G(p2))))'
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 410 transition count 593
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 410 transition count 593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 410 transition count 592
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 405 transition count 587
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 405 transition count 587
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 405 transition count 584
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 404 transition count 583
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 404 transition count 583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 404 transition count 582
Applied a total of 43 rules in 23 ms. Remains 404 /423 variables (removed 19) and now considering 582/607 (removed 25) transitions.
// Phase 1: matrix 582 rows 404 cols
[2024-06-02 18:12:32] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 18:12:32] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 18:12:32] [INFO ] Invariant cache hit.
[2024-06-02 18:12:32] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-06-02 18:12:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-02 18:12:42] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 582/986 variables, 404/410 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-02 18:12:50] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:12:50] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/986 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 412 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 582/986 variables, 404/412 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/986 variables, 581/993 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/986 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 993 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 3/3 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in LTL mode, iteration 1 : 404/423 places, 582/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60575 ms. Remains : 404/423 places, 582/607 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-09
Stuttering criterion allowed to conclude after 2172 steps with 46 reset in 5 ms.
FORMULA CO4-PT-15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-09 finished in 60744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(G(p2)&&p1))))))'
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 408 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 408 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 408 transition count 590
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 403 transition count 585
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 403 transition count 585
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 403 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 402 transition count 581
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 402 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 402 transition count 580
Applied a total of 47 rules in 17 ms. Remains 402 /423 variables (removed 21) and now considering 580/607 (removed 27) transitions.
// Phase 1: matrix 580 rows 402 cols
[2024-06-02 18:13:32] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:13:32] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:13:32] [INFO ] Invariant cache hit.
[2024-06-02 18:13:33] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2024-06-02 18:13:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:13:43] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/408 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:13:50] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:13:50] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 982/982 variables, and 410 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/410 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 579/989 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 152 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/982 variables, 1/990 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 990 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 4/4 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in LTL mode, iteration 1 : 402/423 places, 580/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 402/423 places, 580/607 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CO4-PT-15-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-10 finished in 60752 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((X(X(p1))&&p0)))'
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 408 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 408 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 408 transition count 590
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 404 transition count 586
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 404 transition count 586
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 404 transition count 584
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 403 transition count 583
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 403 transition count 583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 403 transition count 582
Applied a total of 44 rules in 26 ms. Remains 403 /423 variables (removed 20) and now considering 582/607 (removed 25) transitions.
// Phase 1: matrix 582 rows 403 cols
[2024-06-02 18:14:33] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 18:14:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 18:14:33] [INFO ] Invariant cache hit.
[2024-06-02 18:14:33] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-06-02 18:14:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 582/985 variables, 403/408 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-02 18:14:50] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:14:50] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 410 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-02 18:15:10] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (OVERLAPS) 582/985 variables, 403/411 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 581/992 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-02 18:15:25] [INFO ] Deduced a trap composed of 153 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/985 variables, 1/993 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 993 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 4/4 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 403/423 places, 582/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60579 ms. Remains : 403/423 places, 582/607 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-11
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA CO4-PT-15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-11 finished in 60754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Graph (trivial) has 454 edges and 423 vertex of which 2 / 423 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 894 edges and 422 vertex of which 419 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 418 transition count 446
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 155 rules applied. Total rules applied 313 place count 265 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 314 place count 264 transition count 444
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 314 place count 264 transition count 401
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 400 place count 221 transition count 401
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 407 place count 214 transition count 393
Iterating global reduction 3 with 7 rules applied. Total rules applied 414 place count 214 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 214 transition count 392
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 415 place count 214 transition count 389
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 211 transition count 389
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 424 place count 208 transition count 385
Iterating global reduction 4 with 3 rules applied. Total rules applied 427 place count 208 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 429 place count 208 transition count 383
Performed 66 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 561 place count 142 transition count 300
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 17 rules applied. Total rules applied 578 place count 142 transition count 283
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 582 place count 140 transition count 281
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 585 place count 137 transition count 275
Iterating global reduction 7 with 3 rules applied. Total rules applied 588 place count 137 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 594 place count 134 transition count 272
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 595 place count 133 transition count 270
Iterating global reduction 7 with 1 rules applied. Total rules applied 596 place count 133 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 597 place count 133 transition count 269
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 677 place count 93 transition count 315
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 697 place count 93 transition count 295
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 723 place count 67 transition count 191
Iterating global reduction 9 with 26 rules applied. Total rules applied 749 place count 67 transition count 191
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 767 place count 67 transition count 173
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 773 place count 61 transition count 137
Iterating global reduction 10 with 6 rules applied. Total rules applied 779 place count 61 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 783 place count 61 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 785 place count 60 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 11 with 18 rules applied. Total rules applied 803 place count 60 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 805 place count 58 transition count 130
Applied a total of 805 rules in 70 ms. Remains 58 /423 variables (removed 365) and now considering 130/607 (removed 477) transitions.
[2024-06-02 18:15:34] [INFO ] Flow matrix only has 109 transitions (discarded 21 similar events)
// Phase 1: matrix 109 rows 58 cols
[2024-06-02 18:15:34] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:15:34] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:15:34] [INFO ] Flow matrix only has 109 transitions (discarded 21 similar events)
[2024-06-02 18:15:34] [INFO ] Invariant cache hit.
[2024-06-02 18:15:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 18:15:34] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-02 18:15:34] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-02 18:15:34] [INFO ] Flow matrix only has 109 transitions (discarded 21 similar events)
[2024-06-02 18:15:34] [INFO ] Invariant cache hit.
[2024-06-02 18:15:34] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 108/166 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/167 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 67 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 108/166 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 110/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/167 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 177 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 3751ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3753ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/423 places, 130/607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3990 ms. Remains : 58/423 places, 130/607 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-13
Stuttering criterion allowed to conclude after 121 steps with 9 reset in 1 ms.
FORMULA CO4-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-13 finished in 4109 ms.
All properties solved by simple procedures.
Total runtime 324144 ms.
ITS solved all properties within timeout

BK_STOP 1717352138492

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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