Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 191K 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-13-LTLCardinality-00
FORMULA_NAME CO4-PT-13-LTLCardinality-01
FORMULA_NAME CO4-PT-13-LTLCardinality-02
FORMULA_NAME CO4-PT-13-LTLCardinality-03
FORMULA_NAME CO4-PT-13-LTLCardinality-04
FORMULA_NAME CO4-PT-13-LTLCardinality-05
FORMULA_NAME CO4-PT-13-LTLCardinality-06
FORMULA_NAME CO4-PT-13-LTLCardinality-07
FORMULA_NAME CO4-PT-13-LTLCardinality-08
FORMULA_NAME CO4-PT-13-LTLCardinality-09
FORMULA_NAME CO4-PT-13-LTLCardinality-10
FORMULA_NAME CO4-PT-13-LTLCardinality-11
FORMULA_NAME CO4-PT-13-LTLCardinality-12
FORMULA_NAME CO4-PT-13-LTLCardinality-13
FORMULA_NAME CO4-PT-13-LTLCardinality-14
FORMULA_NAME CO4-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717355557103

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:12:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:12:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:12:38] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-06-02 19:12:38] [INFO ] Transformed 649 places.
[2024-06-02 19:12:38] [INFO ] Transformed 816 transitions.
[2024-06-02 19:12:38] [INFO ] Found NUPN structural information;
[2024-06-02 19:12:38] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 239 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 5 formulas.
Deduced a syphon composed of 172 places in 12 ms
Reduce places removed 172 places and 227 transitions.
FORMULA CO4-PT-13-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 589/589 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 585
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 100 place count 381 transition count 503
Iterating global reduction 1 with 80 rules applied. Total rules applied 180 place count 381 transition count 503
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 244 place count 317 transition count 419
Iterating global reduction 1 with 64 rules applied. Total rules applied 308 place count 317 transition count 419
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 314 place count 317 transition count 413
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 340 place count 291 transition count 385
Iterating global reduction 2 with 26 rules applied. Total rules applied 366 place count 291 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 367 place count 291 transition count 384
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 382 place count 276 transition count 369
Iterating global reduction 3 with 15 rules applied. Total rules applied 397 place count 276 transition count 369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 401 place count 276 transition count 365
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 404 place count 273 transition count 362
Iterating global reduction 4 with 3 rules applied. Total rules applied 407 place count 273 transition count 362
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 408 place count 272 transition count 361
Iterating global reduction 4 with 1 rules applied. Total rules applied 409 place count 272 transition count 361
Applied a total of 409 rules in 133 ms. Remains 272 /477 variables (removed 205) and now considering 361/589 (removed 228) transitions.
// Phase 1: matrix 361 rows 272 cols
[2024-06-02 19:12:39] [INFO ] Computed 6 invariants in 24 ms
[2024-06-02 19:12:39] [INFO ] Implicit Places using invariants in 252 ms returned [6, 197]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 278 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 270/477 places, 361/589 transitions.
Applied a total of 0 rules in 7 ms. Remains 270 /270 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 434 ms. Remains : 270/477 places, 361/589 transitions.
Support contains 14 out of 270 places after structural reductions.
[2024-06-02 19:12:39] [INFO ] Flatten gal took : 54 ms
[2024-06-02 19:12:39] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:12:39] [INFO ] Input system was already deterministic with 361 transitions.
RANDOM walk for 40000 steps (224 resets) in 1235 ms. (32 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (277 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (279 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (142 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (233 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (199 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (185 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
// Phase 1: matrix 361 rows 270 cols
[2024-06-02 19:12:40] [INFO ] Computed 4 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 21/40 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 100/140 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 190/330 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 179/509 variables, 87/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 83/592 variables, 49/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/592 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 27/619 variables, 15/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 11/630 variables, 7/273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/630 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/631 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/631 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/631 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 274 constraints, problems are : Problem set: 0 solved, 6 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 21/40 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 100/140 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 190/330 variables, 71/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 179/509 variables, 87/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 83/592 variables, 49/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/592 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 27/619 variables, 15/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/619 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/630 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/631 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/631 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 280 constraints, problems are : Problem set: 0 solved, 6 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1513ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 14191 steps, including 272 resets, run visited all 1 properties in 19 ms. (steps per millisecond=746 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 292 ms.
FORMULA CO4-PT-13-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 541 edges and 270 vertex of which 265 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Graph (trivial) has 281 edges and 270 vertex of which 3 / 270 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 539 edges and 268 vertex of which 263 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 262 transition count 234
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 238 place count 144 transition count 234
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 238 place count 144 transition count 214
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 278 place count 124 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 281 place count 121 transition count 210
Iterating global reduction 2 with 3 rules applied. Total rules applied 284 place count 121 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 284 place count 121 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 120 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 287 place count 119 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 288 place count 119 transition count 208
Performed 44 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 376 place count 75 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 382 place count 75 transition count 143
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 387 place count 70 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 392 place count 70 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 70 transition count 135
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 429 place count 52 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 438 place count 52 transition count 146
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 449 place count 41 transition count 102
Iterating global reduction 5 with 11 rules applied. Total rules applied 460 place count 41 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 468 place count 41 transition count 94
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 471 place count 38 transition count 76
Iterating global reduction 6 with 3 rules applied. Total rules applied 474 place count 38 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 476 place count 38 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 480 place count 36 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 506 place count 36 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 508 place count 34 transition count 62
Applied a total of 508 rules in 74 ms. Remains 34 /270 variables (removed 236) and now considering 62/361 (removed 299) transitions.
[2024-06-02 19:12:42] [INFO ] Flow matrix only has 50 transitions (discarded 12 similar events)
// Phase 1: matrix 50 rows 34 cols
[2024-06-02 19:12:42] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:12:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 19:12:42] [INFO ] Flow matrix only has 50 transitions (discarded 12 similar events)
[2024-06-02 19:12:42] [INFO ] Invariant cache hit.
[2024-06-02 19:12:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:12:42] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-02 19:12:42] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-02 19:12:42] [INFO ] Flow matrix only has 50 transitions (discarded 12 similar events)
[2024-06-02 19:12:42] [INFO ] Invariant cache hit.
[2024-06-02 19:12:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 49/83 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 39 constraints, problems are : Problem set: 0 solved, 47 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 49/83 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 47/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 86 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1777ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1779ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/270 places, 62/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1974 ms. Remains : 34/270 places, 62/361 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-00
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA CO4-PT-13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-00 finished in 2171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 261 transition count 351
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 261 transition count 351
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 253 transition count 343
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 253 transition count 343
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 253 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 247 transition count 336
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 247 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 247 transition count 335
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 242 transition count 330
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 242 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 242 transition count 329
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 240 transition count 327
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 240 transition count 327
Applied a total of 63 rules in 23 ms. Remains 240 /270 variables (removed 30) and now considering 327/361 (removed 34) transitions.
// Phase 1: matrix 327 rows 240 cols
[2024-06-02 19:12:44] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:12:44] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 19:12:44] [INFO ] Invariant cache hit.
[2024-06-02 19:12:44] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2024-06-02 19:12:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-02 19:12:47] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 5 ms to minimize.
[2024-06-02 19:12:47] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:12:47] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 3 ms to minimize.
[2024-06-02 19:12:47] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 327/567 variables, 240/248 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/567 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 248 constraints, problems are : Problem set: 0 solved, 326 unsolved in 14367 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 327/567 variables, 240/248 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 326/574 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 574 constraints, problems are : Problem set: 0 solved, 326 unsolved in 20915 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 4/4 constraints]
After SMT, in 35427ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 35434ms
Starting structural reductions in LTL mode, iteration 1 : 240/270 places, 327/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35672 ms. Remains : 240/270 places, 327/361 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-03 finished in 35824 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 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Graph (trivial) has 276 edges and 270 vertex of which 3 / 270 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 539 edges and 268 vertex of which 263 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 262 transition count 239
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 228 place count 149 transition count 239
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 228 place count 149 transition count 219
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 268 place count 129 transition count 219
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 271 place count 126 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 274 place count 126 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 274 place count 126 transition count 214
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 276 place count 125 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 277 place count 124 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 278 place count 124 transition count 213
Performed 44 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 366 place count 80 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 372 place count 80 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 377 place count 75 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 382 place count 75 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 383 place count 75 transition count 141
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 419 place count 57 transition count 161
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 425 place count 57 transition count 155
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 434 place count 48 transition count 119
Iterating global reduction 5 with 9 rules applied. Total rules applied 443 place count 48 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 448 place count 48 transition count 114
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 451 place count 45 transition count 96
Iterating global reduction 6 with 3 rules applied. Total rules applied 454 place count 45 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 456 place count 45 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 460 place count 43 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 494 place count 43 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 496 place count 41 transition count 82
Applied a total of 496 rules in 82 ms. Remains 41 /270 variables (removed 229) and now considering 82/361 (removed 279) transitions.
[2024-06-02 19:13:20] [INFO ] Flow matrix only has 64 transitions (discarded 18 similar events)
// Phase 1: matrix 64 rows 41 cols
[2024-06-02 19:13:20] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 19:13:20] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 19:13:20] [INFO ] Flow matrix only has 64 transitions (discarded 18 similar events)
[2024-06-02 19:13:20] [INFO ] Invariant cache hit.
[2024-06-02 19:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:13:20] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-06-02 19:13:20] [INFO ] Redundant transitions in 2 ms returned []
Running 67 sub problems to find dead transitions.
[2024-06-02 19:13:20] [INFO ] Flow matrix only has 64 transitions (discarded 18 similar events)
[2024-06-02 19:13:20] [INFO ] Invariant cache hit.
[2024-06-02 19:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 63/104 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 1/105 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 46 constraints, problems are : Problem set: 0 solved, 67 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 63/104 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 67/112 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 1/105 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 113 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 1883ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1884ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/270 places, 82/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2083 ms. Remains : 41/270 places, 82/361 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-07 finished in 2174 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(p0) U p1) U (p1&&X(p2))))'
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 264 transition count 355
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 264 transition count 355
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 258 transition count 349
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 258 transition count 349
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 253 transition count 344
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 253 transition count 344
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 248 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 248 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 248 transition count 338
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 246 transition count 336
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 246 transition count 336
Applied a total of 49 rules in 15 ms. Remains 246 /270 variables (removed 24) and now considering 336/361 (removed 25) transitions.
// Phase 1: matrix 336 rows 246 cols
[2024-06-02 19:13:22] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:13:22] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 19:13:22] [INFO ] Invariant cache hit.
[2024-06-02 19:13:22] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-02 19:13:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 19:13:25] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:13:25] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-02 19:13:25] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-02 19:13:25] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/582 variables, 246/254 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 254 constraints, problems are : Problem set: 0 solved, 335 unsolved in 14551 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/582 variables, 246/254 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 335/589 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 589 constraints, problems are : Problem set: 0 solved, 335 unsolved in 22742 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 4/4 constraints]
After SMT, in 37400ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 37403ms
Starting structural reductions in LTL mode, iteration 1 : 246/270 places, 336/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37630 ms. Remains : 246/270 places, 336/361 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 511 edges and 246 vertex of which 241 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 132 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-13-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-13-LTLCardinality-09 finished in 38410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Graph (trivial) has 281 edges and 270 vertex of which 3 / 270 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 539 edges and 268 vertex of which 263 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 262 transition count 236
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 234 place count 146 transition count 236
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 234 place count 146 transition count 216
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 274 place count 126 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 123 transition count 212
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 123 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 280 place count 123 transition count 211
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 282 place count 122 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 283 place count 121 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 121 transition count 210
Performed 45 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 374 place count 76 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 380 place count 76 transition count 144
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 385 place count 71 transition count 137
Iterating global reduction 3 with 5 rules applied. Total rules applied 390 place count 71 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 71 transition count 136
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 427 place count 53 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 435 place count 53 transition count 148
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 445 place count 43 transition count 108
Iterating global reduction 5 with 10 rules applied. Total rules applied 455 place count 43 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 462 place count 43 transition count 101
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 465 place count 40 transition count 83
Iterating global reduction 6 with 3 rules applied. Total rules applied 468 place count 40 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 470 place count 40 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 474 place count 38 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 504 place count 38 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 506 place count 36 transition count 69
Applied a total of 506 rules in 39 ms. Remains 36 /270 variables (removed 234) and now considering 69/361 (removed 292) transitions.
[2024-06-02 19:14:00] [INFO ] Flow matrix only has 54 transitions (discarded 15 similar events)
// Phase 1: matrix 54 rows 36 cols
[2024-06-02 19:14:00] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:14:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 19:14:00] [INFO ] Flow matrix only has 54 transitions (discarded 15 similar events)
[2024-06-02 19:14:00] [INFO ] Invariant cache hit.
[2024-06-02 19:14:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:14:00] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 19:14:00] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-02 19:14:00] [INFO ] Flow matrix only has 54 transitions (discarded 15 similar events)
[2024-06-02 19:14:00] [INFO ] Invariant cache hit.
[2024-06-02 19:14:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 53/89 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 1/90 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/90 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 41 constraints, problems are : Problem set: 0 solved, 54 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 53/89 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 54/94 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1/90 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 95 constraints, problems are : Problem set: 0 solved, 54 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1376ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/270 places, 69/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1500 ms. Remains : 36/270 places, 69/361 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-15 finished in 1557 ms.
All properties solved by simple procedures.
Total runtime 83964 ms.
ITS solved all properties within timeout

BK_STOP 1717355642496

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CO4-PT-13, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734897800099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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