Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748678979464

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 08:09:40] [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]
[2025-05-31 08:09:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:09:40] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2025-05-31 08:09:40] [INFO ] Transformed 3924 places.
[2025-05-31 08:09:41] [INFO ] Transformed 6192 transitions.
[2025-05-31 08:09:41] [INFO ] Found NUPN structural information;
[2025-05-31 08:09:41] [INFO ] Parsed PT model containing 3924 places and 6192 transitions and 17304 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DLCround-PT-10b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 3924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3924/3924 places, 6192/6192 transitions.
Discarding 694 places :
Symmetric choice reduction at 0 with 694 rule applications. Total rules 694 place count 3230 transition count 5498
Iterating global reduction 0 with 694 rules applied. Total rules applied 1388 place count 3230 transition count 5498
Discarding 562 places :
Symmetric choice reduction at 0 with 562 rule applications. Total rules 1950 place count 2668 transition count 4936
Iterating global reduction 0 with 562 rules applied. Total rules applied 2512 place count 2668 transition count 4936
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 2523 place count 2668 transition count 4925
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 2593 place count 2598 transition count 4734
Iterating global reduction 1 with 70 rules applied. Total rules applied 2663 place count 2598 transition count 4734
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 2701 place count 2560 transition count 4696
Iterating global reduction 1 with 38 rules applied. Total rules applied 2739 place count 2560 transition count 4696
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 2743 place count 2560 transition count 4692
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 2766 place count 2537 transition count 4669
Iterating global reduction 2 with 23 rules applied. Total rules applied 2789 place count 2537 transition count 4669
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 2812 place count 2514 transition count 4646
Iterating global reduction 2 with 23 rules applied. Total rules applied 2835 place count 2514 transition count 4646
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2857 place count 2492 transition count 4624
Iterating global reduction 2 with 22 rules applied. Total rules applied 2879 place count 2492 transition count 4624
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 2890 place count 2481 transition count 4613
Iterating global reduction 2 with 11 rules applied. Total rules applied 2901 place count 2481 transition count 4613
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2908 place count 2474 transition count 4606
Iterating global reduction 2 with 7 rules applied. Total rules applied 2915 place count 2474 transition count 4606
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2922 place count 2467 transition count 4599
Iterating global reduction 2 with 7 rules applied. Total rules applied 2929 place count 2467 transition count 4599
Applied a total of 2929 rules in 1970 ms. Remains 2467 /3924 variables (removed 1457) and now considering 4599/6192 (removed 1593) transitions.
// Phase 1: matrix 4599 rows 2467 cols
[2025-05-31 08:09:47] [INFO ] Computed 213 invariants in 59 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:09:49] [INFO ] Implicit Places using invariants in 2016 ms returned []
[2025-05-31 08:09:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:09:53] [INFO ] Implicit Places using invariants and state equation in 3374 ms returned []
Implicit Place search using SMT with State Equation took 8011 ms to find 0 implicit places.
Running 4598 sub problems to find dead transitions.
[2025-05-31 08:09:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2466/7066 variables, and 0 constraints, problems are : Problem set: 0 solved, 4598 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2467 constraints, PredecessorRefiner: 4598/4598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4598 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2466/7066 variables, and 0 constraints, problems are : Problem set: 0 solved, 4598 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2467 constraints, PredecessorRefiner: 0/4598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62582ms problems are : Problem set: 0 solved, 4598 unsolved
Search for dead transitions found 0 dead transitions in 62613ms
Starting structural reductions in LTL mode, iteration 1 : 2467/3924 places, 4599/6192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72628 ms. Remains : 2467/3924 places, 4599/6192 transitions.
Support contains 42 out of 2467 places after structural reductions.
[2025-05-31 08:10:56] [INFO ] Flatten gal took : 250 ms
[2025-05-31 08:10:56] [INFO ] Flatten gal took : 164 ms
[2025-05-31 08:10:56] [INFO ] Input system was already deterministic with 4599 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (8 resets) in 1917 ms. (20 steps per ms) remains 6/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
[2025-05-31 08:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 591/602 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1865/2467 variables, 202/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2467 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4599/7066 variables, 2467/2680 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7066 variables, 0/2680 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7066/7066 variables, and 2680 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2467/2467 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 591/602 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1865/2467 variables, 202/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2467 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4599/7066 variables, 2467/2680 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7066 variables, 6/2686 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:11:05] [INFO ] Deduced a trap along path composed of 6 places in 41 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/7066 variables, 1/2687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7066 variables, 0/2687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7066/7066 variables, and 2687 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2467/2467 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 10061ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 2467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Graph (trivial) has 2148 edges and 2467 vertex of which 578 / 2467 are part of one of the 48 SCC in 7 ms
Free SCC test removed 530 places
Drop transitions (Empty/Sink Transition effects.) removed 604 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 619 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 375 rules applied. Total rules applied 376 place count 1937 transition count 3605
Reduce places removed 375 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 420 rules applied. Total rules applied 796 place count 1562 transition count 3560
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 826 place count 1532 transition count 3560
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 207 Pre rules applied. Total rules applied 826 place count 1532 transition count 3353
Deduced a syphon composed of 207 places in 15 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 414 rules applied. Total rules applied 1240 place count 1325 transition count 3353
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 1316 place count 1249 transition count 2730
Iterating global reduction 3 with 76 rules applied. Total rules applied 1392 place count 1249 transition count 2730
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1396 place count 1249 transition count 2726
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 1396 place count 1249 transition count 2719
Deduced a syphon composed of 7 places in 13 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1410 place count 1242 transition count 2719
Performed 476 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 476 places in 1 ms
Reduce places removed 476 places and 0 transitions.
Iterating global reduction 4 with 952 rules applied. Total rules applied 2362 place count 766 transition count 2233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2371 place count 766 transition count 2224
Renaming transitions due to excessive name length > 1024 char.
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 2399 place count 738 transition count 1844
Iterating global reduction 5 with 28 rules applied. Total rules applied 2427 place count 738 transition count 1844
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 2453 place count 738 transition count 1818
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -479
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 2537 place count 696 transition count 2297
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2554 place count 696 transition count 2280
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 2577 place count 673 transition count 1655
Iterating global reduction 7 with 23 rules applied. Total rules applied 2600 place count 673 transition count 1655
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 2622 place count 673 transition count 1633
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2630 place count 669 transition count 1670
Drop transitions (Redundant composition of simpler transitions.) removed 176 transitions
Redundant transition composition rules discarded 176 transitions
Iterating global reduction 8 with 176 rules applied. Total rules applied 2806 place count 669 transition count 1494
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 2817 place count 658 transition count 1339
Iterating global reduction 8 with 11 rules applied. Total rules applied 2828 place count 658 transition count 1339
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 2839 place count 658 transition count 1328
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2847 place count 654 transition count 1358
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2852 place count 654 transition count 1353
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 2874 place count 654 transition count 1331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2882 place count 650 transition count 1358
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2888 place count 650 transition count 1352
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 2909 place count 650 transition count 1331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2917 place count 646 transition count 1358
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2923 place count 646 transition count 1352
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 2944 place count 646 transition count 1331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2952 place count 642 transition count 1358
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2958 place count 642 transition count 1352
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 2979 place count 642 transition count 1331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2987 place count 638 transition count 1358
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2993 place count 638 transition count 1352
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 3014 place count 638 transition count 1331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 3022 place count 634 transition count 1360
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3028 place count 634 transition count 1354
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 3049 place count 634 transition count 1333
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 3057 place count 630 transition count 1362
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 3063 place count 630 transition count 1356
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 3084 place count 630 transition count 1335
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 3092 place count 626 transition count 1366
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 3098 place count 626 transition count 1360
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 3119 place count 626 transition count 1339
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 3127 place count 622 transition count 1368
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 3134 place count 622 transition count 1361
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 18 with 20 rules applied. Total rules applied 3154 place count 622 transition count 1341
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 3162 place count 618 transition count 1368
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 3168 place count 618 transition count 1362
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 3189 place count 618 transition count 1341
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 3197 place count 614 transition count 1368
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 3203 place count 614 transition count 1362
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 3224 place count 614 transition count 1341
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 3232 place count 610 transition count 1372
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 3238 place count 610 transition count 1366
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 3259 place count 610 transition count 1345
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 3267 place count 606 transition count 1374
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 3273 place count 606 transition count 1368
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 3294 place count 606 transition count 1347
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 3302 place count 602 transition count 1374
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 3308 place count 602 transition count 1368
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 3329 place count 602 transition count 1347
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 3337 place count 598 transition count 1374
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 3343 place count 598 transition count 1368
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 3364 place count 598 transition count 1347
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 3372 place count 594 transition count 1374
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 3378 place count 594 transition count 1368
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 3399 place count 594 transition count 1347
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 3407 place count 590 transition count 1376
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3413 place count 590 transition count 1370
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 26 with 21 rules applied. Total rules applied 3434 place count 590 transition count 1349
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 3442 place count 586 transition count 1380
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 3448 place count 586 transition count 1374
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 27 with 21 rules applied. Total rules applied 3469 place count 586 transition count 1353
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 3477 place count 582 transition count 1380
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 27 with 7 rules applied. Total rules applied 3484 place count 582 transition count 1373
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 28 with 20 rules applied. Total rules applied 3504 place count 582 transition count 1353
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 3512 place count 578 transition count 1380
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 28 with 6 rules applied. Total rules applied 3518 place count 578 transition count 1374
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 29 with 21 rules applied. Total rules applied 3539 place count 578 transition count 1353
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 3547 place count 574 transition count 1377
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 3551 place count 574 transition count 1373
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 30 with 20 rules applied. Total rules applied 3571 place count 574 transition count 1353
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 3579 place count 570 transition count 1376
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 3583 place count 570 transition count 1372
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 3602 place count 570 transition count 1353
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3610 place count 566 transition count 1373
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3614 place count 566 transition count 1369
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3633 place count 566 transition count 1350
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3641 place count 562 transition count 1369
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3645 place count 562 transition count 1365
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 3664 place count 562 transition count 1346
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3672 place count 558 transition count 1365
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3676 place count 558 transition count 1361
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3695 place count 558 transition count 1342
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3703 place count 554 transition count 1361
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3707 place count 554 transition count 1357
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3726 place count 554 transition count 1338
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3734 place count 550 transition count 1357
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3738 place count 550 transition count 1353
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 3757 place count 550 transition count 1334
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3765 place count 546 transition count 1356
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3769 place count 546 transition count 1352
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3788 place count 546 transition count 1333
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3796 place count 542 transition count 1356
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3800 place count 542 transition count 1352
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 38 with 19 rules applied. Total rules applied 3819 place count 542 transition count 1333
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3827 place count 538 transition count 1358
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3831 place count 538 transition count 1354
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3850 place count 538 transition count 1335
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3858 place count 534 transition count 1362
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3862 place count 534 transition count 1358
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 40 with 19 rules applied. Total rules applied 3881 place count 534 transition count 1339
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 8 rules applied. Total rules applied 3889 place count 530 transition count 1366
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3893 place count 530 transition count 1362
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 41 with 19 rules applied. Total rules applied 3912 place count 530 transition count 1343
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 8 rules applied. Total rules applied 3920 place count 526 transition count 1362
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3924 place count 526 transition count 1358
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3943 place count 526 transition count 1339
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 42 with 8 rules applied. Total rules applied 3951 place count 522 transition count 1358
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 3955 place count 522 transition count 1354
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 43 with 19 rules applied. Total rules applied 3974 place count 522 transition count 1335
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 43 with 8 rules applied. Total rules applied 3982 place count 518 transition count 1358
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 43 with 4 rules applied. Total rules applied 3986 place count 518 transition count 1354
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 44 with 19 rules applied. Total rules applied 4005 place count 518 transition count 1335
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 44 with 8 rules applied. Total rules applied 4013 place count 514 transition count 1362
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 44 with 4 rules applied. Total rules applied 4017 place count 514 transition count 1358
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 45 with 19 rules applied. Total rules applied 4036 place count 514 transition count 1339
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 45 with 8 rules applied. Total rules applied 4044 place count 510 transition count 1366
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 45 with 4 rules applied. Total rules applied 4048 place count 510 transition count 1362
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 46 with 19 rules applied. Total rules applied 4067 place count 510 transition count 1343
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 46 with 8 rules applied. Total rules applied 4075 place count 506 transition count 1362
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 4079 place count 506 transition count 1358
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 47 with 19 rules applied. Total rules applied 4098 place count 506 transition count 1339
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 8 rules applied. Total rules applied 4106 place count 502 transition count 1358
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 4110 place count 502 transition count 1354
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 48 with 19 rules applied. Total rules applied 4129 place count 502 transition count 1335
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 48 with 8 rules applied. Total rules applied 4137 place count 498 transition count 1354
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 4141 place count 498 transition count 1350
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 49 with 19 rules applied. Total rules applied 4160 place count 498 transition count 1331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 49 with 8 rules applied. Total rules applied 4168 place count 494 transition count 1350
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 49 with 4 rules applied. Total rules applied 4172 place count 494 transition count 1346
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 50 with 19 rules applied. Total rules applied 4191 place count 494 transition count 1327
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 50 with 8 rules applied. Total rules applied 4199 place count 490 transition count 1346
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 50 with 4 rules applied. Total rules applied 4203 place count 490 transition count 1342
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 51 with 19 rules applied. Total rules applied 4222 place count 490 transition count 1323
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 51 with 8 rules applied. Total rules applied 4230 place count 486 transition count 1350
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 51 with 4 rules applied. Total rules applied 4234 place count 486 transition count 1346
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 52 with 19 rules applied. Total rules applied 4253 place count 486 transition count 1327
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 52 with 8 rules applied. Total rules applied 4261 place count 482 transition count 1354
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 52 with 4 rules applied. Total rules applied 4265 place count 482 transition count 1350
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 53 with 19 rules applied. Total rules applied 4284 place count 482 transition count 1331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 53 with 8 rules applied. Total rules applied 4292 place count 478 transition count 1354
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 53 with 4 rules applied. Total rules applied 4296 place count 478 transition count 1350
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 54 with 19 rules applied. Total rules applied 4315 place count 478 transition count 1331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 54 with 8 rules applied. Total rules applied 4323 place count 474 transition count 1350
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 54 with 4 rules applied. Total rules applied 4327 place count 474 transition count 1346
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 55 with 19 rules applied. Total rules applied 4346 place count 474 transition count 1327
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 55 with 8 rules applied. Total rules applied 4354 place count 470 transition count 1346
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 55 with 4 rules applied. Total rules applied 4358 place count 470 transition count 1342
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 56 with 19 rules applied. Total rules applied 4377 place count 470 transition count 1323
Free-agglomeration rule applied 46 times with reduction of 9 identical transitions.
Iterating global reduction 56 with 46 rules applied. Total rules applied 4423 place count 470 transition count 1268
Reduce places removed 46 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 457 transitions
Reduce isomorphic transitions removed 457 transitions.
Graph (complete) has 1321 edges and 424 vertex of which 304 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.1 ms
Discarding 120 places :
Also discarding 0 output transitions
Iterating post reduction 56 with 504 rules applied. Total rules applied 4927 place count 304 transition count 811
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 57 with 120 rules applied. Total rules applied 5047 place count 304 transition count 691
Drop transitions (Redundant composition of simpler transitions.) removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 58 with 109 rules applied. Total rules applied 5156 place count 304 transition count 582
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 58 with 1 rules applied. Total rules applied 5157 place count 303 transition count 581
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 58 with 6 rules applied. Total rules applied 5163 place count 297 transition count 581
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 59 with 72 rules applied. Total rules applied 5235 place count 249 transition count 557
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 59 with 68 rules applied. Total rules applied 5303 place count 249 transition count 489
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 60 with 159 rules applied. Total rules applied 5462 place count 143 transition count 436
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (trivial) has 12 edges and 143 vertex of which 10 / 143 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 60 with 145 rules applied. Total rules applied 5607 place count 138 transition count 292
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 94 transitions.
Graph (complete) has 283 edges and 134 vertex of which 94 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Iterating post reduction 61 with 99 rules applied. Total rules applied 5706 place count 94 transition count 178
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 62 with 20 rules applied. Total rules applied 5726 place count 94 transition count 158
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 63 with 51 rules applied. Total rules applied 5777 place count 60 transition count 141
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 63 with 43 rules applied. Total rules applied 5820 place count 60 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 64 with 18 rules applied. Total rules applied 5838 place count 60 transition count 80
Graph (complete) has 132 edges and 60 vertex of which 32 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 0 output transitions
Iterating post reduction 64 with 1 rules applied. Total rules applied 5839 place count 32 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 65 with 36 rules applied. Total rules applied 5875 place count 32 transition count 44
Applied a total of 5875 rules in 3257 ms. Remains 32 /2467 variables (removed 2435) and now considering 44/4599 (removed 4555) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3257 ms. Remains : 32/2467 places, 44/4599 transitions.
RANDOM walk for 382 steps (0 resets) in 15 ms. (23 steps per ms) remains 0/6 properties
Computed a total of 424 stabilizing places and 424 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(!p0) U X(p1)))))'
Support contains 4 out of 2467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2454 transition count 4573
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2454 transition count 4573
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 2449 transition count 4568
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 2449 transition count 4568
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2448 transition count 4567
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2448 transition count 4567
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 2447 transition count 4566
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 2447 transition count 4566
Applied a total of 40 rules in 518 ms. Remains 2447 /2467 variables (removed 20) and now considering 4566/4599 (removed 33) transitions.
// Phase 1: matrix 4566 rows 2447 cols
[2025-05-31 08:11:12] [INFO ] Computed 213 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:11:13] [INFO ] Implicit Places using invariants in 1734 ms returned []
[2025-05-31 08:11:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:11:17] [INFO ] Implicit Places using invariants and state equation in 3547 ms returned []
Implicit Place search using SMT with State Equation took 5284 ms to find 0 implicit places.
Running 4565 sub problems to find dead transitions.
[2025-05-31 08:11:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2446/7013 variables, and 0 constraints, problems are : Problem set: 0 solved, 4565 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2447 constraints, PredecessorRefiner: 4565/4565 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4565 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2446/7013 variables, and 0 constraints, problems are : Problem set: 0 solved, 4565 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2447 constraints, PredecessorRefiner: 0/4565 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62231ms problems are : Problem set: 0 solved, 4565 unsolved
Search for dead transitions found 0 dead transitions in 62244ms
Starting structural reductions in LTL mode, iteration 1 : 2447/2467 places, 4566/4599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68061 ms. Remains : 2447/2467 places, 4566/4599 transitions.
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3434 steps with 0 reset in 30 ms.
FORMULA DLCround-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10b-LTLFireability-01 finished in 68621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Graph (trivial) has 2157 edges and 2467 vertex of which 578 / 2467 are part of one of the 48 SCC in 3 ms
Free SCC test removed 530 places
Ensure Unique test removed 571 transitions
Reduce isomorphic transitions removed 571 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 375 rules applied. Total rules applied 376 place count 1936 transition count 3652
Reduce places removed 375 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 420 rules applied. Total rules applied 796 place count 1561 transition count 3607
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 31 rules applied. Total rules applied 827 place count 1531 transition count 3606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 828 place count 1530 transition count 3606
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 207 Pre rules applied. Total rules applied 828 place count 1530 transition count 3399
Deduced a syphon composed of 207 places in 15 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 4 with 414 rules applied. Total rules applied 1242 place count 1323 transition count 3399
Discarding 81 places :
Symmetric choice reduction at 4 with 81 rule applications. Total rules 1323 place count 1242 transition count 2706
Iterating global reduction 4 with 81 rules applied. Total rules applied 1404 place count 1242 transition count 2706
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1407 place count 1242 transition count 2703
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1407 place count 1242 transition count 2696
Deduced a syphon composed of 7 places in 12 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1421 place count 1235 transition count 2696
Performed 475 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 475 places in 1 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 5 with 950 rules applied. Total rules applied 2371 place count 760 transition count 2210
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 2382 place count 760 transition count 2199
Renaming transitions due to excessive name length > 1024 char.
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 2410 place count 732 transition count 1819
Iterating global reduction 6 with 28 rules applied. Total rules applied 2438 place count 732 transition count 1819
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 2464 place count 732 transition count 1793
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 2488 place count 720 transition count 1908
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2492 place count 720 transition count 1904
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2496 place count 716 transition count 1812
Iterating global reduction 8 with 4 rules applied. Total rules applied 2500 place count 716 transition count 1812
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2504 place count 716 transition count 1808
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2512 place count 712 transition count 1846
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 9 with 43 rules applied. Total rules applied 2555 place count 712 transition count 1803
Discarding 22 places :
Symmetric choice reduction at 9 with 22 rule applications. Total rules 2577 place count 690 transition count 1759
Iterating global reduction 9 with 22 rules applied. Total rules applied 2599 place count 690 transition count 1759
Discarding 22 places :
Symmetric choice reduction at 9 with 22 rule applications. Total rules 2621 place count 668 transition count 1447
Iterating global reduction 9 with 22 rules applied. Total rules applied 2643 place count 668 transition count 1447
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 2665 place count 668 transition count 1425
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2666 place count 667 transition count 1424
Applied a total of 2666 rules in 539 ms. Remains 667 /2467 variables (removed 1800) and now considering 1424/4599 (removed 3175) transitions.
[2025-05-31 08:12:20] [INFO ] Flow matrix only has 1394 transitions (discarded 30 similar events)
// Phase 1: matrix 1394 rows 667 cols
[2025-05-31 08:12:20] [INFO ] Computed 213 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:12:21] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-05-31 08:12:21] [INFO ] Flow matrix only has 1394 transitions (discarded 30 similar events)
[2025-05-31 08:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:12:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 08:12:21] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:12:21] [INFO ] Redundant transitions in 103 ms returned []
Running 1347 sub problems to find dead transitions.
[2025-05-31 08:12:21] [INFO ] Flow matrix only has 1394 transitions (discarded 30 similar events)
[2025-05-31 08:12:21] [INFO ] Invariant cache hit.
[2025-05-31 08:12:21] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/666 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/2061 variables, and 15 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/213 constraints, State Equation: 0/667 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 1347/1347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1347 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/666 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/666 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 2 (OVERLAPS) 1/667 variables, 198/213 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/2061 variables, and 213 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 0/667 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/1347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61258ms problems are : Problem set: 0 solved, 1347 unsolved
Search for dead transitions found 0 dead transitions in 61261ms
Starting structural reductions in SI_LTL mode, iteration 1 : 667/2467 places, 1424/4599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62947 ms. Remains : 667/2467 places, 1424/4599 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10b-LTLFireability-02 finished in 63029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 2 out of 2467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2454 transition count 4560
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2454 transition count 4560
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 2450 transition count 4556
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 2450 transition count 4556
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2449 transition count 4555
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2449 transition count 4555
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2448 transition count 4554
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2448 transition count 4554
Applied a total of 38 rules in 475 ms. Remains 2448 /2467 variables (removed 19) and now considering 4554/4599 (removed 45) transitions.
// Phase 1: matrix 4554 rows 2448 cols
[2025-05-31 08:13:23] [INFO ] Computed 213 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:13:25] [INFO ] Implicit Places using invariants in 1595 ms returned []
[2025-05-31 08:13:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:13:28] [INFO ] Implicit Places using invariants and state equation in 3273 ms returned []
Implicit Place search using SMT with State Equation took 4870 ms to find 0 implicit places.
Running 4553 sub problems to find dead transitions.
[2025-05-31 08:13:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2447/7002 variables, and 0 constraints, problems are : Problem set: 0 solved, 4553 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2448 constraints, PredecessorRefiner: 4553/4553 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4553 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2447/7002 variables, and 0 constraints, problems are : Problem set: 0 solved, 4553 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2448 constraints, PredecessorRefiner: 0/4553 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62078ms problems are : Problem set: 0 solved, 4553 unsolved
Search for dead transitions found 0 dead transitions in 62085ms
Starting structural reductions in LTL mode, iteration 1 : 2448/2467 places, 4554/4599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67443 ms. Remains : 2448/2467 places, 4554/4599 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10b-LTLFireability-03 finished in 67628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(!p0))||(p1&&F(!p0))))&&F(G(p2)))))'
Support contains 4 out of 2467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Graph (trivial) has 2153 edges and 2467 vertex of which 577 / 2467 are part of one of the 48 SCC in 1 ms
Free SCC test removed 529 places
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 569 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 375 rules applied. Total rules applied 376 place count 1937 transition count 3654
Reduce places removed 375 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 420 rules applied. Total rules applied 796 place count 1562 transition count 3609
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 826 place count 1532 transition count 3609
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 207 Pre rules applied. Total rules applied 826 place count 1532 transition count 3402
Deduced a syphon composed of 207 places in 15 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 414 rules applied. Total rules applied 1240 place count 1325 transition count 3402
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 1319 place count 1246 transition count 2724
Iterating global reduction 3 with 79 rules applied. Total rules applied 1398 place count 1246 transition count 2724
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1402 place count 1246 transition count 2720
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 1402 place count 1246 transition count 2714
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1414 place count 1240 transition count 2714
Performed 476 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 476 places in 0 ms
Reduce places removed 476 places and 0 transitions.
Iterating global reduction 4 with 952 rules applied. Total rules applied 2366 place count 764 transition count 2227
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 2377 place count 764 transition count 2216
Renaming transitions due to excessive name length > 1024 char.
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 2405 place count 736 transition count 1836
Iterating global reduction 5 with 28 rules applied. Total rules applied 2433 place count 736 transition count 1836
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 2459 place count 736 transition count 1810
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2483 place count 724 transition count 1925
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2487 place count 724 transition count 1921
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2491 place count 720 transition count 1829
Iterating global reduction 7 with 4 rules applied. Total rules applied 2495 place count 720 transition count 1829
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2499 place count 720 transition count 1825
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2507 place count 716 transition count 1863
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 8 with 42 rules applied. Total rules applied 2549 place count 716 transition count 1821
Discarding 21 places :
Symmetric choice reduction at 8 with 21 rule applications. Total rules 2570 place count 695 transition count 1779
Iterating global reduction 8 with 21 rules applied. Total rules applied 2591 place count 695 transition count 1779
Discarding 21 places :
Symmetric choice reduction at 8 with 21 rule applications. Total rules 2612 place count 674 transition count 1481
Iterating global reduction 8 with 21 rules applied. Total rules applied 2633 place count 674 transition count 1481
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 2654 place count 674 transition count 1460
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2655 place count 673 transition count 1459
Applied a total of 2655 rules in 436 ms. Remains 673 /2467 variables (removed 1794) and now considering 1459/4599 (removed 3140) transitions.
[2025-05-31 08:14:31] [INFO ] Flow matrix only has 1428 transitions (discarded 31 similar events)
// Phase 1: matrix 1428 rows 673 cols
[2025-05-31 08:14:31] [INFO ] Computed 213 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:14:31] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-05-31 08:14:31] [INFO ] Flow matrix only has 1428 transitions (discarded 31 similar events)
[2025-05-31 08:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:14:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 08:14:32] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:14:32] [INFO ] Redundant transitions in 29 ms returned []
Running 1381 sub problems to find dead transitions.
[2025-05-31 08:14:32] [INFO ] Flow matrix only has 1428 transitions (discarded 31 similar events)
[2025-05-31 08:14:32] [INFO ] Invariant cache hit.
[2025-05-31 08:14:32] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/2101 variables, and 15 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/213 constraints, State Equation: 0/673 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/672 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (OVERLAPS) 1/673 variables, 198/213 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/2101 variables, and 213 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 0/673 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61199ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 61201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 673/2467 places, 1459/4599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62649 ms. Remains : 673/2467 places, 1459/4599 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p2) p0), (NOT p2), p0]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10b-LTLFireability-04 finished in 62800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0&&X(X(p1))) U (G((p0&&X(X(p1))))||(p0&&X((X(p1)&&G(!p2)))))) U (!p1&&((p0&&X(X(p1))) U (G((p0&&X(X(p1))))||(p0&&X((X(p1)&&G(!p2))))))))))'
Support contains 4 out of 2467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2455 transition count 4561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2455 transition count 4561
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 2451 transition count 4557
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 2451 transition count 4557
Applied a total of 32 rules in 324 ms. Remains 2451 /2467 variables (removed 16) and now considering 4557/4599 (removed 42) transitions.
// Phase 1: matrix 4557 rows 2451 cols
[2025-05-31 08:15:33] [INFO ] Computed 213 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:15:35] [INFO ] Implicit Places using invariants in 1521 ms returned []
[2025-05-31 08:15:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:15:38] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 4820 ms to find 0 implicit places.
Running 4556 sub problems to find dead transitions.
[2025-05-31 08:15:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2450/7008 variables, and 0 constraints, problems are : Problem set: 0 solved, 4556 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2451 constraints, PredecessorRefiner: 4556/4556 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4556 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2450/7008 variables, and 0 constraints, problems are : Problem set: 0 solved, 4556 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2451 constraints, PredecessorRefiner: 0/4556 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62068ms problems are : Problem set: 0 solved, 4556 unsolved
Search for dead transitions found 0 dead transitions in 62076ms
Starting structural reductions in LTL mode, iteration 1 : 2451/2467 places, 4557/4599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67237 ms. Remains : 2451/2467 places, 4557/4599 transitions.
Stuttering acceptance computed with spot in 443 ms :[true, true, (OR (NOT p1) (AND (NOT p0) p2)), true, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), true, p2, (OR (NOT p1) p2), (OR (NOT p1) (AND (NOT p0) p2)), (OR (NOT p1) (AND (NOT p0) p2))]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10b-LTLFireability-05 finished in 67742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(!X(p0) U !X((p0 U !p1)))||X(p2)))'
Support contains 5 out of 2467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2454 transition count 4560
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2454 transition count 4560
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 2449 transition count 4555
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 2449 transition count 4555
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2448 transition count 4554
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2448 transition count 4554
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 2447 transition count 4553
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 2447 transition count 4553
Applied a total of 40 rules in 498 ms. Remains 2447 /2467 variables (removed 20) and now considering 4553/4599 (removed 46) transitions.
// Phase 1: matrix 4553 rows 2447 cols
[2025-05-31 08:16:41] [INFO ] Computed 213 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:16:43] [INFO ] Implicit Places using invariants in 1585 ms returned []
[2025-05-31 08:16:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:16:46] [INFO ] Implicit Places using invariants and state equation in 3309 ms returned []
Implicit Place search using SMT with State Equation took 4897 ms to find 0 implicit places.
Running 4552 sub problems to find dead transitions.
[2025-05-31 08:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2446/7000 variables, and 0 constraints, problems are : Problem set: 0 solved, 4552 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2447 constraints, PredecessorRefiner: 4552/4552 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4552 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2446/7000 variables, and 0 constraints, problems are : Problem set: 0 solved, 4552 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2447 constraints, PredecessorRefiner: 0/4552 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62029ms problems are : Problem set: 0 solved, 4552 unsolved
Search for dead transitions found 0 dead transitions in 62038ms
Starting structural reductions in LTL mode, iteration 1 : 2447/2467 places, 4553/4599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67447 ms. Remains : 2447/2467 places, 4553/4599 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, p1, (AND p1 (NOT p2)), p1, (AND p1 (NOT p2))]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 8947 steps with 0 reset in 92 ms.
FORMULA DLCround-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10b-LTLFireability-06 finished in 67750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))&&(p1||F(p2)))))'
Support contains 2 out of 2467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2455 transition count 4561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2455 transition count 4561
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 2452 transition count 4558
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 2452 transition count 4558
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2451 transition count 4557
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2451 transition count 4557
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2450 transition count 4556
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2450 transition count 4556
Applied a total of 34 rules in 465 ms. Remains 2450 /2467 variables (removed 17) and now considering 4556/4599 (removed 43) transitions.
// Phase 1: matrix 4556 rows 2450 cols
[2025-05-31 08:17:49] [INFO ] Computed 213 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:17:51] [INFO ] Implicit Places using invariants in 1498 ms returned []
[2025-05-31 08:17:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:17:54] [INFO ] Implicit Places using invariants and state equation in 3300 ms returned []
Implicit Place search using SMT with State Equation took 4801 ms to find 0 implicit places.
Running 4555 sub problems to find dead transitions.
[2025-05-31 08:17:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2449/7006 variables, and 0 constraints, problems are : Problem set: 0 solved, 4555 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 4555/4555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4555 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2449/7006 variables, and 0 constraints, problems are : Problem set: 0 solved, 4555 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 0/4555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62096ms problems are : Problem set: 0 solved, 4555 unsolved
Search for dead transitions found 0 dead transitions in 62103ms
Starting structural reductions in LTL mode, iteration 1 : 2450/2467 places, 4556/4599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67384 ms. Remains : 2450/2467 places, 4556/4599 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-07
Product exploration explored 100000 steps with 12 reset in 699 ms.
Product exploration explored 100000 steps with 12 reset in 764 ms.
Computed a total of 421 stabilizing places and 421 stable transitions
Computed a total of 421 stabilizing places and 421 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 17138 steps (3 resets) in 183 ms. (93 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-05-31 08:18:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 08:19:04] [INFO ] [Real]Absence check using 213 positive place invariants in 3826 ms returned sat
[2025-05-31 08:19:14] [INFO ] [Real]Absence check using state equation in 9352 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2450 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 4556/4556 transitions.
Applied a total of 0 rules in 97 ms. Remains 2450 /2450 variables (removed 0) and now considering 4556/4556 (removed 0) transitions.
[2025-05-31 08:19:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:19:16] [INFO ] Implicit Places using invariants in 1659 ms returned []
[2025-05-31 08:19:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:19:19] [INFO ] Implicit Places using invariants and state equation in 3290 ms returned []
Implicit Place search using SMT with State Equation took 4951 ms to find 0 implicit places.
Running 4555 sub problems to find dead transitions.
[2025-05-31 08:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2449/7006 variables, and 0 constraints, problems are : Problem set: 0 solved, 4555 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 4555/4555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4555 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2449/7006 variables, and 0 constraints, problems are : Problem set: 0 solved, 4555 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 0/4555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62202ms problems are : Problem set: 0 solved, 4555 unsolved
Search for dead transitions found 0 dead transitions in 62209ms
Finished structural reductions in LTL mode , in 1 iterations and 67269 ms. Remains : 2450/2450 places, 4556/4556 transitions.
Computed a total of 421 stabilizing places and 421 stable transitions
Computed a total of 421 stabilizing places and 421 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 10197 steps (0 resets) in 74 ms. (135 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-05-31 08:20:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 08:20:28] [INFO ] [Real]Absence check using 213 positive place invariants in 3874 ms returned sat
[2025-05-31 08:20:37] [INFO ] [Real]Absence check using state equation in 9269 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14 reset in 569 ms.
Product exploration explored 100000 steps with 17 reset in 666 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2450/2450 places, 4556/4556 transitions.
Graph (trivial) has 2142 edges and 2450 vertex of which 577 / 2450 are part of one of the 48 SCC in 1 ms
Free SCC test removed 529 places
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 570 transitions.
Performed 372 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 372 rules applied. Total rules applied 373 place count 1921 transition count 3986
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 30 rules applied. Total rules applied 403 place count 1921 transition count 3971
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 403 place count 1921 transition count 3975
Deduced a syphon composed of 395 places in 16 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 411 place count 1921 transition count 3975
Discarding 164 places :
Symmetric choice reduction at 2 with 164 rule applications. Total rules 575 place count 1757 transition count 3212
Deduced a syphon composed of 304 places in 14 ms
Iterating global reduction 2 with 164 rules applied. Total rules applied 739 place count 1757 transition count 3212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 743 place count 1757 transition count 3208
Performed 672 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 976 places in 1 ms
Iterating global reduction 3 with 672 rules applied. Total rules applied 1415 place count 1757 transition count 3219
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1426 place count 1757 transition count 3208
Renaming transitions due to excessive name length > 1024 char.
Discarding 485 places :
Symmetric choice reduction at 4 with 485 rule applications. Total rules 1911 place count 1272 transition count 2384
Deduced a syphon composed of 518 places in 0 ms
Iterating global reduction 4 with 485 rules applied. Total rules applied 2396 place count 1272 transition count 2384
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 2422 place count 1272 transition count 2358
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2433 place count 1261 transition count 2347
Deduced a syphon composed of 507 places in 0 ms
Iterating global reduction 5 with 11 rules applied. Total rules applied 2444 place count 1261 transition count 2347
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -223
Deduced a syphon composed of 540 places in 1 ms
Iterating global reduction 5 with 33 rules applied. Total rules applied 2477 place count 1261 transition count 2570
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 2496 place count 1261 transition count 2551
Discarding 48 places :
Symmetric choice reduction at 6 with 48 rule applications. Total rules 2544 place count 1213 transition count 2364
Deduced a syphon composed of 496 places in 1 ms
Iterating global reduction 6 with 48 rules applied. Total rules applied 2592 place count 1213 transition count 2364
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2600 place count 1213 transition count 2356
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2608 place count 1205 transition count 2340
Deduced a syphon composed of 488 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2616 place count 1205 transition count 2340
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 492 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2620 place count 1205 transition count 2384
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2624 place count 1201 transition count 2376
Deduced a syphon composed of 488 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2628 place count 1201 transition count 2376
Deduced a syphon composed of 488 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 7 with 46 rules applied. Total rules applied 2674 place count 1201 transition count 2330
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2696 place count 1179 transition count 2286
Deduced a syphon composed of 488 places in 1 ms
Iterating global reduction 7 with 22 rules applied. Total rules applied 2718 place count 1179 transition count 2286
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2740 place count 1157 transition count 1972
Deduced a syphon composed of 488 places in 0 ms
Iterating global reduction 7 with 22 rules applied. Total rules applied 2762 place count 1157 transition count 1972
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 2795 place count 1157 transition count 1939
Discarding 22 places :
Symmetric choice reduction at 8 with 22 rule applications. Total rules 2817 place count 1135 transition count 1906
Deduced a syphon composed of 466 places in 1 ms
Iterating global reduction 8 with 22 rules applied. Total rules applied 2839 place count 1135 transition count 1906
Deduced a syphon composed of 466 places in 0 ms
Applied a total of 2839 rules in 1813 ms. Remains 1135 /2450 variables (removed 1315) and now considering 1906/4556 (removed 2650) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:20:40] [INFO ] Redundant transitions in 42 ms returned []
Running 1905 sub problems to find dead transitions.
[2025-05-31 08:20:40] [INFO ] Flow matrix only has 1877 transitions (discarded 29 similar events)
// Phase 1: matrix 1877 rows 1135 cols
[2025-05-31 08:20:41] [INFO ] Computed 213 invariants in 81 ms
[2025-05-31 08:20:41] [INFO ] State equation strengthened by 248 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1134/3012 variables, and 0 constraints, problems are : Problem set: 0 solved, 1905 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/1135 constraints, ReadFeed: 0/248 constraints, PredecessorRefiner: 1905/1517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1905 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1134/3012 variables, and 0 constraints, problems are : Problem set: 0 solved, 1905 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/1135 constraints, ReadFeed: 0/248 constraints, PredecessorRefiner: 388/1517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61297ms problems are : Problem set: 0 solved, 1905 unsolved
Search for dead transitions found 0 dead transitions in 61299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1135/2450 places, 1906/4556 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63163 ms. Remains : 1135/2450 places, 1906/4556 transitions.
Built C files in :
/tmp/ltsmin9802789667963728328
[2025-05-31 08:21:42] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9802789667963728328
Running compilation step : cd /tmp/ltsmin9802789667963728328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9802789667963728328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9802789667963728328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 4556/4556 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2449 transition count 4555
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2449 transition count 4555
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2448 transition count 4554
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2448 transition count 4554
Applied a total of 4 rules in 298 ms. Remains 2448 /2450 variables (removed 2) and now considering 4554/4556 (removed 2) transitions.
// Phase 1: matrix 4554 rows 2448 cols
[2025-05-31 08:21:45] [INFO ] Computed 213 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:21:47] [INFO ] Implicit Places using invariants in 1556 ms returned []
[2025-05-31 08:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:21:50] [INFO ] Implicit Places using invariants and state equation in 3145 ms returned []
Implicit Place search using SMT with State Equation took 4704 ms to find 0 implicit places.
Running 4553 sub problems to find dead transitions.
[2025-05-31 08:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2447/7002 variables, and 0 constraints, problems are : Problem set: 0 solved, 4553 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2448 constraints, PredecessorRefiner: 4553/4553 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4553 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2447/7002 variables, and 0 constraints, problems are : Problem set: 0 solved, 4553 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2448 constraints, PredecessorRefiner: 0/4553 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62082ms problems are : Problem set: 0 solved, 4553 unsolved
Search for dead transitions found 0 dead transitions in 62090ms
Starting structural reductions in LTL mode, iteration 1 : 2448/2450 places, 4554/4556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67105 ms. Remains : 2448/2450 places, 4554/4556 transitions.
Built C files in :
/tmp/ltsmin5960656993059022830
[2025-05-31 08:22:52] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5960656993059022830
Running compilation step : cd /tmp/ltsmin5960656993059022830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5960656993059022830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5960656993059022830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 08:22:55] [INFO ] Flatten gal took : 106 ms
[2025-05-31 08:22:55] [INFO ] Flatten gal took : 103 ms
[2025-05-31 08:22:56] [INFO ] Time to serialize gal into /tmp/LTL15086759669443988782.gal : 32 ms
[2025-05-31 08:22:56] [INFO ] Time to serialize properties into /tmp/LTL14462831247579787265.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15086759669443988782.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8504792514864519826.hoa' '-atoms' '/tmp/LTL14462831247579787265.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14462831247579787265.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8504792514864519826.hoa
Detected timeout of ITS tools.
[2025-05-31 08:23:11] [INFO ] Flatten gal took : 92 ms
[2025-05-31 08:23:11] [INFO ] Flatten gal took : 97 ms
[2025-05-31 08:23:11] [INFO ] Time to serialize gal into /tmp/LTL2523566538426848199.gal : 22 ms
[2025-05-31 08:23:11] [INFO ] Time to serialize properties into /tmp/LTL2235311266555692970.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2523566538426848199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2235311266555692970.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("(p3148==1)"))))&&(("(p834==0)")||(F("(p3148==0)"))))))
Formula 0 simplified : X(XXG!"(p3148==1)" | (!"(p834==0)" & G!"(p3148==0)"))
Detected timeout of ITS tools.
[2025-05-31 08:23:26] [INFO ] Flatten gal took : 83 ms
[2025-05-31 08:23:26] [INFO ] Applying decomposition
[2025-05-31 08:23:26] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10930211756766550526.txt' '-o' '/tmp/graph10930211756766550526.bin' '-w' '/tmp/graph10930211756766550526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10930211756766550526.bin' '-l' '-1' '-v' '-w' '/tmp/graph10930211756766550526.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:23:26] [INFO ] Decomposing Gal with order
[2025-05-31 08:23:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:23:27] [INFO ] Removed a total of 4457 redundant transitions.
[2025-05-31 08:23:27] [INFO ] Flatten gal took : 353 ms
[2025-05-31 08:23:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 73 ms.
[2025-05-31 08:23:27] [INFO ] Time to serialize gal into /tmp/LTL15000736667755657692.gal : 29 ms
[2025-05-31 08:23:27] [INFO ] Time to serialize properties into /tmp/LTL16789467457337414301.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15000736667755657692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16789467457337414301.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("(i7.u751.p3148==1)"))))&&(("(i7.u198.p834==0)")||(F("(i7.u751.p3148==0)"))))))
Formula 0 simplified : X(XXG!"(i7.u751.p3148==1)" | (!"(i7.u198.p834==0)" & G!"(i7.u751.p3148==0)"))
Detected timeout of ITS tools.
Treatment of property DLCround-PT-10b-LTLFireability-07 finished in 353821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((X(p0)&&(p1||F(G(!p1))))) U X(p2)))))'
Support contains 4 out of 2467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2456 transition count 4575
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2456 transition count 4575
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 2451 transition count 4570
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 2451 transition count 4570
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2450 transition count 4569
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2450 transition count 4569
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2449 transition count 4568
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2449 transition count 4568
Applied a total of 36 rules in 490 ms. Remains 2449 /2467 variables (removed 18) and now considering 4568/4599 (removed 31) transitions.
// Phase 1: matrix 4568 rows 2449 cols
[2025-05-31 08:23:43] [INFO ] Computed 213 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:23:45] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2025-05-31 08:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:23:48] [INFO ] Implicit Places using invariants and state equation in 3138 ms returned []
Implicit Place search using SMT with State Equation took 4699 ms to find 0 implicit places.
Running 4567 sub problems to find dead transitions.
[2025-05-31 08:23:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s1464 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2448/7017 variables, and 0 constraints, problems are : Problem set: 0 solved, 4567 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2449 constraints, PredecessorRefiner: 4567/4567 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4567 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2448/7017 variables, and 0 constraints, problems are : Problem set: 0 solved, 4567 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2449 constraints, PredecessorRefiner: 0/4567 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62084ms problems are : Problem set: 0 solved, 4567 unsolved
Search for dead transitions found 0 dead transitions in 62091ms
Starting structural reductions in LTL mode, iteration 1 : 2449/2467 places, 4568/4599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67291 ms. Remains : 2449/2467 places, 4568/4599 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-09
Product exploration explored 100000 steps with 1 reset in 617 ms.
Product exploration explored 100000 steps with 0 reset in 766 ms.
Computed a total of 422 stabilizing places and 422 stable transitions
Computed a total of 422 stabilizing places and 422 stable transitions
Detected a total of 422/2449 stabilizing places and 422/4568 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 397 ms. (100 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
[2025-05-31 08:24:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2234/2449 variables, 209/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2449 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4568/7017 variables, 2449/2662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7017 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7017 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7017/7017 variables, and 2662 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2731 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2449/2449 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2234/2449 variables, 209/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2449 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4568/7017 variables, 2449/2662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7017 variables, 2/2664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7017 variables, 0/2664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/7017 variables, 0/2664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7017/7017 variables, and 2664 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2444 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2449/2449 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5190ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 436 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=109 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F p1)]
Knowledge based reduction with 3 factoid took 366 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2025-05-31 08:24:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 08:25:05] [INFO ] [Real]Absence check using 213 positive place invariants in 4167 ms returned sat
[2025-05-31 08:25:14] [INFO ] [Real]Absence check using state equation in 8989 ms returned unknown
Could not prove EG (NOT p2)
Support contains 4 out of 2449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2449/2449 places, 4568/4568 transitions.
Applied a total of 0 rules in 99 ms. Remains 2449 /2449 variables (removed 0) and now considering 4568/4568 (removed 0) transitions.
[2025-05-31 08:25:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:15] [INFO ] Implicit Places using invariants in 1684 ms returned []
[2025-05-31 08:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:19] [INFO ] Implicit Places using invariants and state equation in 3300 ms returned []
Implicit Place search using SMT with State Equation took 4986 ms to find 0 implicit places.
Running 4567 sub problems to find dead transitions.
[2025-05-31 08:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2448/7017 variables, and 0 constraints, problems are : Problem set: 0 solved, 4567 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2449 constraints, PredecessorRefiner: 4567/4567 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4567 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2448/7017 variables, and 0 constraints, problems are : Problem set: 0 solved, 4567 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2449 constraints, PredecessorRefiner: 0/4567 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62251ms problems are : Problem set: 0 solved, 4567 unsolved
Search for dead transitions found 0 dead transitions in 62258ms
Finished structural reductions in LTL mode , in 1 iterations and 67365 ms. Remains : 2449/2449 places, 4568/4568 transitions.
Computed a total of 422 stabilizing places and 422 stable transitions
Computed a total of 422 stabilizing places and 422 stable transitions
Detected a total of 422/2449 stabilizing places and 422/4568 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 27410 steps (6 resets) in 245 ms. (111 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p2), (F (NOT (OR (NOT p1) p2))), (F p1)]
Knowledge based reduction with 2 factoid took 312 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2025-05-31 08:26:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 08:26:29] [INFO ] [Real]Absence check using 213 positive place invariants in 4127 ms returned sat
[2025-05-31 08:26:38] [INFO ] [Real]Absence check using state equation in 9006 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 604 ms.
Product exploration explored 100000 steps with 0 reset in 759 ms.
Built C files in :
/tmp/ltsmin16003737411154558881
[2025-05-31 08:26:39] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16003737411154558881
Running compilation step : cd /tmp/ltsmin16003737411154558881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16003737411154558881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16003737411154558881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 2449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2449/2449 places, 4568/4568 transitions.
Applied a total of 0 rules in 97 ms. Remains 2449 /2449 variables (removed 0) and now considering 4568/4568 (removed 0) transitions.
[2025-05-31 08:26:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:26:44] [INFO ] Implicit Places using invariants in 1653 ms returned []
[2025-05-31 08:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:26:47] [INFO ] Implicit Places using invariants and state equation in 3234 ms returned []
Implicit Place search using SMT with State Equation took 4899 ms to find 0 implicit places.
Running 4567 sub problems to find dead transitions.
[2025-05-31 08:26:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2448/7017 variables, and 0 constraints, problems are : Problem set: 0 solved, 4567 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2449 constraints, PredecessorRefiner: 4567/4567 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4567 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2448/7017 variables, and 0 constraints, problems are : Problem set: 0 solved, 4567 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2449 constraints, PredecessorRefiner: 0/4567 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62020ms problems are : Problem set: 0 solved, 4567 unsolved
Search for dead transitions found 0 dead transitions in 62026ms
Finished structural reductions in LTL mode , in 1 iterations and 67031 ms. Remains : 2449/2449 places, 4568/4568 transitions.
Built C files in :
/tmp/ltsmin5241641678748677235
[2025-05-31 08:27:50] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5241641678748677235
Running compilation step : cd /tmp/ltsmin5241641678748677235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5241641678748677235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5241641678748677235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 08:27:53] [INFO ] Flatten gal took : 88 ms
[2025-05-31 08:27:53] [INFO ] Flatten gal took : 93 ms
[2025-05-31 08:27:53] [INFO ] Time to serialize gal into /tmp/LTL8547300122163509607.gal : 17 ms
[2025-05-31 08:27:53] [INFO ] Time to serialize properties into /tmp/LTL2159914959792107007.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8547300122163509607.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13497353918698162933.hoa' '-atoms' '/tmp/LTL2159914959792107007.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2159914959792107007.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13497353918698162933.hoa
Detected timeout of ITS tools.
[2025-05-31 08:28:08] [INFO ] Flatten gal took : 74 ms
[2025-05-31 08:28:08] [INFO ] Flatten gal took : 79 ms
[2025-05-31 08:28:08] [INFO ] Time to serialize gal into /tmp/LTL8285451690807057058.gal : 16 ms
[2025-05-31 08:28:08] [INFO ] Time to serialize properties into /tmp/LTL805675762755108114.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8285451690807057058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL805675762755108114.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X((F((X("((p1307==1)&&(p3540==1))"))&&(("(p3643==1)")||(F(G("(p3643!=1)"))))))U(X("(p1442==1)"))))))
Formula 0 simplified : XX(G(X!"((p1307==1)&&(p3540==1))" | (!"(p3643==1)" & GF!"(p3643!=1)")) R X!"(p1442==1)")
Detected timeout of ITS tools.
[2025-05-31 08:28:23] [INFO ] Flatten gal took : 75 ms
[2025-05-31 08:28:23] [INFO ] Applying decomposition
[2025-05-31 08:28:23] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7253728558171757585.txt' '-o' '/tmp/graph7253728558171757585.bin' '-w' '/tmp/graph7253728558171757585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7253728558171757585.bin' '-l' '-1' '-v' '-w' '/tmp/graph7253728558171757585.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:28:24] [INFO ] Decomposing Gal with order
[2025-05-31 08:28:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:28:24] [INFO ] Removed a total of 4509 redundant transitions.
[2025-05-31 08:28:24] [INFO ] Flatten gal took : 158 ms
[2025-05-31 08:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 48 ms.
[2025-05-31 08:28:24] [INFO ] Time to serialize gal into /tmp/LTL1614413892925464927.gal : 27 ms
[2025-05-31 08:28:24] [INFO ] Time to serialize properties into /tmp/LTL13372327292247515378.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1614413892925464927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13372327292247515378.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F((X("((i14.u327.p1307==1)&&(i14.u840.p3540==1))"))&&(("(i15.u861.p3643==1)")||(F(G("(i15.u861.p3643!=1)"))))))U(X("(i15.u367....171
Formula 0 simplified : XX(G(X!"((i14.u327.p1307==1)&&(i14.u840.p3540==1))" | (!"(i15.u861.p3643==1)" & GF!"(i15.u861.p3643!=1)")) R X!"(i15.u367.p1442==1)"...156
Detected timeout of ITS tools.
Treatment of property DLCround-PT-10b-LTLFireability-09 finished in 296781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(((p1&&X(p2))||G(p2)))))'
Support contains 3 out of 2467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2455 transition count 4561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2455 transition count 4561
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 2450 transition count 4556
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 2450 transition count 4556
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2449 transition count 4555
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2449 transition count 4555
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2448 transition count 4554
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2448 transition count 4554
Applied a total of 38 rules in 500 ms. Remains 2448 /2467 variables (removed 19) and now considering 4554/4599 (removed 45) transitions.
// Phase 1: matrix 4554 rows 2448 cols
[2025-05-31 08:28:40] [INFO ] Computed 213 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:28:41] [INFO ] Implicit Places using invariants in 1541 ms returned []
[2025-05-31 08:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:28:44] [INFO ] Implicit Places using invariants and state equation in 3137 ms returned []
Implicit Place search using SMT with State Equation took 4680 ms to find 0 implicit places.
Running 4553 sub problems to find dead transitions.
[2025-05-31 08:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2447/7002 variables, and 0 constraints, problems are : Problem set: 0 solved, 4553 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2448 constraints, PredecessorRefiner: 4553/4553 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4553 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2447/7002 variables, and 0 constraints, problems are : Problem set: 0 solved, 4553 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2448 constraints, PredecessorRefiner: 0/4553 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62006ms problems are : Problem set: 0 solved, 4553 unsolved
Search for dead transitions found 0 dead transitions in 62013ms
Starting structural reductions in LTL mode, iteration 1 : 2448/2467 places, 4554/4599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67206 ms. Remains : 2448/2467 places, 4554/4599 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 631 ms.
Product exploration explored 100000 steps with 0 reset in 831 ms.
Computed a total of 422 stabilizing places and 422 stable transitions
Computed a total of 422 stabilizing places and 422 stable transitions
Detected a total of 422/2448 stabilizing places and 422/4554 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 136 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 354 ms. (112 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
[2025-05-31 08:29:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2319/2448 variables, 211/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2448 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4554/7002 variables, 2448/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7002 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/7002 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7002/7002 variables, and 2661 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2448/2448 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2319/2448 variables, 211/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2448 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4554/7002 variables, 2448/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7002 variables, 1/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7002 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/7002 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7002/7002 variables, and 2662 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1835 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2448/2448 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3762ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 728 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=145 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 15 factoid took 335 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2025-05-31 08:29:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 08:29:59] [INFO ] [Real]Absence check using 213 positive place invariants in 4131 ms returned sat
[2025-05-31 08:30:08] [INFO ] [Real]Absence check using state equation in 9060 ms returned unknown
Could not prove EG (NOT p2)
Support contains 2 out of 2448 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2448/2448 places, 4554/4554 transitions.
Applied a total of 0 rules in 103 ms. Remains 2448 /2448 variables (removed 0) and now considering 4554/4554 (removed 0) transitions.
[2025-05-31 08:30:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:30:10] [INFO ] Implicit Places using invariants in 1514 ms returned []
[2025-05-31 08:30:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:30:13] [INFO ] Implicit Places using invariants and state equation in 3042 ms returned []
Implicit Place search using SMT with State Equation took 4559 ms to find 0 implicit places.
Running 4553 sub problems to find dead transitions.
[2025-05-31 08:30:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2447/7002 variables, and 0 constraints, problems are : Problem set: 0 solved, 4553 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2448 constraints, PredecessorRefiner: 4553/4553 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4553 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2447/7002 variables, and 0 constraints, problems are : Problem set: 0 solved, 4553 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2448 constraints, PredecessorRefiner: 0/4553 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62020ms problems are : Problem set: 0 solved, 4553 unsolved
Search for dead transitions found 0 dead transitions in 62028ms
Finished structural reductions in LTL mode , in 1 iterations and 66701 ms. Remains : 2448/2448 places, 4554/4554 transitions.
Computed a total of 422 stabilizing places and 422 stable transitions
Computed a total of 422 stabilizing places and 422 stable transitions
Detected a total of 422/2448 stabilizing places and 422/4554 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
[2025-05-31 08:31:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2319/2448 variables, 211/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2448 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4554/7002 variables, 2448/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7002 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/7002 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7002/7002 variables, and 2661 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1962 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2448/2448 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2319/2448 variables, 211/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2448 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4554/7002 variables, 2448/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7002 variables, 1/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7002 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/7002 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7002/7002 variables, and 2662 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1802 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2448/2448 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3778ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 724 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=144 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 347 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2025-05-31 08:31:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 08:31:26] [INFO ] [Real]Absence check using 213 positive place invariants in 4033 ms returned sat
[2025-05-31 08:31:35] [INFO ] [Real]Absence check using state equation in 9213 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 813 ms.
Product exploration explored 100000 steps with 0 reset in 947 ms.
Built C files in :
/tmp/ltsmin13147026718526599876
[2025-05-31 08:31:37] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13147026718526599876
Running compilation step : cd /tmp/ltsmin13147026718526599876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13147026718526599876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13147026718526599876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 2448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2448/2448 places, 4554/4554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2447 transition count 4553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2447 transition count 4553
Applied a total of 2 rules in 197 ms. Remains 2447 /2448 variables (removed 1) and now considering 4553/4554 (removed 1) transitions.
// Phase 1: matrix 4553 rows 2447 cols
[2025-05-31 08:31:40] [INFO ] Computed 213 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:31:42] [INFO ] Implicit Places using invariants in 1533 ms returned []
[2025-05-31 08:31:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:31:45] [INFO ] Implicit Places using invariants and state equation in 3488 ms returned []
Implicit Place search using SMT with State Equation took 5023 ms to find 0 implicit places.
Running 4552 sub problems to find dead transitions.
[2025-05-31 08:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2446/7000 variables, and 0 constraints, problems are : Problem set: 0 solved, 4552 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2447 constraints, PredecessorRefiner: 4552/4552 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4552 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2446/7000 variables, and 0 constraints, problems are : Problem set: 0 solved, 4552 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2447 constraints, PredecessorRefiner: 0/4552 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62291ms problems are : Problem set: 0 solved, 4552 unsolved
Search for dead transitions found 0 dead transitions in 62297ms
Starting structural reductions in LTL mode, iteration 1 : 2447/2448 places, 4553/4554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67528 ms. Remains : 2447/2448 places, 4553/4554 transitions.
Built C files in :
/tmp/ltsmin10953510182316848800
[2025-05-31 08:32:48] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10953510182316848800
Running compilation step : cd /tmp/ltsmin10953510182316848800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10953510182316848800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10953510182316848800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 08:32:51] [INFO ] Flatten gal took : 79 ms
[2025-05-31 08:32:51] [INFO ] Flatten gal took : 95 ms
[2025-05-31 08:32:51] [INFO ] Time to serialize gal into /tmp/LTL3755317531040953299.gal : 16 ms
[2025-05-31 08:32:51] [INFO ] Time to serialize properties into /tmp/LTL1818024569199188975.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3755317531040953299.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3119286610408631277.hoa' '-atoms' '/tmp/LTL1818024569199188975.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1818024569199188975.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3119286610408631277.hoa
Detected timeout of ITS tools.
[2025-05-31 08:33:06] [INFO ] Flatten gal took : 72 ms
[2025-05-31 08:33:06] [INFO ] Flatten gal took : 76 ms
[2025-05-31 08:33:06] [INFO ] Time to serialize gal into /tmp/LTL8441891510372544273.gal : 15 ms
[2025-05-31 08:33:06] [INFO ] Time to serialize properties into /tmp/LTL8986294181344229873.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8441891510372544273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8986294181344229873.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X("(p2656==1)"))||(F((G("(p3913==1)"))||(("(p2781==1)")&&(X("(p3913==1)")))))))
Formula 0 simplified : X!"(p2656==1)" & G(F!"(p3913==1)" & (!"(p2781==1)" | X!"(p3913==1)"))
Detected timeout of ITS tools.
[2025-05-31 08:33:21] [INFO ] Flatten gal took : 70 ms
[2025-05-31 08:33:21] [INFO ] Applying decomposition
[2025-05-31 08:33:21] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12752640113876471027.txt' '-o' '/tmp/graph12752640113876471027.bin' '-w' '/tmp/graph12752640113876471027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12752640113876471027.bin' '-l' '-1' '-v' '-w' '/tmp/graph12752640113876471027.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:33:21] [INFO ] Decomposing Gal with order
[2025-05-31 08:33:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:33:22] [INFO ] Removed a total of 4509 redundant transitions.
[2025-05-31 08:33:22] [INFO ] Flatten gal took : 141 ms
[2025-05-31 08:33:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 17 ms.
[2025-05-31 08:33:22] [INFO ] Time to serialize gal into /tmp/LTL11811474243534144353.gal : 23 ms
[2025-05-31 08:33:22] [INFO ] Time to serialize properties into /tmp/LTL5985778297460523020.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11811474243534144353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5985778297460523020.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X("(i16.u662.p2656==1)"))||(F((G("(i20.u911.p3913==1)"))||(("(i20.u685.p2781==1)")&&(X("(i20.u911.p3913==1)")))))))
Formula 0 simplified : X!"(i16.u662.p2656==1)" & G(F!"(i20.u911.p3913==1)" & (!"(i20.u685.p2781==1)" | X!"(i20.u911.p3913==1)"))
Detected timeout of ITS tools.
Treatment of property DLCround-PT-10b-LTLFireability-11 finished in 297794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((F(p1)&&p0)))&&(p2 U G(p3)))))'
Support contains 5 out of 2467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Graph (trivial) has 2152 edges and 2467 vertex of which 572 / 2467 are part of one of the 47 SCC in 2 ms
Free SCC test removed 525 places
Ensure Unique test removed 566 transitions
Reduce isomorphic transitions removed 566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 376 transitions
Trivial Post-agglo rules discarded 376 transitions
Performed 376 trivial Post agglomeration. Transition count delta: 376
Iterating post reduction 0 with 376 rules applied. Total rules applied 377 place count 1941 transition count 3656
Reduce places removed 376 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 421 rules applied. Total rules applied 798 place count 1565 transition count 3611
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 31 rules applied. Total rules applied 829 place count 1535 transition count 3610
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 830 place count 1534 transition count 3610
Performed 208 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 208 Pre rules applied. Total rules applied 830 place count 1534 transition count 3402
Deduced a syphon composed of 208 places in 16 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 4 with 416 rules applied. Total rules applied 1246 place count 1326 transition count 3402
Discarding 79 places :
Symmetric choice reduction at 4 with 79 rule applications. Total rules 1325 place count 1247 transition count 2737
Iterating global reduction 4 with 79 rules applied. Total rules applied 1404 place count 1247 transition count 2737
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1408 place count 1247 transition count 2733
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1408 place count 1247 transition count 2726
Deduced a syphon composed of 7 places in 12 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1422 place count 1240 transition count 2726
Performed 477 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 477 places in 0 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 5 with 954 rules applied. Total rules applied 2376 place count 763 transition count 2238
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 2386 place count 763 transition count 2228
Renaming transitions due to excessive name length > 1024 char.
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 2414 place count 735 transition count 1848
Iterating global reduction 6 with 28 rules applied. Total rules applied 2442 place count 735 transition count 1848
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 2467 place count 735 transition count 1823
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -116
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 2491 place count 723 transition count 1939
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2495 place count 723 transition count 1935
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2499 place count 719 transition count 1841
Iterating global reduction 8 with 4 rules applied. Total rules applied 2503 place count 719 transition count 1841
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2507 place count 719 transition count 1837
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2515 place count 715 transition count 1874
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 9 with 42 rules applied. Total rules applied 2557 place count 715 transition count 1832
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 2578 place count 694 transition count 1790
Iterating global reduction 9 with 21 rules applied. Total rules applied 2599 place count 694 transition count 1790
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 2620 place count 673 transition count 1494
Iterating global reduction 9 with 21 rules applied. Total rules applied 2641 place count 673 transition count 1494
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 2662 place count 673 transition count 1473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2663 place count 672 transition count 1472
Applied a total of 2663 rules in 436 ms. Remains 672 /2467 variables (removed 1795) and now considering 1472/4599 (removed 3127) transitions.
[2025-05-31 08:33:37] [INFO ] Flow matrix only has 1442 transitions (discarded 30 similar events)
// Phase 1: matrix 1442 rows 672 cols
[2025-05-31 08:33:37] [INFO ] Computed 213 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:33:38] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-05-31 08:33:38] [INFO ] Flow matrix only has 1442 transitions (discarded 30 similar events)
[2025-05-31 08:33:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:33:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 08:33:38] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:33:39] [INFO ] Redundant transitions in 27 ms returned []
Running 1393 sub problems to find dead transitions.
[2025-05-31 08:33:39] [INFO ] Flow matrix only has 1442 transitions (discarded 30 similar events)
[2025-05-31 08:33:39] [INFO ] Invariant cache hit.
[2025-05-31 08:33:39] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/2114 variables, and 15 constraints, problems are : Problem set: 0 solved, 1393 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/213 constraints, State Equation: 0/672 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 1393/1393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1393 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/671 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
At refinement iteration 2 (OVERLAPS) 1/672 variables, 198/213 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/2114 variables, and 213 constraints, problems are : Problem set: 0 solved, 1393 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 0/672 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/1393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61208ms problems are : Problem set: 0 solved, 1393 unsolved
Search for dead transitions found 0 dead transitions in 61209ms
Starting structural reductions in SI_LTL mode, iteration 1 : 672/2467 places, 1472/4599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62680 ms. Remains : 672/2467 places, 1472/4599 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p3) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p3), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-10b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10b-LTLFireability-13 finished in 63022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(p1)||(X(G(p3))&&p2))))'
Support contains 6 out of 2467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2453 transition count 4559
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2453 transition count 4559
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 2448 transition count 4554
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 2448 transition count 4554
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 2447 transition count 4553
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 2447 transition count 4553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 2446 transition count 4552
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 2446 transition count 4552
Applied a total of 42 rules in 493 ms. Remains 2446 /2467 variables (removed 21) and now considering 4552/4599 (removed 47) transitions.
// Phase 1: matrix 4552 rows 2446 cols
[2025-05-31 08:34:41] [INFO ] Computed 213 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:34:42] [INFO ] Implicit Places using invariants in 1485 ms returned []
[2025-05-31 08:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:34:45] [INFO ] Implicit Places using invariants and state equation in 3165 ms returned []
Implicit Place search using SMT with State Equation took 4651 ms to find 0 implicit places.
Running 4551 sub problems to find dead transitions.
[2025-05-31 08:34:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2445/6998 variables, and 0 constraints, problems are : Problem set: 0 solved, 4551 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2446 constraints, PredecessorRefiner: 4551/4551 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4551 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2445/6998 variables, and 0 constraints, problems are : Problem set: 0 solved, 4551 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2446 constraints, PredecessorRefiner: 0/4551 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61992ms problems are : Problem set: 0 solved, 4551 unsolved
Search for dead transitions found 0 dead transitions in 61997ms
Starting structural reductions in LTL mode, iteration 1 : 2446/2467 places, 4552/4599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67151 ms. Remains : 2446/2467 places, 4552/4599 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10b-LTLFireability-14 finished in 67454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X((p1&&X((p1 U (!p2||G(p1))))))))))'
Support contains 4 out of 2467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2467/2467 places, 4599/4599 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2453 transition count 4559
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2453 transition count 4559
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 2448 transition count 4554
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 2448 transition count 4554
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 2447 transition count 4553
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 2447 transition count 4553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 2446 transition count 4552
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 2446 transition count 4552
Applied a total of 42 rules in 515 ms. Remains 2446 /2467 variables (removed 21) and now considering 4552/4599 (removed 47) transitions.
[2025-05-31 08:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:35:50] [INFO ] Implicit Places using invariants in 1659 ms returned []
[2025-05-31 08:35:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:35:53] [INFO ] Implicit Places using invariants and state equation in 3492 ms returned []
Implicit Place search using SMT with State Equation took 5154 ms to find 0 implicit places.
Running 4551 sub problems to find dead transitions.
[2025-05-31 08:35:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2445/6998 variables, and 0 constraints, problems are : Problem set: 0 solved, 4551 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2446 constraints, PredecessorRefiner: 4551/4551 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4551 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2445/6998 variables, and 0 constraints, problems are : Problem set: 0 solved, 4551 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/2446 constraints, PredecessorRefiner: 0/4551 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62043ms problems are : Problem set: 0 solved, 4551 unsolved
Search for dead transitions found 0 dead transitions in 62049ms
Starting structural reductions in LTL mode, iteration 1 : 2446/2467 places, 4552/4599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67725 ms. Remains : 2446/2467 places, 4552/4599 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND (NOT p1) p2)]
Running random walk in product with property : DLCround-PT-10b-LTLFireability-15
Product exploration explored 100000 steps with 5 reset in 587 ms.
Product exploration explored 100000 steps with 21 reset in 663 ms.
Computed a total of 421 stabilizing places and 421 stable transitions
Computed a total of 421 stabilizing places and 421 stable transitions
Detected a total of 421/2446 stabilizing places and 421/4552 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2025-05-31 08:36:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 262/265 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2181/2446 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2446 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4552/6998 variables, 2446/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6998 variables, 0/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6998 variables, 0/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6998/6998 variables, and 2659 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2446/2446 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 262/265 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2181/2446 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2446 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4552/6998 variables, 2446/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6998 variables, 1/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6998 variables, 0/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6998 variables, 0/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6998/6998 variables, and 2660 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1912 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, State Equation: 2446/2446 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4048ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 832 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=166 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND (NOT p1) p2)]
[2025-05-31 08:37:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 08:37:05] [INFO ] [Real]Absence check using 213 positive place invariants in 1060 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 285 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-10b-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-10b-LTLFireability-15 finished in 77838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))&&(p1||F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((X(p0)&&(p1||F(G(!p1))))) U X(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(((p1&&X(p2))||G(p2)))))'
[2025-05-31 08:37:06] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17544859583833816507
[2025-05-31 08:37:06] [INFO ] Too many transitions (4599) to apply POR reductions. Disabling POR matrices.
[2025-05-31 08:37:06] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17544859583833816507
Running compilation step : cd /tmp/ltsmin17544859583833816507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-31 08:37:06] [INFO ] Applying decomposition
[2025-05-31 08:37:06] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11015102945185477963.txt' '-o' '/tmp/graph11015102945185477963.bin' '-w' '/tmp/graph11015102945185477963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11015102945185477963.bin' '-l' '-1' '-v' '-w' '/tmp/graph11015102945185477963.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:37:06] [INFO ] Decomposing Gal with order
[2025-05-31 08:37:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:37:06] [INFO ] Removed a total of 4496 redundant transitions.
[2025-05-31 08:37:07] [INFO ] Flatten gal took : 137 ms
[2025-05-31 08:37:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 21 ms.
[2025-05-31 08:37:07] [INFO ] Time to serialize gal into /tmp/LTLFireability12742280908161033592.gal : 25 ms
[2025-05-31 08:37:07] [INFO ] Time to serialize properties into /tmp/LTLFireability8527618040374639989.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12742280908161033592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8527618040374639989.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X((X(X(F("(i6.u768.p3148==1)"))))&&(("(i6.u203.p834==0)")||(F("(i6.u768.p3148==0)"))))))
Formula 0 simplified : X(XXG!"(i6.u768.p3148==1)" | (!"(i6.u203.p834==0)" & G!"(i6.u768.p3148==0)"))
Compilation finished in 13411 ms.
Running link step : cd /tmp/ltsmin17544859583833816507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin17544859583833816507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(<>((LTLAPp0==true))))&&((LTLAPp1==true)||<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17544859583833816507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(<>((LTLAPp0==true))))&&((LTLAPp1==true)||<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17544859583833816507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((X((LTLAPp3==true))&&((LTLAPp4==true)||<>([](!(LTLAPp4==true)))))) U X((LTLAPp5==true)))))' '--buchi-type=spotba'
LTSmin run took 22895 ms.
FORMULA DLCround-PT-10b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17544859583833816507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp6==true))||<>((((LTLAPp7==true)&&X((LTLAPp8==true)))||[]((LTLAPp8==true)))))' '--buchi-type=spotba'
LTSmin run took 2321 ms.
FORMULA DLCround-PT-10b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin17544859583833816507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(<>((LTLAPp0==true))))&&((LTLAPp1==true)||<>((LTLAPp2==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2025-05-31 08:57:45] [INFO ] Applying decomposition
[2025-05-31 08:57:47] [INFO ] Flatten gal took : 975 ms
[2025-05-31 08:57:47] [INFO ] Decomposing Gal with order
[2025-05-31 08:57:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:58:01] [INFO ] Removed a total of 3894 redundant transitions.
[2025-05-31 08:58:02] [INFO ] Flatten gal took : 1783 ms
[2025-05-31 08:58:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 39738 labels/synchronizations in 15076 ms.
[2025-05-31 08:58:28] [INFO ] Time to serialize gal into /tmp/LTLFireability4704130962507080837.gal : 95 ms
[2025-05-31 08:58:28] [INFO ] Time to serialize properties into /tmp/LTLFireability8276961397886029418.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4704130962507080837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8276961397886029418.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....594
Formula 0 simplified : X(XXG!"(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...582

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DLCround-PT-10b"
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-5832"
echo " Executing tool itstools"
echo " Input is DLCround-PT-10b, 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 r072-tall-174860067100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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