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.r550-tall-171734898600108.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 itstools
Input is CO4-PT-14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898600108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K 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 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K 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 72K 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 174K 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-14-LTLFireability-00
FORMULA_NAME CO4-PT-14-LTLFireability-01
FORMULA_NAME CO4-PT-14-LTLFireability-02
FORMULA_NAME CO4-PT-14-LTLFireability-03
FORMULA_NAME CO4-PT-14-LTLFireability-04
FORMULA_NAME CO4-PT-14-LTLFireability-05
FORMULA_NAME CO4-PT-14-LTLFireability-06
FORMULA_NAME CO4-PT-14-LTLFireability-07
FORMULA_NAME CO4-PT-14-LTLFireability-08
FORMULA_NAME CO4-PT-14-LTLFireability-09
FORMULA_NAME CO4-PT-14-LTLFireability-10
FORMULA_NAME CO4-PT-14-LTLFireability-11
FORMULA_NAME CO4-PT-14-LTLFireability-12
FORMULA_NAME CO4-PT-14-LTLFireability-13
FORMULA_NAME CO4-PT-14-LTLFireability-14
FORMULA_NAME CO4-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717352197166

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:16:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:16:38] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 18:16:38] [INFO ] Transformed 680 places.
[2024-06-02 18:16:38] [INFO ] Transformed 812 transitions.
[2024-06-02 18:16:38] [INFO ] Found NUPN structural information;
[2024-06-02 18:16:38] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 100 places in 8 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 692/692 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 569 transition count 691
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 133 place count 448 transition count 568
Iterating global reduction 1 with 121 rules applied. Total rules applied 254 place count 448 transition count 568
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 259 place count 448 transition count 563
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 324 place count 383 transition count 498
Iterating global reduction 2 with 65 rules applied. Total rules applied 389 place count 383 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 383 transition count 497
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 402 place count 371 transition count 482
Iterating global reduction 3 with 12 rules applied. Total rules applied 414 place count 371 transition count 482
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 417 place count 371 transition count 479
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 420 place count 368 transition count 476
Iterating global reduction 4 with 3 rules applied. Total rules applied 423 place count 368 transition count 476
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 425 place count 366 transition count 474
Iterating global reduction 4 with 2 rules applied. Total rules applied 427 place count 366 transition count 474
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 366 transition count 472
Applied a total of 429 rules in 140 ms. Remains 366 /580 variables (removed 214) and now considering 472/692 (removed 220) transitions.
// Phase 1: matrix 472 rows 366 cols
[2024-06-02 18:16:38] [INFO ] Computed 5 invariants in 22 ms
[2024-06-02 18:16:39] [INFO ] Implicit Places using invariants in 261 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 365/580 places, 472/692 transitions.
Applied a total of 0 rules in 9 ms. Remains 365 /365 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 457 ms. Remains : 365/580 places, 472/692 transitions.
Support contains 25 out of 365 places after structural reductions.
[2024-06-02 18:16:39] [INFO ] Flatten gal took : 57 ms
[2024-06-02 18:16:39] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:16:39] [INFO ] Input system was already deterministic with 472 transitions.
RANDOM walk for 40000 steps (124 resets) in 2016 ms. (19 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4001 steps (21 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (21 resets) in 55 ms. (71 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (25 resets) in 45 ms. (87 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (19 resets) in 76 ms. (51 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (13 resets) in 25 ms. (154 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (16 resets) in 70 ms. (56 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (15 resets) in 52 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (22 resets) in 32 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (18 resets) in 49 ms. (80 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (24 resets) in 70 ms. (56 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (24 resets) in 25 ms. (153 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (24 resets) in 31 ms. (125 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (27 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (19 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
// Phase 1: matrix 472 rows 365 cols
[2024-06-02 18:16:40] [INFO ] Computed 4 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 62/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 269/346 variables, 85/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 304/650 variables, 154/254 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 13/663 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 3/666 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 129/795 variables, 80/343 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/795 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 36/831 variables, 22/365 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/831 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 6/837 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/837 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/837 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/837 variables, and 369 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1419 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 62/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 269/346 variables, 85/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 304/650 variables, 154/268 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 13/663 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 3/666 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 129/795 variables, 80/357 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/795 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 36/831 variables, 22/379 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/831 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 6/837 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/837 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/837 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 837/837 variables, and 383 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2139 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 3648ms problems are : Problem set: 0 solved, 14 unsolved
Finished Parikh walk after 86 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=86 )
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 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 14 properties in 1283 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 612 edges and 365 vertex of which 362 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 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(p0) U (p1||G((G(F(!p0)) U p2)))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 390 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 360 transition count 336
Reduce places removed 131 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 133 rules applied. Total rules applied 266 place count 229 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 267 place count 228 transition count 293
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 349 place count 187 transition count 293
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 351 place count 185 transition count 291
Iterating global reduction 3 with 2 rules applied. Total rules applied 353 place count 185 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 353 place count 185 transition count 290
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 62 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 479 place count 122 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 487 place count 122 transition count 206
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 489 place count 121 transition count 205
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 494 place count 116 transition count 200
Iterating global reduction 5 with 5 rules applied. Total rules applied 499 place count 116 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 500 place count 116 transition count 199
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 6 with 6 rules applied. Total rules applied 506 place count 113 transition count 196
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 570 place count 81 transition count 198
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 590 place count 81 transition count 178
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 617 place count 54 transition count 124
Iterating global reduction 7 with 27 rules applied. Total rules applied 644 place count 54 transition count 124
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 662 place count 54 transition count 106
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 668 place count 48 transition count 89
Iterating global reduction 8 with 6 rules applied. Total rules applied 674 place count 48 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 678 place count 48 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 682 place count 48 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 684 place count 46 transition count 79
Applied a total of 684 rules in 82 ms. Remains 46 /365 variables (removed 319) and now considering 79/472 (removed 393) transitions.
[2024-06-02 18:16:45] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 46 cols
[2024-06-02 18:16:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:16:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:16:45] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-06-02 18:16:45] [INFO ] Invariant cache hit.
[2024-06-02 18:16:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:16:45] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-06-02 18:16:45] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 18:16:45] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-06-02 18:16:45] [INFO ] Invariant cache hit.
[2024-06-02 18:16:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 73/119 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 52 constraints, problems are : Problem set: 0 solved, 66 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 73/119 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 66/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 118 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1889ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1890ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/365 places, 79/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2099 ms. Remains : 46/365 places, 79/472 transitions.
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-00
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA CO4-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-00 finished in 2565 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&&(p1 U (F(G(!p2)) U p2))))))'
Support contains 4 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 463
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 355 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Applied a total of 22 rules in 29 ms. Remains 354 /365 variables (removed 11) and now considering 461/472 (removed 11) transitions.
// Phase 1: matrix 461 rows 354 cols
[2024-06-02 18:16:48] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:16:48] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:16:48] [INFO ] Invariant cache hit.
[2024-06-02 18:16:48] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-02 18:16:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/815 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-02 18:17:00] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 29 ms to minimize.
[2024-06-02 18:17:00] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/815 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 460/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 820 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 354/365 places, 461/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60461 ms. Remains : 354/365 places, 461/472 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, p2, (NOT p2), (NOT p2)]
Running random walk in product with property : CO4-PT-14-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-01 finished in 60735 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&&X(p1)))||(p0&&X((p1&&X(F(p2)))))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 355 transition count 462
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 353 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 353 transition count 460
Applied a total of 24 rules in 29 ms. Remains 353 /365 variables (removed 12) and now considering 460/472 (removed 12) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 18:17:48] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:17:48] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 18:17:48] [INFO ] Invariant cache hit.
[2024-06-02 18:17:49] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:17:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:18:00] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 3 ms to minimize.
[2024-06-02 18:18:00] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 29865 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 59958ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 59963ms
Starting structural reductions in LTL mode, iteration 1 : 353/365 places, 460/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60256 ms. Remains : 353/365 places, 460/472 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CO4-PT-14-LTLFireability-02
Stuttering criterion allowed to conclude after 58459 steps with 1981 reset in 187 ms.
FORMULA CO4-PT-14-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-02 finished in 60680 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(p1))||p0)))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 463
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 355 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Applied a total of 22 rules in 19 ms. Remains 354 /365 variables (removed 11) and now considering 461/472 (removed 11) transitions.
// Phase 1: matrix 461 rows 354 cols
[2024-06-02 18:18:49] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:18:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 18:18:49] [INFO ] Invariant cache hit.
[2024-06-02 18:18:49] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-02 18:18:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/815 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-02 18:19:01] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 10 ms to minimize.
[2024-06-02 18:19:01] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29881 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/815 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 460/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 820 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
After SMT, in 59980ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 59984ms
Starting structural reductions in LTL mode, iteration 1 : 354/365 places, 461/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60257 ms. Remains : 354/365 places, 461/472 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-14-LTLFireability-03
Product exploration explored 100000 steps with 36 reset in 108 ms.
Product exploration explored 100000 steps with 29 reset in 193 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 600 edges and 354 vertex of which 351 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 30126 steps (20 resets) in 155 ms. (193 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 461/461 transitions.
Applied a total of 0 rules in 8 ms. Remains 354 /354 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-06-02 18:19:50] [INFO ] Invariant cache hit.
[2024-06-02 18:19:50] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 18:19:50] [INFO ] Invariant cache hit.
[2024-06-02 18:19:51] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-02 18:19:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/815 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-02 18:20:02] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:20:03] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/815 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 460/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 820 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in LTL mode , in 1 iterations and 60379 ms. Remains : 354/354 places, 461/461 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 600 edges and 354 vertex of which 351 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (67 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35233 steps (77 resets) in 77 ms. (451 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 1 reset in 114 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 354/354 places, 461/461 transitions.
Graph (trivial) has 382 edges and 354 vertex of which 2 / 354 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 599 edges and 353 vertex of which 350 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
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 350 transition count 457
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 350 transition count 456
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 126 place count 350 transition count 499
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 171 place count 350 transition count 499
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 198 place count 323 transition count 472
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 225 place count 323 transition count 472
Performed 42 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 183 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 267 place count 323 transition count 521
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 274 place count 323 transition count 514
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 296 place count 301 transition count 488
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 318 place count 301 transition count 488
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 320 place count 299 transition count 485
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 299 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 299 transition count 484
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 324 place count 298 transition count 483
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 325 place count 298 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 326 place count 298 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 298 transition count 482
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 329 place count 296 transition count 480
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 296 transition count 480
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 332 place count 296 transition count 480
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 333 place count 295 transition count 479
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 334 place count 295 transition count 479
Performed 54 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 388 place count 295 transition count 696
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 440 place count 295 transition count 644
Discarding 111 places :
Symmetric choice reduction at 6 with 111 rule applications. Total rules 551 place count 184 transition count 393
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 6 with 111 rules applied. Total rules applied 662 place count 184 transition count 393
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 696 place count 184 transition count 359
Discarding 70 places :
Symmetric choice reduction at 7 with 70 rule applications. Total rules 766 place count 114 transition count 234
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 7 with 70 rules applied. Total rules applied 836 place count 114 transition count 234
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 843 place count 114 transition count 227
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 857 place count 100 transition count 199
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 8 with 14 rules applied. Total rules applied 871 place count 100 transition count 199
Deduced a syphon composed of 57 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 883 place count 100 transition count 187
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 884 place count 99 transition count 186
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 885 place count 99 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 886 place count 99 transition count 207
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 887 place count 98 transition count 199
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 888 place count 98 transition count 199
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 888 rules in 108 ms. Remains 98 /354 variables (removed 256) and now considering 199/461 (removed 262) transitions.
[2024-06-02 18:20:52] [INFO ] Redundant transitions in 5 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-02 18:20:52] [INFO ] Flow matrix only has 194 transitions (discarded 5 similar events)
// Phase 1: matrix 194 rows 98 cols
[2024-06-02 18:20:52] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:20:52] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 18:20:53] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:20:53] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:20:53] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-02 18:20:53] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 186 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
At refinement iteration 4 (OVERLAPS) 193/291 variables, 98/106 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 16/122 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/122 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/292 variables, 1/123 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/123 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/292 variables, 0/123 constraints. Problems are: Problem set: 127 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 123 constraints, problems are : Problem set: 127 solved, 71 unsolved in 3322 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 127 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 11/52 variables, 4/4 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/8 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 185/237 variables, 52/60 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 16/76 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 71/147 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/147 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 54/291 variables, 46/193 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/193 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 1/292 variables, 1/194 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/194 constraints. Problems are: Problem set: 127 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/292 variables, 0/194 constraints. Problems are: Problem set: 127 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 194 constraints, problems are : Problem set: 127 solved, 71 unsolved in 2529 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 71/198 constraints, Known Traps: 4/4 constraints]
After SMT, in 5892ms problems are : Problem set: 127 solved, 71 unsolved
Search for dead transitions found 127 dead transitions in 5897ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/354 places, 72/461 transitions.
Graph (complete) has 142 edges and 98 vertex of which 42 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 42 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 11 ms. Remains 42 /98 variables (removed 56) and now considering 85/72 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/354 places, 85/461 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6030 ms. Remains : 42/354 places, 85/461 transitions.
Built C files in :
/tmp/ltsmin16535454936559502989
[2024-06-02 18:20:58] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16535454936559502989
Running compilation step : cd /tmp/ltsmin16535454936559502989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 865 ms.
Running link step : cd /tmp/ltsmin16535454936559502989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16535454936559502989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1886867406218783322.hoa' '--buchi-type=spotba'
LTSmin run took 886 ms.
FORMULA CO4-PT-14-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLFireability-03 finished in 131050 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)||(X(p1)&&F(p2))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 357 transition count 464
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 357 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 356 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 356 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 355 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 355 transition count 462
Applied a total of 20 rules in 31 ms. Remains 355 /365 variables (removed 10) and now considering 462/472 (removed 10) transitions.
// Phase 1: matrix 462 rows 355 cols
[2024-06-02 18:21:00] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:21:00] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 18:21:00] [INFO ] Invariant cache hit.
[2024-06-02 18:21:00] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-02 18:21:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/817 variables, 355/359 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 18:21:12] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 3 ms to minimize.
[2024-06-02 18:21:12] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 0/817 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 361 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 462/817 variables, 355/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 461/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 0/817 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 822 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 355/365 places, 462/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60374 ms. Remains : 355/365 places, 462/472 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-06
Product exploration explored 100000 steps with 12 reset in 92 ms.
Product exploration explored 100000 steps with 8 reset in 102 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2))), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 120 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (128 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (89 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1754464 steps, run timeout after 3001 ms. (steps per millisecond=584 ) properties seen :0 out of 1
Probabilistic random walk after 1754464 steps, saw 310515 distinct states, run finished after 3004 ms. (steps per millisecond=584 ) properties seen :0
[2024-06-02 18:22:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/41 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 146/187 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/195 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/211 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 236/447 variables, 99/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 260/707 variables, 123/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/707 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 102/809 variables, 68/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/809 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/817 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/817 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/817 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/41 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 146/187 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/195 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/211 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 236/447 variables, 99/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 260/707 variables, 123/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/707 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 102/809 variables, 68/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/809 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/817 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/817 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/817 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2))), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 12 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-14-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-14-LTLFireability-06 finished in 64715 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(p0))'
Support contains 1 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 394 edges and 365 vertex of which 2 / 365 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 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 360 transition count 335
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 267 place count 228 transition count 292
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 351 place count 186 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 353 place count 184 transition count 290
Iterating global reduction 2 with 2 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 355 place count 184 transition count 289
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 357 place count 183 transition count 289
Performed 63 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 483 place count 120 transition count 212
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 8 rules applied. Total rules applied 491 place count 120 transition count 204
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 493 place count 119 transition count 203
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 498 place count 114 transition count 198
Iterating global reduction 4 with 5 rules applied. Total rules applied 503 place count 114 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 504 place count 114 transition count 197
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 5 with 6 rules applied. Total rules applied 510 place count 111 transition count 194
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 576 place count 78 transition count 196
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 596 place count 78 transition count 176
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 624 place count 50 transition count 120
Iterating global reduction 6 with 28 rules applied. Total rules applied 652 place count 50 transition count 120
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 670 place count 50 transition count 102
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 677 place count 43 transition count 82
Iterating global reduction 7 with 7 rules applied. Total rules applied 684 place count 43 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 689 place count 43 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 693 place count 43 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 695 place count 41 transition count 71
Applied a total of 695 rules in 47 ms. Remains 41 /365 variables (removed 324) and now considering 71/472 (removed 401) transitions.
[2024-06-02 18:22:05] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
// Phase 1: matrix 66 rows 41 cols
[2024-06-02 18:22:05] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:22:05] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 18:22:05] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 18:22:05] [INFO ] Invariant cache hit.
[2024-06-02 18:22:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:22:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-02 18:22:05] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-02 18:22:05] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 18:22:05] [INFO ] Invariant cache hit.
[2024-06-02 18:22:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 65/106 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 1/107 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 47 constraints, problems are : Problem set: 0 solved, 58 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 65/106 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 58/104 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 105 constraints, problems are : Problem set: 0 solved, 58 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1407ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1407ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/365 places, 71/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1538 ms. Remains : 41/365 places, 71/472 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-08
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA CO4-PT-14-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-08 finished in 1599 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 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 390 edges and 365 vertex of which 2 / 365 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 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 360 transition count 335
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 267 place count 228 transition count 293
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 349 place count 187 transition count 293
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 351 place count 185 transition count 291
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 185 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 353 place count 185 transition count 290
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 355 place count 184 transition count 290
Performed 62 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 479 place count 122 transition count 215
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 7 rules applied. Total rules applied 486 place count 122 transition count 208
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 488 place count 121 transition count 207
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 493 place count 116 transition count 202
Iterating global reduction 4 with 5 rules applied. Total rules applied 498 place count 116 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 499 place count 116 transition count 201
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 5 with 6 rules applied. Total rules applied 505 place count 113 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 571 place count 80 transition count 200
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 592 place count 80 transition count 179
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 620 place count 52 transition count 123
Iterating global reduction 6 with 28 rules applied. Total rules applied 648 place count 52 transition count 123
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 666 place count 52 transition count 105
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 672 place count 46 transition count 87
Iterating global reduction 7 with 6 rules applied. Total rules applied 678 place count 46 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 682 place count 46 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 688 place count 46 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 690 place count 45 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 692 place count 43 transition count 83
Applied a total of 692 rules in 38 ms. Remains 43 /365 variables (removed 322) and now considering 83/472 (removed 389) transitions.
[2024-06-02 18:22:06] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
// Phase 1: matrix 76 rows 43 cols
[2024-06-02 18:22:06] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:22:06] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 18:22:06] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:22:06] [INFO ] Invariant cache hit.
[2024-06-02 18:22:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:22:06] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 18:22:06] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-06-02 18:22:06] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:22:06] [INFO ] Invariant cache hit.
[2024-06-02 18:22:06] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 50 constraints, problems are : Problem set: 0 solved, 71 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 71/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 121 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2163ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/365 places, 83/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2283 ms. Remains : 43/365 places, 83/472 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-09
Product exploration explored 100000 steps with 4 reset in 105 ms.
Product exploration explored 100000 steps with 1 reset in 80 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 1130 steps (108 resets) in 27 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-02 18:22:09] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:22:09] [INFO ] Invariant cache hit.
[2024-06-02 18:22:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 18:22:09] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:22:09] [INFO ] Invariant cache hit.
[2024-06-02 18:22:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:22:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-02 18:22:09] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-06-02 18:22:09] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:22:09] [INFO ] Invariant cache hit.
[2024-06-02 18:22:09] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 50 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 71/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 121 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2203ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2204ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2304 ms. Remains : 43/43 places, 83/83 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 3139 steps (302 resets) in 10 ms. (285 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22 reset in 50 ms.
Product exploration explored 100000 steps with 13 reset in 53 ms.
Built C files in :
/tmp/ltsmin1703691594522751782
[2024-06-02 18:22:12] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-06-02 18:22:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:22:12] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-06-02 18:22:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:22:12] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-06-02 18:22:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:22:12] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1703691594522751782
Running compilation step : cd /tmp/ltsmin1703691594522751782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin1703691594522751782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1703691594522751782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10842332476587863912.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA CO4-PT-14-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLFireability-09 finished in 6139 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(F((F(p0)&&(!p1||X(G(p2))))))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 355 transition count 462
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 353 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 353 transition count 460
Applied a total of 24 rules in 32 ms. Remains 353 /365 variables (removed 12) and now considering 460/472 (removed 12) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 18:22:13] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:22:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 18:22:13] [INFO ] Invariant cache hit.
[2024-06-02 18:22:13] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:22:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:22:25] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:22:25] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 353/365 places, 460/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60394 ms. Remains : 353/365 places, 460/472 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-14-LTLFireability-12
Product exploration explored 100000 steps with 27 reset in 93 ms.
Stack based approach found an accepted trace after 62 steps with 1 reset with depth 35 and stack size 35 in 0 ms.
FORMULA CO4-PT-14-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-14-LTLFireability-12 finished in 60769 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(X(X(F(p0)))))))'
Support contains 1 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 463
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 463
Applied a total of 18 rules in 13 ms. Remains 356 /365 variables (removed 9) and now considering 463/472 (removed 9) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 18:23:13] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:23:13] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:23:13] [INFO ] Invariant cache hit.
[2024-06-02 18:23:14] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:23:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 3 ms to minimize.
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 29884 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 59978ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 59983ms
Starting structural reductions in LTL mode, iteration 1 : 356/365 places, 463/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60298 ms. Remains : 356/365 places, 463/472 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-14
Product exploration explored 100000 steps with 16666 reset in 151 ms.
Product exploration explored 100000 steps with 16666 reset in 159 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (168 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (113 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14471 steps, run visited all 1 properties in 30 ms. (steps per millisecond=482 )
Probabilistic random walk after 14471 steps, saw 3647 distinct states, run finished after 34 ms. (steps per millisecond=425 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2024-06-02 18:24:15] [INFO ] Invariant cache hit.
[2024-06-02 18:24:15] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:24:15] [INFO ] Invariant cache hit.
[2024-06-02 18:24:15] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:24:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:24:27] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:24:27] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in LTL mode , in 1 iterations and 60381 ms. Remains : 356/356 places, 463/463 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (94 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (94 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14471 steps, run visited all 1 properties in 34 ms. (steps per millisecond=425 )
Probabilistic random walk after 14471 steps, saw 3647 distinct states, run finished after 34 ms. (steps per millisecond=425 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 98 ms.
Product exploration explored 100000 steps with 16666 reset in 102 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Graph (trivial) has 386 edges and 356 vertex of which 2 / 356 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 352 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 352 transition count 458
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 127 place count 352 transition count 502
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 173 place count 352 transition count 502
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 200 place count 325 transition count 475
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 227 place count 325 transition count 475
Performed 41 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 268 place count 325 transition count 524
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 275 place count 325 transition count 517
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 296 place count 304 transition count 492
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 317 place count 304 transition count 492
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 319 place count 302 transition count 489
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 302 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 322 place count 302 transition count 488
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 323 place count 301 transition count 487
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 324 place count 301 transition count 487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 325 place count 301 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 301 transition count 486
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 328 place count 299 transition count 484
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 330 place count 299 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 331 place count 299 transition count 484
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 332 place count 298 transition count 483
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 298 transition count 483
Performed 54 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 387 place count 298 transition count 700
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 5 with 49 rules applied. Total rules applied 436 place count 298 transition count 651
Discarding 111 places :
Symmetric choice reduction at 6 with 111 rule applications. Total rules 547 place count 187 transition count 399
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 6 with 111 rules applied. Total rules applied 658 place count 187 transition count 399
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 690 place count 187 transition count 367
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 757 place count 120 transition count 248
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 824 place count 120 transition count 248
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 829 place count 120 transition count 243
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 841 place count 108 transition count 219
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 853 place count 108 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 854 place count 108 transition count 244
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 861 place count 108 transition count 237
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 864 place count 105 transition count 219
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 867 place count 105 transition count 219
Deduced a syphon composed of 60 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 880 place count 105 transition count 206
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 881 place count 104 transition count 205
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 882 place count 104 transition count 205
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 882 rules in 94 ms. Remains 104 /356 variables (removed 252) and now considering 205/463 (removed 258) transitions.
[2024-06-02 18:25:18] [INFO ] Redundant transitions in 2 ms returned []
Running 204 sub problems to find dead transitions.
[2024-06-02 18:25:18] [INFO ] Flow matrix only has 198 transitions (discarded 7 similar events)
// Phase 1: matrix 198 rows 104 cols
[2024-06-02 18:25:18] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:25:18] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 7 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 192 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
At refinement iteration 4 (OVERLAPS) 197/301 variables, 104/112 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 17/129 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/129 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/130 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/130 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/130 constraints. Problems are: Problem set: 127 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 130 constraints, problems are : Problem set: 127 solved, 77 unsolved in 3596 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 127 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 11/55 variables, 4/4 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/8 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 190/245 variables, 55/63 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 17/80 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 77/157 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/157 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 56/301 variables, 49/206 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/206 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/207 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/207 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/207 constraints. Problems are: Problem set: 127 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 207 constraints, problems are : Problem set: 127 solved, 77 unsolved in 2883 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 77/204 constraints, Known Traps: 4/4 constraints]
After SMT, in 6531ms problems are : Problem set: 127 solved, 77 unsolved
Search for dead transitions found 127 dead transitions in 6534ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/356 places, 78/463 transitions.
Graph (complete) has 149 edges and 104 vertex of which 45 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.1 ms
Discarding 59 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 108
Deduced a syphon composed of 2 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 45 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 10 rules in 12 ms. Remains 45 /104 variables (removed 59) and now considering 101/78 (removed -23) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/356 places, 101/463 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6673 ms. Remains : 45/356 places, 101/463 transitions.
Built C files in :
/tmp/ltsmin17400923547587942709
[2024-06-02 18:25:24] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17400923547587942709
Running compilation step : cd /tmp/ltsmin17400923547587942709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 745 ms.
Running link step : cd /tmp/ltsmin17400923547587942709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17400923547587942709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17007881424427686860.hoa' '--buchi-type=spotba'
LTSmin run took 378 ms.
FORMULA CO4-PT-14-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLFireability-14 finished in 132077 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 2 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 394 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 360 transition count 334
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 269 place count 227 transition count 333
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 269 place count 227 transition count 291
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 353 place count 185 transition count 291
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 355 place count 183 transition count 289
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 183 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 357 place count 183 transition count 288
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 359 place count 182 transition count 288
Performed 61 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 481 place count 121 transition count 216
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 2 with 10 rules applied. Total rules applied 491 place count 121 transition count 206
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 493 place count 120 transition count 205
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 498 place count 115 transition count 200
Iterating global reduction 4 with 5 rules applied. Total rules applied 503 place count 115 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 504 place count 115 transition count 199
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 5 with 6 rules applied. Total rules applied 510 place count 112 transition count 196
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 576 place count 79 transition count 198
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 597 place count 79 transition count 177
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 625 place count 51 transition count 121
Iterating global reduction 6 with 28 rules applied. Total rules applied 653 place count 51 transition count 121
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 672 place count 51 transition count 102
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 679 place count 44 transition count 82
Iterating global reduction 7 with 7 rules applied. Total rules applied 686 place count 44 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 691 place count 44 transition count 77
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 8 with 2 rules applied. Total rules applied 693 place count 43 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 704 place count 43 transition count 83
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 714 place count 43 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 715 place count 42 transition count 82
Applied a total of 715 rules in 30 ms. Remains 42 /365 variables (removed 323) and now considering 82/472 (removed 390) transitions.
[2024-06-02 18:25:25] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
// Phase 1: matrix 72 rows 42 cols
[2024-06-02 18:25:25] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:25:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 18:25:25] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2024-06-02 18:25:25] [INFO ] Invariant cache hit.
[2024-06-02 18:25:25] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 18:25:25] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-02 18:25:25] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-02 18:25:25] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2024-06-02 18:25:25] [INFO ] Invariant cache hit.
[2024-06-02 18:25:25] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 71/113 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 18:25:26] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/114 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 68 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 71/113 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 79/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/114 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/114 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 147 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
After SMT, in 2610ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 2612ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/365 places, 82/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2729 ms. Remains : 42/365 places, 82/472 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-14-LTLFireability-15
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-15 finished in 2873 ms.
All properties solved by simple procedures.
Total runtime 530452 ms.

BK_STOP 1717352728778

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-14.tgz
mv CO4-PT-14 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;