Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860066900171.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-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860066900171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K 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 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.6K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 813K 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-06b-LTLCardinality-00
FORMULA_NAME DLCround-PT-06b-LTLCardinality-01
FORMULA_NAME DLCround-PT-06b-LTLCardinality-02
FORMULA_NAME DLCround-PT-06b-LTLCardinality-03
FORMULA_NAME DLCround-PT-06b-LTLCardinality-04
FORMULA_NAME DLCround-PT-06b-LTLCardinality-05
FORMULA_NAME DLCround-PT-06b-LTLCardinality-06
FORMULA_NAME DLCround-PT-06b-LTLCardinality-07
FORMULA_NAME DLCround-PT-06b-LTLCardinality-08
FORMULA_NAME DLCround-PT-06b-LTLCardinality-09
FORMULA_NAME DLCround-PT-06b-LTLCardinality-10
FORMULA_NAME DLCround-PT-06b-LTLCardinality-11
FORMULA_NAME DLCround-PT-06b-LTLCardinality-12
FORMULA_NAME DLCround-PT-06b-LTLCardinality-13
FORMULA_NAME DLCround-PT-06b-LTLCardinality-14
FORMULA_NAME DLCround-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748668123737

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 05:08:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 05:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 05:08:45] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2025-05-31 05:08:45] [INFO ] Transformed 2340 places.
[2025-05-31 05:08:45] [INFO ] Transformed 3456 transitions.
[2025-05-31 05:08:45] [INFO ] Found NUPN structural information;
[2025-05-31 05:08:45] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-06b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-06b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 2340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Discarding 401 places :
Symmetric choice reduction at 0 with 401 rule applications. Total rules 401 place count 1939 transition count 3055
Iterating global reduction 0 with 401 rules applied. Total rules applied 802 place count 1939 transition count 3055
Discarding 308 places :
Symmetric choice reduction at 0 with 308 rule applications. Total rules 1110 place count 1631 transition count 2747
Iterating global reduction 0 with 308 rules applied. Total rules applied 1418 place count 1631 transition count 2747
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 1425 place count 1631 transition count 2740
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 1475 place count 1581 transition count 2632
Iterating global reduction 1 with 50 rules applied. Total rules applied 1525 place count 1581 transition count 2632
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 1554 place count 1552 transition count 2603
Iterating global reduction 1 with 29 rules applied. Total rules applied 1583 place count 1552 transition count 2603
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1587 place count 1552 transition count 2599
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1600 place count 1539 transition count 2586
Iterating global reduction 2 with 13 rules applied. Total rules applied 1613 place count 1539 transition count 2586
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1626 place count 1526 transition count 2573
Iterating global reduction 2 with 13 rules applied. Total rules applied 1639 place count 1526 transition count 2573
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1652 place count 1513 transition count 2560
Iterating global reduction 2 with 13 rules applied. Total rules applied 1665 place count 1513 transition count 2560
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1674 place count 1504 transition count 2551
Iterating global reduction 2 with 9 rules applied. Total rules applied 1683 place count 1504 transition count 2551
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1690 place count 1497 transition count 2544
Iterating global reduction 2 with 7 rules applied. Total rules applied 1697 place count 1497 transition count 2544
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1704 place count 1490 transition count 2537
Iterating global reduction 2 with 7 rules applied. Total rules applied 1711 place count 1490 transition count 2537
Applied a total of 1711 rules in 1056 ms. Remains 1490 /2340 variables (removed 850) and now considering 2537/3456 (removed 919) transitions.
// Phase 1: matrix 2537 rows 1490 cols
[2025-05-31 05:08:46] [INFO ] Computed 109 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:08:47] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2025-05-31 05:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:08:49] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 2713 ms to find 0 implicit places.
Running 2536 sub problems to find dead transitions.
[2025-05-31 05:08:49] [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 1489/4027 variables, and 0 constraints, problems are : Problem set: 0 solved, 2536 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1490 constraints, PredecessorRefiner: 2536/2536 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2536 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 1489/4027 variables, and 0 constraints, problems are : Problem set: 0 solved, 2536 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1490 constraints, PredecessorRefiner: 0/2536 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61059ms problems are : Problem set: 0 solved, 2536 unsolved
Search for dead transitions found 0 dead transitions in 61462ms
Starting structural reductions in LTL mode, iteration 1 : 1490/2340 places, 2537/3456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65266 ms. Remains : 1490/2340 places, 2537/3456 transitions.
Support contains 44 out of 1490 places after structural reductions.
[2025-05-31 05:09:51] [INFO ] Flatten gal took : 167 ms
[2025-05-31 05:09:51] [INFO ] Flatten gal took : 99 ms
[2025-05-31 05:09:51] [INFO ] Input system was already deterministic with 2537 transitions.
RANDOM walk for 37824 steps (8 resets) in 1346 ms. (28 steps per ms) remains 0/27 properties
FORMULA DLCround-PT-06b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 225 stabilizing places and 225 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(G((p0&&(p1 U p2)))))'
Support contains 5 out of 1490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Graph (trivial) has 1346 edges and 1490 vertex of which 382 / 1490 are part of one of the 32 SCC in 5 ms
Free SCC test removed 350 places
Ensure Unique test removed 376 transitions
Reduce isomorphic transitions removed 376 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 261 place count 1139 transition count 1900
Reduce places removed 260 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 293 rules applied. Total rules applied 554 place count 879 transition count 1867
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 577 place count 857 transition count 1866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 578 place count 856 transition count 1866
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 110 Pre rules applied. Total rules applied 578 place count 856 transition count 1756
Deduced a syphon composed of 110 places in 4 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 798 place count 746 transition count 1756
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 857 place count 687 transition count 1445
Iterating global reduction 4 with 59 rules applied. Total rules applied 916 place count 687 transition count 1445
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 919 place count 687 transition count 1442
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 919 place count 687 transition count 1433
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 937 place count 678 transition count 1433
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 940 place count 675 transition count 1409
Iterating global reduction 5 with 3 rules applied. Total rules applied 943 place count 675 transition count 1409
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 946 place count 675 transition count 1406
Performed 250 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 6 with 500 rules applied. Total rules applied 1446 place count 425 transition count 1149
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1453 place count 425 transition count 1142
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 1470 place count 408 transition count 981
Iterating global reduction 7 with 17 rules applied. Total rules applied 1487 place count 408 transition count 981
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1501 place count 408 transition count 967
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1503 place count 407 transition count 966
Performed 22 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 1547 place count 385 transition count 1147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1548 place count 385 transition count 1146
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1552 place count 381 transition count 1078
Iterating global reduction 9 with 4 rules applied. Total rules applied 1556 place count 381 transition count 1078
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 1587 place count 381 transition count 1047
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 1627 place count 381 transition count 1007
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 1639 place count 369 transition count 983
Iterating global reduction 10 with 12 rules applied. Total rules applied 1651 place count 369 transition count 983
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 1663 place count 357 transition count 857
Iterating global reduction 10 with 12 rules applied. Total rules applied 1675 place count 357 transition count 857
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1687 place count 357 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1688 place count 356 transition count 844
Applied a total of 1688 rules in 506 ms. Remains 356 /1490 variables (removed 1134) and now considering 844/2537 (removed 1693) transitions.
[2025-05-31 05:09:52] [INFO ] Flow matrix only has 806 transitions (discarded 38 similar events)
// Phase 1: matrix 806 rows 356 cols
[2025-05-31 05:09:52] [INFO ] Computed 109 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:53] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-31 05:09:53] [INFO ] Flow matrix only has 806 transitions (discarded 38 similar events)
[2025-05-31 05:09:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 05:09:53] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:09:53] [INFO ] Redundant transitions in 42 ms returned []
Running 787 sub problems to find dead transitions.
[2025-05-31 05:09:53] [INFO ] Flow matrix only has 806 transitions (discarded 38 similar events)
[2025-05-31 05:09:53] [INFO ] Invariant cache hit.
[2025-05-31 05:09:53] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 2 (OVERLAPS) 2/356 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 4 (OVERLAPS) 805/1161 variables, 356/465 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 58/523 constraints. Problems are: Problem set: 0 solved, 787 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1162 variables, and 523 constraints, problems are : Problem set: 0 solved, 787 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 356/356 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 787/787 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 787 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 2 (OVERLAPS) 2/356 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 4 (OVERLAPS) 805/1161 variables, 356/465 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 58/523 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1161 variables, 787/1310 constraints. Problems are: Problem set: 0 solved, 787 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1162 variables, and 1310 constraints, problems are : Problem set: 0 solved, 787 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 356/356 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 787/787 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60347ms problems are : Problem set: 0 solved, 787 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Starting structural reductions in SI_LTL mode, iteration 1 : 356/1490 places, 844/2537 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61467 ms. Remains : 356/1490 places, 844/2537 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-00
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 5 ms.
FORMULA DLCround-PT-06b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-00 finished in 61748 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)&&G(p1)) U (X(X(p2)) U (p2 U p3))))'
Support contains 7 out of 1490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1467 transition count 2505
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1467 transition count 2505
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 1454 transition count 2492
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 1454 transition count 2492
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 1449 transition count 2487
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 1449 transition count 2487
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 1446 transition count 2484
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 1446 transition count 2484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 1443 transition count 2481
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 1443 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 1442 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 1442 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 1441 transition count 2479
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 1441 transition count 2479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 1440 transition count 2478
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 1440 transition count 2478
Applied a total of 100 rules in 489 ms. Remains 1440 /1490 variables (removed 50) and now considering 2478/2537 (removed 59) transitions.
// Phase 1: matrix 2478 rows 1440 cols
[2025-05-31 05:10:54] [INFO ] Computed 109 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:10:55] [INFO ] Implicit Places using invariants in 646 ms returned []
[2025-05-31 05:10:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:10:56] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
Running 2477 sub problems to find dead transitions.
[2025-05-31 05:10:56] [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 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 2477/2477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2477 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 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 0/2477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60796ms problems are : Problem set: 0 solved, 2477 unsolved
Search for dead transitions found 0 dead transitions in 60803ms
Starting structural reductions in LTL mode, iteration 1 : 1440/1490 places, 2478/2537 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63426 ms. Remains : 1440/1490 places, 2478/2537 transitions.
Stuttering acceptance computed with spot in 522 ms :[(NOT p3), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-03
Product exploration explored 100000 steps with 33272 reset in 584 ms.
Product exploration explored 100000 steps with 33304 reset in 436 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Detected a total of 213/1440 stabilizing places and 213/2478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p1 p2 p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) p2 p1 p0)), (X (AND (NOT p3) p2 p1)), (X (NOT (OR (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (AND (NOT p3) p2)), (X (AND p1 p0)), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) p2 p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X p0), (X p1), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) p2 p1 p0))), (X (X (AND (NOT p3) p2 p1))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) p2))), (X (X (AND p1 p0))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p0)))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) p2 (NOT p0)))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 46 factoid took 325 ms. Reduced automaton from 13 states, 31 edges and 4 AP (stutter sensitive) to 13 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 504 ms :[(NOT p3), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1)]
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 19517 steps (4 resets) in 468 ms. (41 steps per ms) remains 0/22 properties
Knowledge obtained : [(AND (NOT p3) p1 p2 p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) p2 p1 p0)), (X (AND (NOT p3) p2 p1)), (X (NOT (OR (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (AND (NOT p3) p2)), (X (AND p1 p0)), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) p2 p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X p0), (X p1), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) p2 p1 p0))), (X (X (AND (NOT p3) p2 p1))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) p2))), (X (X (AND p1 p0))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p0)))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) p2 (NOT p0)))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT (AND (OR p1 (NOT p2) p3) (OR (NOT p2) p3 p0)))), (F (NOT (OR (NOT p1) p2 p3 (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT (AND (OR p1 p2 p3) (OR p2 p3 p0)))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (AND p1 p2 (NOT p3) p0))), (F (NOT (AND p1 (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p1) (NOT p2) p3 p0))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 p2 p3))), (F (NOT p2)), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p1) p3 p0))), (F (NOT (OR (NOT p1) p2 p3 p0))), (F (NOT (AND p1 p2 (NOT p3)))), (F p3), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) p3)))]
Knowledge based reduction with 46 factoid took 1224 ms. Reduced automaton from 13 states, 31 edges and 4 AP (stutter sensitive) to 13 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 422 ms :[(NOT p3), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 430 ms :[(NOT p3), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1)]
[2025-05-31 05:12:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:12:03] [INFO ] [Real]Absence check using 109 positive place invariants in 445 ms returned sat
[2025-05-31 05:12:14] [INFO ] [Real]Absence check using state equation in 10908 ms returned sat
[2025-05-31 05:12:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:12:15] [INFO ] [Nat]Absence check using 109 positive place invariants in 361 ms returned sat
[2025-05-31 05:12:26] [INFO ] [Nat]Absence check using state equation in 10142 ms returned sat
[2025-05-31 05:12:26] [INFO ] Computed and/alt/rep : 2316/3946/2316 causal constraints (skipped 161 transitions) in 119 ms.
Could not prove EG (NOT p3)
Support contains 7 out of 1440 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1440/1440 places, 2478/2478 transitions.
Applied a total of 0 rules in 40 ms. Remains 1440 /1440 variables (removed 0) and now considering 2478/2478 (removed 0) transitions.
[2025-05-31 05:12:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:12:30] [INFO ] Implicit Places using invariants in 661 ms returned []
[2025-05-31 05:12:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:12:31] [INFO ] Implicit Places using invariants and state equation in 1346 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
Running 2477 sub problems to find dead transitions.
[2025-05-31 05:12:31] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 2477/2477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2477 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 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 0/2477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60697ms problems are : Problem set: 0 solved, 2477 unsolved
Search for dead transitions found 0 dead transitions in 60703ms
Finished structural reductions in LTL mode , in 1 iterations and 62789 ms. Remains : 1440/1440 places, 2478/2478 transitions.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Detected a total of 213/1440 stabilizing places and 213/2478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p3) p2 p0), (X p2), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0)))), (X (AND p1 p2 (NOT p3) p0)), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (OR (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p2 (NOT p3) (NOT p0)))), (X (AND p1 (NOT p3))), (X (AND p2 (NOT p3))), (X (AND p1 p2 (NOT p3))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (AND p1 p2 (NOT p3) p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 46 factoid took 192 ms. Reduced automaton from 13 states, 31 edges and 4 AP (stutter sensitive) to 13 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 449 ms :[(NOT p3), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1)]
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 27479 steps (7 resets) in 208 ms. (131 steps per ms) remains 0/22 properties
Knowledge obtained : [(AND p1 (NOT p3) p2 p0), (X p2), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0)))), (X (AND p1 p2 (NOT p3) p0)), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (OR (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p2 (NOT p3) (NOT p0)))), (X (AND p1 (NOT p3))), (X (AND p2 (NOT p3))), (X (AND p1 p2 (NOT p3))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (AND p1 p2 (NOT p3) p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (AND (OR p0 (NOT p2) p3) (OR p1 (NOT p2) p3)))), (F (NOT (AND p1 (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 p2 p3))), (F (NOT (AND p0 p1))), (F (NOT (OR p1 p3))), (F (NOT (AND (OR p0 p2 p3) (OR p1 p2 p3)))), (F (NOT (AND p1 p2 (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F p3), (F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT (AND p0 p1 p2 (NOT p3)))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3)))]
Knowledge based reduction with 46 factoid took 1249 ms. Reduced automaton from 13 states, 31 edges and 4 AP (stutter sensitive) to 13 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(NOT p3), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 443 ms :[(NOT p3), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1)]
[2025-05-31 05:13:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:13:36] [INFO ] [Real]Absence check using 109 positive place invariants in 411 ms returned sat
[2025-05-31 05:13:47] [INFO ] [Real]Absence check using state equation in 11010 ms returned sat
[2025-05-31 05:13:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:13:48] [INFO ] [Nat]Absence check using 109 positive place invariants in 367 ms returned sat
[2025-05-31 05:13:59] [INFO ] [Nat]Absence check using state equation in 10316 ms returned sat
[2025-05-31 05:13:59] [INFO ] Computed and/alt/rep : 2316/3946/2316 causal constraints (skipped 161 transitions) in 104 ms.
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 428 ms :[(NOT p3), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 33343 reset in 344 ms.
Product exploration explored 100000 steps with 33470 reset in 351 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 408 ms :[(NOT p3), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1)]
Support contains 7 out of 1440 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1440/1440 places, 2478/2478 transitions.
Graph (trivial) has 1294 edges and 1440 vertex of which 355 / 1440 are part of one of the 33 SCC in 1 ms
Free SCC test removed 322 places
Ensure Unique test removed 345 transitions
Reduce isomorphic transitions removed 345 transitions.
Performed 242 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1118 transition count 2133
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 265 place count 1118 transition count 2122
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 265 place count 1118 transition count 2128
Deduced a syphon composed of 267 places in 5 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 279 place count 1118 transition count 2128
Discarding 126 places :
Symmetric choice reduction at 2 with 126 rule applications. Total rules 405 place count 992 transition count 1753
Deduced a syphon composed of 184 places in 4 ms
Iterating global reduction 2 with 126 rules applied. Total rules applied 531 place count 992 transition count 1753
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 535 place count 992 transition count 1749
Performed 362 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 546 places in 0 ms
Iterating global reduction 3 with 362 rules applied. Total rules applied 897 place count 992 transition count 1753
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 903 place count 992 transition count 1747
Renaming transitions due to excessive name length > 1024 char.
Discarding 274 places :
Symmetric choice reduction at 4 with 274 rule applications. Total rules 1177 place count 718 transition count 1332
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 4 with 274 rules applied. Total rules applied 1451 place count 718 transition count 1332
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1465 place count 718 transition count 1318
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1472 place count 711 transition count 1311
Deduced a syphon composed of 282 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1479 place count 711 transition count 1311
Performed 36 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 318 places in 0 ms
Iterating global reduction 5 with 36 rules applied. Total rules applied 1515 place count 711 transition count 1605
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1529 place count 711 transition count 1591
Discarding 48 places :
Symmetric choice reduction at 6 with 48 rule applications. Total rules 1577 place count 663 transition count 1431
Deduced a syphon composed of 274 places in 1 ms
Iterating global reduction 6 with 48 rules applied. Total rules applied 1625 place count 663 transition count 1431
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 33 rules applied. Total rules applied 1658 place count 663 transition count 1398
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1666 place count 655 transition count 1382
Deduced a syphon composed of 266 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1674 place count 655 transition count 1382
Deduced a syphon composed of 266 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 7 with 33 rules applied. Total rules applied 1707 place count 655 transition count 1349
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1716 place count 646 transition count 1331
Deduced a syphon composed of 266 places in 0 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1725 place count 646 transition count 1331
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1734 place count 637 transition count 1239
Deduced a syphon composed of 266 places in 1 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1743 place count 637 transition count 1239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1756 place count 637 transition count 1226
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1764 place count 629 transition count 1214
Deduced a syphon composed of 258 places in 0 ms
Iterating global reduction 8 with 8 rules applied. Total rules applied 1772 place count 629 transition count 1214
Deduced a syphon composed of 258 places in 0 ms
Applied a total of 1772 rules in 832 ms. Remains 629 /1440 variables (removed 811) and now considering 1214/2478 (removed 1264) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:14:05] [INFO ] Redundant transitions in 18 ms returned []
Running 1213 sub problems to find dead transitions.
[2025-05-31 05:14:05] [INFO ] Flow matrix only has 1181 transitions (discarded 33 similar events)
// Phase 1: matrix 1181 rows 629 cols
[2025-05-31 05:14:05] [INFO ] Computed 109 invariants in 15 ms
[2025-05-31 05:14:05] [INFO ] State equation strengthened by 146 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
SMT process timed out in 30698ms, After SMT, problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 30700ms
Starting structural reductions in SI_LTL mode, iteration 1 : 629/1440 places, 1214/2478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31595 ms. Remains : 629/1440 places, 1214/2478 transitions.
Built C files in :
/tmp/ltsmin17117084063319674782
[2025-05-31 05:14:36] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17117084063319674782
Running compilation step : cd /tmp/ltsmin17117084063319674782;'/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/ltsmin17117084063319674782;'/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/ltsmin17117084063319674782;'/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 7 out of 1440 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1440/1440 places, 2478/2478 transitions.
Applied a total of 0 rules in 32 ms. Remains 1440 /1440 variables (removed 0) and now considering 2478/2478 (removed 0) transitions.
// Phase 1: matrix 2478 rows 1440 cols
[2025-05-31 05:14:39] [INFO ] Computed 109 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:14:39] [INFO ] Implicit Places using invariants in 783 ms returned []
[2025-05-31 05:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:14:41] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
Running 2477 sub problems to find dead transitions.
[2025-05-31 05:14:41] [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 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 2477/2477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2477 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: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 0/2477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60760ms problems are : Problem set: 0 solved, 2477 unsolved
Search for dead transitions found 0 dead transitions in 60766ms
Finished structural reductions in LTL mode , in 1 iterations and 62932 ms. Remains : 1440/1440 places, 2478/2478 transitions.
Built C files in :
/tmp/ltsmin3716988951111605503
[2025-05-31 05:15:42] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3716988951111605503
Running compilation step : cd /tmp/ltsmin3716988951111605503;'/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/ltsmin3716988951111605503;'/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/ltsmin3716988951111605503;'/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 05:15:45] [INFO ] Flatten gal took : 83 ms
[2025-05-31 05:15:45] [INFO ] Flatten gal took : 74 ms
[2025-05-31 05:15:45] [INFO ] Time to serialize gal into /tmp/LTL12911652169770670917.gal : 34 ms
[2025-05-31 05:15:45] [INFO ] Time to serialize properties into /tmp/LTL12904112469893461257.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/LTL12911652169770670917.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6478611729979668457.hoa' '-atoms' '/tmp/LTL12904112469893461257.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/LTL12904112469893461257.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6478611729979668457.hoa
Detected timeout of ITS tools.
[2025-05-31 05:16:00] [INFO ] Flatten gal took : 125 ms
[2025-05-31 05:16:00] [INFO ] Flatten gal took : 129 ms
[2025-05-31 05:16:00] [INFO ] Time to serialize gal into /tmp/LTL2388315832477771112.gal : 16 ms
[2025-05-31 05:16:00] [INFO ] Time to serialize properties into /tmp/LTL7592223309849921195.ltl : 6 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/LTL2388315832477771112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7592223309849921195.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("((p2326==0)||(p1703==1))"))&&(G("((p1255==0)||(p731==1))")))U((X(X("((p1013==0)||(p742==1))")))U(("((p1013==0)||(p742==1))")U(...172
Formula 0 simplified : (X!"((p2326==0)||(p1703==1))" | F!"((p1255==0)||(p731==1))") R (XX!"((p1013==0)||(p742==1))" R (!"((p1013==0)||(p742==1))" R !"(p134...163
Detected timeout of ITS tools.
[2025-05-31 05:16:16] [INFO ] Flatten gal took : 57 ms
[2025-05-31 05:16:16] [INFO ] Applying decomposition
[2025-05-31 05:16:16] [INFO ] Flatten gal took : 57 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/graph16788855235046169485.txt' '-o' '/tmp/graph16788855235046169485.bin' '-w' '/tmp/graph16788855235046169485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16788855235046169485.bin' '-l' '-1' '-v' '-w' '/tmp/graph16788855235046169485.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:16:16] [INFO ] Decomposing Gal with order
[2025-05-31 05:16:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:16:16] [INFO ] Removed a total of 2190 redundant transitions.
[2025-05-31 05:16:16] [INFO ] Flatten gal took : 184 ms
[2025-05-31 05:16:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 36 ms.
[2025-05-31 05:16:17] [INFO ] Time to serialize gal into /tmp/LTL8210357141797230751.gal : 23 ms
[2025-05-31 05:16:17] [INFO ] Time to serialize properties into /tmp/LTL10941519038699342732.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/LTL8210357141797230751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10941519038699342732.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("((i17.u554.p2326==0)||(i14.i1.i5.u431.p1703==1))"))&&(G("((i18.u318.p1255==0)||(i9.u169.p731==1))")))U((X(X("((i6.i1.i2.u250.p...273
Formula 0 simplified : (X!"((i17.u554.p2326==0)||(i14.i1.i5.u431.p1703==1))" | F!"((i18.u318.p1255==0)||(i9.u169.p731==1))") R (XX!"((i6.i1.i2.u250.p1013==...264
Detected timeout of ITS tools.
Treatment of property DLCround-PT-06b-LTLCardinality-03 finished in 338007 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(X(X(p1)))) U (!p2 U (G(!p2)||(!p2&&G(p3))))))'
Support contains 7 out of 1490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1470 transition count 2517
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1470 transition count 2517
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 1457 transition count 2504
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 1457 transition count 2504
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 1450 transition count 2497
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 1450 transition count 2497
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 1445 transition count 2492
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 1445 transition count 2492
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 1441 transition count 2488
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 1441 transition count 2488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 1439 transition count 2486
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 1439 transition count 2486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 1438 transition count 2485
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 1438 transition count 2485
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 1437 transition count 2484
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 1437 transition count 2484
Applied a total of 106 rules in 311 ms. Remains 1437 /1490 variables (removed 53) and now considering 2484/2537 (removed 53) transitions.
// Phase 1: matrix 2484 rows 1437 cols
[2025-05-31 05:16:32] [INFO ] Computed 109 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:16:33] [INFO ] Implicit Places using invariants in 595 ms returned []
[2025-05-31 05:16:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:16:34] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
Running 2483 sub problems to find dead transitions.
[2025-05-31 05:16:34] [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 1436/3921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2483 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 2483/2483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2483 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)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1436/3921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2483 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 0/2483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60702ms problems are : Problem set: 0 solved, 2483 unsolved
Search for dead transitions found 0 dead transitions in 60706ms
Starting structural reductions in LTL mode, iteration 1 : 1437/1490 places, 2484/2537 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63057 ms. Remains : 1437/1490 places, 2484/2537 transitions.
Stuttering acceptance computed with spot in 1567 ms :[p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p3)), (NOT p3)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-04
Product exploration explored 100000 steps with 20062 reset in 344 ms.
Product exploration explored 100000 steps with 19917 reset in 421 ms.
Computed a total of 215 stabilizing places and 215 stable transitions
Computed a total of 215 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND p3 p2 p0 p1), (X p2), (X p3), (X (AND p3 p2)), (X (NOT (AND p3 p2 (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X (AND p3 p2 p0)), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND p3 (NOT p2)))), (X p0), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (AND p3 p0))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 p2 p0))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 377 ms. Reduced automaton from 36 states, 111 edges and 4 AP (stutter sensitive) to 36 states, 111 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1597 ms :[p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 773 ms. (51 steps per ms) remains 13/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 13/13 properties
[2025-05-31 05:17:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 448/455 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 982/1437 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1437 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2484/3921 variables, 1437/1546 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3921 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/3921 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3921/3921 variables, and 1546 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1437/1437 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 448/455 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 982/1437 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1437 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2484/3921 variables, 1437/1546 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3921 variables, 13/1559 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:17:45] [INFO ] Deduced a trap along path composed of 5 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3921 variables, 1/1560 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 0)
(t3 0)
(t4 0)
(t5 0)
(t6 0)
(t7 1)
(t8 0)
(t9 0)
(t10 0)
(t11 0)
(t12 0)
(t13 1)
(t14 0)
(t15 0)
(t16 0)
(t17 0)
(t18 0)
(t19 1)
(t20 0)
(t21 0)
(t22 0)
(t23 0)
(t24 0)
(t25 1)
(t26 1)
(t27 0)
(t28 0)
(t29 1)
(t30 0)
(t31 1)
(t32 0)
(t33 0)
(t34 0)
(t35 0)
(t36 0)
(t37 1)
(t38 1)
(t39 1)
(t40 0)
(t41 1)
(t42 1)
(t43 1)
(t44 1)
(t45 2)
(t46 0)
(t47 2)
(t48 2)
(t49 1)
(t50 1)
(t51 1)
(t52 0)
(t53 1)
(t54 1)
(t55 1)
(t56 1)
(t57 1)
(t58 0)
(t59 1)
(t60 1)
(t61 1)
(t62 1)
(t63 1)
(t64 0)
(t65 1)
(t66 1)
(t67 1)
(t68 1)
(t69 0)
(t70 1)
(t71 1)
(t72 1)
(t73 1)
(t74 1)
(t75 1)
(t76 0)
(t77 1)
(t78 1)
(t79 1)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 1)
(t86 1)
(t87 0)
(t88 1)
(t89 1)
(t90 1)
(t91 1)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 1)
(t98 1)
(t99 0)
(t100 0)
(t101 1)
(t102 1)
(t103 1)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 1)
(t110 1)
(t111 0)
(t112 0)
(t113 1)
(t114 1)
(t115 1)
(t116 1)
(t117 0)
(t118 1)
(t119 1)
(t120 1)
(t121 1)
(t122 1)
(t123 0)
(t124 0)
(t125 1)
(t126 0)
(t127 1)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 1)
(t134 1)
(t135 0)
(t136 0)
(t137 1)
(t138 0)
(t139 1)
(t140 1)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 1)
(t146 1)
(t147 0)
(t148 0)
(t149 1)
(t150 0)
(t151 1)
(t152 1)
(t153 0)
(t154 0)
(t155 1)
(t156 0)
(t157 1)
(t158 1)
(t159 0)
(t160 0)
(t161 1)
(t162 0)
(t163 1)
(t164 1)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 1)
(t170 1)
(t171 0)
(t172 0)
(t173 1)
(t174 1)
(t175 1)
(t176 1)
(t177 0)
(t178 0)
(t179 1)
(t180 0)
(t181 1)
(t182 1)
(t183 0)
(t184 0)
(t185 1)
(t186 1)
(t187 1)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 1)
(t194 1)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 1)
(t200 1)
(t201 0)
(t202 1)
(t203 1)
(t204 1)
(t205 1)
(t206 1)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 1)
(t212 1)
(t213 1)
(t214 0)
(t215 1)
(t216 1)
(t217 1)
(t218 1)
(t219 0)
(t220 0)
(t221 1)
(t222 0)
(t223 1)
(t224 1)
(t225 0)
(t226 0)
(t227 1)
(t228 0)
(t229 1)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 1)
(t236 1)
(t237 0)
(t238 0)
(t239 1)
(t240 0)
(t241 1)
(t242 1)
(t243 1)
(t244 0)
(t245 1)
(t246 1)
(t247 1)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t252 0)
(t253 1)
(t254 0)
(t255 0)
(t256 1)
(t257 1)
(t258 1)
(t259 1)
(t260 1)
(t261 1)
(t262 0)
(t263 1)
(t264 1)
(t265 1)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 1)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 1)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 1)
(t284 1)
(t285 1)
(t286 0)
(t287 1)
(t288 1)
(t289 1)
(t290 1)
(t291 0)
(t292 0)
(t293 1)
(t294 0)
(t295 1)
(t296 1)
(t297 0)
(t298 0)
(t299 1)
(t300 1)
(t301 1)
(t302 1)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 1)
(t308 1)
(t309 0)
(t310 0)
(t311 1)
(t312 1)
(t313 1)
(t314 1)
(t315 0)
(t316 0)
(t317 1)
(t318 0)
(t319 1)
(t320 1)
(t321 0)
(t322 0)
(t323 1)
(t324 0)
(t325 1)
(t326 1)
(t327 1)
(t328 0)
(t329 1)
(t330 1)
(t331 1)
(t332 1)
(t333 1)
(t334 0)
(t335 1)
(t336 1)
(t337 1)
(t338 1)
(t339 0)
(t340 0)
(t341 1)
(t342 0)
(t343 1)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 0)
(t349 1)
(t350 1)
(t351 0)
(t352 1)
(t353 1)
(t354 1)
(t355 1)
(t356 1)
(t357 0)
(t358 0)
(t359 1)
(t360 1)
(t361 1)
(t362 0)
(t363 0)
(t364 1)
(t365 1)
(t366 1)
(t367 1)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 1)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 1)
(t380 1)
(t381 1)
(t382 0)
(t383 1)
(t384 1)
(t385 1)
(t386 1)
(t387 0)
(t388 0)
(t389 1)
(t390 0)
(t391 1)
(t392 1)
(t393 0)
(t394 0)
(t395 1)
(t396 1)
(t397 1)
(t398 1)
(t399 0)
(t400 0)
(t401 0)
(t402 0)
(t403 1)
(t404 1)
(t405 0)
(t406 0)
(t407 1)
(t408 1)
(t409 1)
(t410 1)
(t411 0)
(t412 0)
(t413 1)
(t414 1)
(t415 1)
(t416 1)
(t417 0)
(t418 0)
(t419 1)
(t420 0)
(t421 1)
(t422 1)
(t423 0)
(t424 1)
(t425 1)
(t426 1)
(t427 1)
(t428 1)
(t429 1)
(t430 0)
(t431 1)
(t432 1)
(t433 1)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 1)
(t440 1)
(t441 0)
(t442 1)
(t443 1)
(t444 1)
(t445 1)
(t446 1)
(t447 1)
(t448 0)
(t449 1)
(t450 1)
(t451 1)
(t452 1)
(t453 0)
(t454 0)
(t455 1)
(t456 0)
(t457 1)
(t458 1)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 1)
(t464 1)
(t465 0)
(t466 0)
(t467 1)
(t468 0)
(t469 1)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 1)
(t476 1)
(t477 1)
(t478 0)
(t479 1)
(t480 1)
(t481 1)
(t482 1)
(t483 1)
(t484 0)
(t485 1)
(t486 1)
(t487 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3921/3921 variables, and 1560 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1437/1437 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7212ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 1437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1437/1437 places, 2484/2484 transitions.
Graph (trivial) has 1290 edges and 1437 vertex of which 347 / 1437 are part of one of the 35 SCC in 2 ms
Free SCC test removed 312 places
Drop transitions (Empty/Sink Transition effects.) removed 359 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 367 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 1125 transition count 1873
Reduce places removed 244 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 277 rules applied. Total rules applied 522 place count 881 transition count 1840
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 545 place count 859 transition count 1839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 546 place count 858 transition count 1839
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 117 Pre rules applied. Total rules applied 546 place count 858 transition count 1722
Deduced a syphon composed of 117 places in 4 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 4 with 234 rules applied. Total rules applied 780 place count 741 transition count 1722
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 819 place count 702 transition count 1449
Iterating global reduction 4 with 39 rules applied. Total rules applied 858 place count 702 transition count 1449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 861 place count 702 transition count 1446
Performed 263 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 263 places in 0 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 5 with 526 rules applied. Total rules applied 1387 place count 439 transition count 1177
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1394 place count 439 transition count 1170
Renaming transitions due to excessive name length > 1024 char.
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1409 place count 424 transition count 1032
Iterating global reduction 6 with 15 rules applied. Total rules applied 1424 place count 424 transition count 1032
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1436 place count 424 transition count 1020
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1442 place count 421 transition count 1017
Performed 39 Post agglomeration using F-continuation condition with reduction of 38 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 1520 place count 382 transition count 1334
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1535 place count 367 transition count 1058
Iterating global reduction 7 with 15 rules applied. Total rules applied 1550 place count 367 transition count 1058
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 1585 place count 367 transition count 1023
Drop transitions (Redundant composition of simpler transitions.) removed 113 transitions
Redundant transition composition rules discarded 113 transitions
Iterating global reduction 8 with 113 rules applied. Total rules applied 1698 place count 367 transition count 910
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1705 place count 360 transition count 840
Iterating global reduction 8 with 7 rules applied. Total rules applied 1712 place count 360 transition count 840
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1719 place count 360 transition count 833
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1729 place count 355 transition count 874
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1735 place count 355 transition count 868
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 1756 place count 355 transition count 847
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 10 with 8 rules applied. Total rules applied 1764 place count 351 transition count 878
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 1770 place count 351 transition count 872
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 1791 place count 351 transition count 851
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
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 1799 place count 347 transition count 885
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 1807 place count 347 transition count 877
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 1828 place count 347 transition count 856
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1836 place count 343 transition count 889
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 1844 place count 343 transition count 881
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 1865 place count 343 transition count 860
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1873 place count 339 transition count 899
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 1882 place count 339 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 14 with 23 rules applied. Total rules applied 1905 place count 339 transition count 867
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1913 place count 335 transition count 906
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1923 place count 335 transition count 896
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 15 with 27 rules applied. Total rules applied 1950 place count 335 transition count 869
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
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 1958 place count 331 transition count 902
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 1965 place count 331 transition count 895
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 16 with 25 rules applied. Total rules applied 1990 place count 331 transition count 870
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 16 with 8 rules applied. Total rules applied 1998 place count 327 transition count 897
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 2004 place count 327 transition count 891
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 2025 place count 327 transition count 870
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
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 2033 place count 323 transition count 905
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 2042 place count 323 transition count 896
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 2062 place count 323 transition count 876
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
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 2070 place count 319 transition count 912
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 2080 place count 319 transition count 902
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 2101 place count 319 transition count 881
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
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 2109 place count 315 transition count 913
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 2116 place count 315 transition count 906
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 20 with 22 rules applied. Total rules applied 2138 place count 315 transition count 884
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 20 with 8 rules applied. Total rules applied 2146 place count 311 transition count 911
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 2152 place count 311 transition count 905
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 2173 place count 311 transition count 884
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
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 2181 place count 307 transition count 914
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 2187 place count 307 transition count 908
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 2208 place count 307 transition count 887
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 22 with 8 rules applied. Total rules applied 2216 place count 303 transition count 916
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 2222 place count 303 transition count 910
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 2243 place count 303 transition count 889
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 23 with 8 rules applied. Total rules applied 2251 place count 299 transition count 920
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 2255 place count 299 transition count 916
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 24 with 19 rules applied. Total rules applied 2274 place count 299 transition count 897
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 24 with 8 rules applied. Total rules applied 2282 place count 295 transition count 926
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 2288 place count 295 transition count 920
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2307 place count 295 transition count 901
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
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 2315 place count 291 transition count 929
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 25 with 8 rules applied. Total rules applied 2323 place count 291 transition count 921
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2342 place count 291 transition count 902
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2350 place count 287 transition count 937
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 26 with 10 rules applied. Total rules applied 2360 place count 287 transition count 927
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 27 with 28 rules applied. Total rules applied 2388 place count 287 transition count 899
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
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 2396 place count 283 transition count 935
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 2406 place count 283 transition count 925
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 28 with 28 rules applied. Total rules applied 2434 place count 283 transition count 897
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -22
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 2442 place count 279 transition count 919
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2446 place count 279 transition count 915
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 2465 place count 279 transition count 896
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 2473 place count 275 transition count 934
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 29 with 12 rules applied. Total rules applied 2485 place count 275 transition count 922
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2504 place count 275 transition count 903
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 2512 place count 271 transition count 931
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 30 with 8 rules applied. Total rules applied 2520 place count 271 transition count 923
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 2539 place count 271 transition count 904
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 2547 place count 267 transition count 926
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 2551 place count 267 transition count 922
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 2570 place count 267 transition count 903
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
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 2578 place count 263 transition count 929
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 2582 place count 263 transition count 925
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 2601 place count 263 transition count 906
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 33 with 4 rules applied. Total rules applied 2605 place count 261 transition count 914
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 2607 place count 261 transition count 912
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 34 with 5 rules applied. Total rules applied 2612 place count 261 transition count 907
Free-agglomeration rule applied 32 times.
Iterating global reduction 34 with 32 rules applied. Total rules applied 2644 place count 261 transition count 875
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Graph (complete) has 819 edges and 229 vertex of which 217 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 34 with 257 rules applied. Total rules applied 2901 place count 217 transition count 651
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 35 with 12 rules applied. Total rules applied 2913 place count 217 transition count 639
Drop transitions (Redundant composition of simpler transitions.) removed 135 transitions
Redundant transition composition rules discarded 135 transitions
Iterating global reduction 36 with 135 rules applied. Total rules applied 3048 place count 217 transition count 504
Graph (complete) has 739 edges and 217 vertex of which 205 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 36 with 1 rules applied. Total rules applied 3049 place count 205 transition count 504
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 37 with 12 rules applied. Total rules applied 3061 place count 205 transition count 492
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 38 with 3 rules applied. Total rules applied 3064 place count 205 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 38 with 1 rules applied. Total rules applied 3065 place count 204 transition count 491
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 3067 place count 202 transition count 491
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 39 with 24 rules applied. Total rules applied 3091 place count 186 transition count 483
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 39 with 20 rules applied. Total rules applied 3111 place count 186 transition count 463
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 40 with 54 rules applied. Total rules applied 3165 place count 150 transition count 445
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (trivial) has 19 edges and 150 vertex of which 8 / 150 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 60 rules applied. Total rules applied 3225 place count 146 transition count 386
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 356 edges and 143 vertex of which 113 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Iterating post reduction 41 with 87 rules applied. Total rules applied 3312 place count 113 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 42 with 15 rules applied. Total rules applied 3327 place count 113 transition count 273
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 43 with 45 rules applied. Total rules applied 3372 place count 83 transition count 258
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 43 with 69 rules applied. Total rules applied 3441 place count 83 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 44 with 72 rules applied. Total rules applied 3513 place count 83 transition count 117
Graph (complete) has 182 edges and 83 vertex of which 33 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 0 output transitions
Iterating post reduction 44 with 1 rules applied. Total rules applied 3514 place count 33 transition count 117
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 45 with 79 rules applied. Total rules applied 3593 place count 33 transition count 38
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 46 with 5 rules applied. Total rules applied 3598 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 47 with 1 rules applied. Total rules applied 3599 place count 28 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 48 with 3 rules applied. Total rules applied 3602 place count 28 transition count 34
Free-agglomeration rule applied 4 times.
Iterating global reduction 48 with 4 rules applied. Total rules applied 3606 place count 28 transition count 30
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 3610 place count 24 transition count 30
Applied a total of 3610 rules in 744 ms. Remains 24 /1437 variables (removed 1413) and now considering 30/2484 (removed 2454) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 744 ms. Remains : 24/1437 places, 30/2484 transitions.
RANDOM walk for 452 steps (0 resets) in 6 ms. (64 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p3 p2 p0 p1), (X p2), (X p3), (X (AND p3 p2)), (X (NOT (AND p3 p2 (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X (AND p3 p2 p0)), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND p3 (NOT p2)))), (X p0), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (AND p3 p0))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 p2 p0))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p3) p1))), (F (NOT (AND p0 p2 p3))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p0) p3))), (F (NOT (AND p0 p3))), (F (NOT (AND p2 p3))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p2 (NOT p3) p1))), (F (NOT (OR p0 p3 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p3)), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR p3 p1))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p2) (NOT p3) p1))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT p0)), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p3) p1))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p0 p2 p3))), (F (NOT p1))]
Knowledge based reduction with 39 factoid took 2101 ms. Reduced automaton from 36 states, 111 edges and 4 AP (stutter sensitive) to 36 states, 111 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1639 ms :[p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 1584 ms :[p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p3)), (NOT p3)]
[2025-05-31 05:17:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:17:54] [INFO ] [Real]Absence check using 109 positive place invariants in 542 ms returned sat
[2025-05-31 05:18:08] [INFO ] [Real]Absence check using state equation in 13648 ms returned unknown
Could not prove EG p2
Support contains 7 out of 1437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1437/1437 places, 2484/2484 transitions.
Applied a total of 0 rules in 40 ms. Remains 1437 /1437 variables (removed 0) and now considering 2484/2484 (removed 0) transitions.
[2025-05-31 05:18:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:18:09] [INFO ] Implicit Places using invariants in 581 ms returned []
[2025-05-31 05:18:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:18:10] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
Running 2483 sub problems to find dead transitions.
[2025-05-31 05:18:10] [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 1436/3921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2483 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 2483/2483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2483 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 1436/3921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2483 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 0/2483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60810ms problems are : Problem set: 0 solved, 2483 unsolved
Search for dead transitions found 0 dead transitions in 60815ms
Finished structural reductions in LTL mode , in 1 iterations and 62770 ms. Remains : 1437/1437 places, 2484/2484 transitions.
Computed a total of 215 stabilizing places and 215 stable transitions
Computed a total of 215 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND p2 p3 p0 p1), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p0 p2 p3)), (X (NOT (AND (NOT p0) p2))), (X (AND p2 p3)), (X (AND p0 p2)), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p2 p3))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p2 p3))), (X (X (AND p0 p3))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 402 ms. Reduced automaton from 36 states, 111 edges and 4 AP (stutter sensitive) to 36 states, 111 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1590 ms :[p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 478 ms. (83 steps per ms) remains 12/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 46 ms. (851 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 12/12 properties
[2025-05-31 05:19:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 448/455 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 982/1437 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1437 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2484/3921 variables, 1437/1546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3921 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/3921 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3921/3921 variables, and 1546 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1437/1437 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 448/455 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 982/1437 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1437 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2484/3921 variables, 1437/1546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3921 variables, 12/1558 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3921 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3921/3921 variables, and 1558 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1437/1437 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7303ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 1437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1437/1437 places, 2484/2484 transitions.
Graph (trivial) has 1290 edges and 1437 vertex of which 347 / 1437 are part of one of the 35 SCC in 1 ms
Free SCC test removed 312 places
Drop transitions (Empty/Sink Transition effects.) removed 359 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 367 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 1125 transition count 1873
Reduce places removed 244 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 277 rules applied. Total rules applied 522 place count 881 transition count 1840
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 545 place count 859 transition count 1839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 546 place count 858 transition count 1839
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 117 Pre rules applied. Total rules applied 546 place count 858 transition count 1722
Deduced a syphon composed of 117 places in 4 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 4 with 234 rules applied. Total rules applied 780 place count 741 transition count 1722
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 819 place count 702 transition count 1449
Iterating global reduction 4 with 39 rules applied. Total rules applied 858 place count 702 transition count 1449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 861 place count 702 transition count 1446
Performed 263 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 263 places in 0 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 5 with 526 rules applied. Total rules applied 1387 place count 439 transition count 1177
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1394 place count 439 transition count 1170
Renaming transitions due to excessive name length > 1024 char.
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1409 place count 424 transition count 1032
Iterating global reduction 6 with 15 rules applied. Total rules applied 1424 place count 424 transition count 1032
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1436 place count 424 transition count 1020
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1442 place count 421 transition count 1017
Performed 39 Post agglomeration using F-continuation condition with reduction of 38 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 1520 place count 382 transition count 1334
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1535 place count 367 transition count 1058
Iterating global reduction 7 with 15 rules applied. Total rules applied 1550 place count 367 transition count 1058
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 1585 place count 367 transition count 1023
Drop transitions (Redundant composition of simpler transitions.) removed 113 transitions
Redundant transition composition rules discarded 113 transitions
Iterating global reduction 8 with 113 rules applied. Total rules applied 1698 place count 367 transition count 910
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1705 place count 360 transition count 840
Iterating global reduction 8 with 7 rules applied. Total rules applied 1712 place count 360 transition count 840
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1719 place count 360 transition count 833
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1729 place count 355 transition count 874
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1735 place count 355 transition count 868
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 1756 place count 355 transition count 847
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 10 with 8 rules applied. Total rules applied 1764 place count 351 transition count 878
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 1770 place count 351 transition count 872
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 1791 place count 351 transition count 851
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1799 place count 347 transition count 885
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 1807 place count 347 transition count 877
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 1828 place count 347 transition count 856
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1836 place count 343 transition count 889
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 1844 place count 343 transition count 881
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 1865 place count 343 transition count 860
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1873 place count 339 transition count 899
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 1882 place count 339 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 14 with 23 rules applied. Total rules applied 1905 place count 339 transition count 867
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1913 place count 335 transition count 906
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1923 place count 335 transition count 896
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 15 with 27 rules applied. Total rules applied 1950 place count 335 transition count 869
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
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 1958 place count 331 transition count 902
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 1965 place count 331 transition count 895
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 16 with 25 rules applied. Total rules applied 1990 place count 331 transition count 870
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 16 with 8 rules applied. Total rules applied 1998 place count 327 transition count 897
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 2004 place count 327 transition count 891
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 2025 place count 327 transition count 870
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
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 2033 place count 323 transition count 905
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 2042 place count 323 transition count 896
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 2062 place count 323 transition count 876
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
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 2070 place count 319 transition count 912
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 2080 place count 319 transition count 902
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 2101 place count 319 transition count 881
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
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 2109 place count 315 transition count 913
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 2116 place count 315 transition count 906
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 20 with 22 rules applied. Total rules applied 2138 place count 315 transition count 884
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 20 with 8 rules applied. Total rules applied 2146 place count 311 transition count 911
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 2152 place count 311 transition count 905
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 2173 place count 311 transition count 884
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
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 2181 place count 307 transition count 914
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 2187 place count 307 transition count 908
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 2208 place count 307 transition count 887
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 22 with 8 rules applied. Total rules applied 2216 place count 303 transition count 916
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 2222 place count 303 transition count 910
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 2243 place count 303 transition count 889
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 23 with 8 rules applied. Total rules applied 2251 place count 299 transition count 920
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 2255 place count 299 transition count 916
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 24 with 19 rules applied. Total rules applied 2274 place count 299 transition count 897
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 24 with 8 rules applied. Total rules applied 2282 place count 295 transition count 926
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 2288 place count 295 transition count 920
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2307 place count 295 transition count 901
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
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 2315 place count 291 transition count 929
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 25 with 8 rules applied. Total rules applied 2323 place count 291 transition count 921
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2342 place count 291 transition count 902
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
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 2350 place count 287 transition count 937
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 26 with 10 rules applied. Total rules applied 2360 place count 287 transition count 927
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 27 with 28 rules applied. Total rules applied 2388 place count 287 transition count 899
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 2396 place count 283 transition count 935
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 2406 place count 283 transition count 925
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 28 with 28 rules applied. Total rules applied 2434 place count 283 transition count 897
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -22
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 2442 place count 279 transition count 919
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2446 place count 279 transition count 915
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 2465 place count 279 transition count 896
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 29 with 8 rules applied. Total rules applied 2473 place count 275 transition count 934
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 29 with 12 rules applied. Total rules applied 2485 place count 275 transition count 922
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2504 place count 275 transition count 903
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 2512 place count 271 transition count 931
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 30 with 8 rules applied. Total rules applied 2520 place count 271 transition count 923
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 2539 place count 271 transition count 904
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 31 with 8 rules applied. Total rules applied 2547 place count 267 transition count 926
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 2551 place count 267 transition count 922
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 2570 place count 267 transition count 903
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
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 2578 place count 263 transition count 929
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 2582 place count 263 transition count 925
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 2601 place count 263 transition count 906
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 33 with 4 rules applied. Total rules applied 2605 place count 261 transition count 914
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 2607 place count 261 transition count 912
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 34 with 5 rules applied. Total rules applied 2612 place count 261 transition count 907
Free-agglomeration rule applied 32 times.
Iterating global reduction 34 with 32 rules applied. Total rules applied 2644 place count 261 transition count 875
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Graph (complete) has 819 edges and 229 vertex of which 217 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 34 with 257 rules applied. Total rules applied 2901 place count 217 transition count 651
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 35 with 12 rules applied. Total rules applied 2913 place count 217 transition count 639
Drop transitions (Redundant composition of simpler transitions.) removed 135 transitions
Redundant transition composition rules discarded 135 transitions
Iterating global reduction 36 with 135 rules applied. Total rules applied 3048 place count 217 transition count 504
Graph (complete) has 739 edges and 217 vertex of which 205 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 36 with 1 rules applied. Total rules applied 3049 place count 205 transition count 504
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 37 with 12 rules applied. Total rules applied 3061 place count 205 transition count 492
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 38 with 3 rules applied. Total rules applied 3064 place count 205 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 38 with 1 rules applied. Total rules applied 3065 place count 204 transition count 491
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 3067 place count 202 transition count 491
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 39 with 24 rules applied. Total rules applied 3091 place count 186 transition count 483
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 39 with 20 rules applied. Total rules applied 3111 place count 186 transition count 463
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 40 with 54 rules applied. Total rules applied 3165 place count 150 transition count 445
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (trivial) has 19 edges and 150 vertex of which 8 / 150 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 60 rules applied. Total rules applied 3225 place count 146 transition count 386
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 356 edges and 143 vertex of which 113 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Iterating post reduction 41 with 87 rules applied. Total rules applied 3312 place count 113 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 42 with 15 rules applied. Total rules applied 3327 place count 113 transition count 273
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 43 with 45 rules applied. Total rules applied 3372 place count 83 transition count 258
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 43 with 69 rules applied. Total rules applied 3441 place count 83 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 44 with 72 rules applied. Total rules applied 3513 place count 83 transition count 117
Graph (complete) has 182 edges and 83 vertex of which 33 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 0 output transitions
Iterating post reduction 44 with 1 rules applied. Total rules applied 3514 place count 33 transition count 117
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 45 with 79 rules applied. Total rules applied 3593 place count 33 transition count 38
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 46 with 5 rules applied. Total rules applied 3598 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 47 with 1 rules applied. Total rules applied 3599 place count 28 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 48 with 3 rules applied. Total rules applied 3602 place count 28 transition count 34
Free-agglomeration rule applied 4 times.
Iterating global reduction 48 with 4 rules applied. Total rules applied 3606 place count 28 transition count 30
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 3610 place count 24 transition count 30
Applied a total of 3610 rules in 653 ms. Remains 24 /1437 variables (removed 1413) and now considering 30/2484 (removed 2454) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 24/1437 places, 30/2484 transitions.
RANDOM walk for 440 steps (0 resets) in 8 ms. (48 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p2 p3 p0 p1), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p0 p2 p3)), (X (NOT (AND (NOT p0) p2))), (X (AND p2 p3)), (X (AND p0 p2)), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p2 p3))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p2 p3))), (X (X (AND p0 p3))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 (NOT p3) p1))), (F (NOT (OR (NOT p3) p1))), (F (NOT (AND p2 p3))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p3) (NOT p0) p1))), (F (NOT (OR p2 p3 (NOT p0)))), (F (NOT (AND p3 p0))), (F (NOT p1)), (F (NOT p3)), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (OR p3 p1))), (F (NOT (OR (NOT p3) p0 p1))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p3 (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p3 p0 p1))), (F (NOT (OR p2 (NOT p3) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) p1))), (F (NOT (OR (NOT p3) p0))), (F (NOT p0)), (F (NOT (OR p2 p3 p0))), (F (NOT (OR (NOT p2) p3 p0))), (F (NOT (OR p3 (NOT p0)))), (F (NOT (AND p2 p0))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 (NOT p3) p0))), (F (NOT (AND p2 p3 p0))), (F (NOT (OR p3 p0))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) (NOT p3) p0)))]
Knowledge based reduction with 39 factoid took 2061 ms. Reduced automaton from 36 states, 111 edges and 4 AP (stutter sensitive) to 36 states, 111 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1605 ms :[p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 1621 ms :[p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p3)), (NOT p3)]
[2025-05-31 05:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:19:28] [INFO ] [Real]Absence check using 109 positive place invariants in 544 ms returned sat
[2025-05-31 05:19:42] [INFO ] [Real]Absence check using state equation in 13613 ms returned unknown
Could not prove EG p2
Stuttering acceptance computed with spot in 1607 ms :[p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 19961 reset in 313 ms.
Product exploration explored 100000 steps with 20029 reset in 311 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, false, true, true, false, false, false, false, false, false, false, false, false, false, false, false, false, true, true, true, false, false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 1612 ms :[p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p3)), (NOT p3)]
Support contains 7 out of 1437 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1437/1437 places, 2484/2484 transitions.
Graph (trivial) has 1290 edges and 1437 vertex of which 347 / 1437 are part of one of the 35 SCC in 1 ms
Free SCC test removed 312 places
Ensure Unique test removed 332 transitions
Reduce isomorphic transitions removed 332 transitions.
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1125 transition count 2152
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 263 place count 1125 transition count 2141
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 263 place count 1125 transition count 2146
Deduced a syphon composed of 262 places in 5 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 274 place count 1125 transition count 2146
Discarding 115 places :
Symmetric choice reduction at 2 with 115 rule applications. Total rules 389 place count 1010 transition count 1797
Deduced a syphon composed of 186 places in 4 ms
Iterating global reduction 2 with 115 rules applied. Total rules applied 504 place count 1010 transition count 1797
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 507 place count 1010 transition count 1794
Performed 371 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 557 places in 0 ms
Iterating global reduction 3 with 371 rules applied. Total rules applied 878 place count 1010 transition count 1798
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 884 place count 1010 transition count 1792
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 4 with 281 rule applications. Total rules 1165 place count 729 transition count 1388
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 4 with 281 rules applied. Total rules applied 1446 place count 729 transition count 1388
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1458 place count 729 transition count 1376
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1464 place count 723 transition count 1370
Deduced a syphon composed of 285 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1470 place count 723 transition count 1370
Performed 33 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 318 places in 0 ms
Iterating global reduction 5 with 33 rules applied. Total rules applied 1503 place count 723 transition count 1605
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1517 place count 723 transition count 1591
Discarding 44 places :
Symmetric choice reduction at 6 with 44 rule applications. Total rules 1561 place count 679 transition count 1442
Deduced a syphon composed of 278 places in 0 ms
Iterating global reduction 6 with 44 rules applied. Total rules applied 1605 place count 679 transition count 1442
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1637 place count 679 transition count 1410
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1645 place count 671 transition count 1394
Deduced a syphon composed of 270 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1653 place count 671 transition count 1394
Deduced a syphon composed of 270 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 1672 place count 671 transition count 1375
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1679 place count 664 transition count 1361
Deduced a syphon composed of 270 places in 0 ms
Iterating global reduction 7 with 7 rules applied. Total rules applied 1686 place count 664 transition count 1361
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1693 place count 657 transition count 1287
Deduced a syphon composed of 270 places in 0 ms
Iterating global reduction 7 with 7 rules applied. Total rules applied 1700 place count 657 transition count 1287
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1710 place count 657 transition count 1277
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1717 place count 650 transition count 1266
Deduced a syphon composed of 263 places in 0 ms
Iterating global reduction 8 with 7 rules applied. Total rules applied 1724 place count 650 transition count 1266
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 264 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1725 place count 650 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1726 place count 649 transition count 1276
Deduced a syphon composed of 263 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1727 place count 649 transition count 1276
Deduced a syphon composed of 263 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1731 place count 649 transition count 1272
Deduced a syphon composed of 263 places in 0 ms
Applied a total of 1731 rules in 529 ms. Remains 649 /1437 variables (removed 788) and now considering 1272/2484 (removed 1212) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:19:46] [INFO ] Redundant transitions in 23 ms returned []
Running 1270 sub problems to find dead transitions.
[2025-05-31 05:19:46] [INFO ] Flow matrix only has 1241 transitions (discarded 31 similar events)
// Phase 1: matrix 1241 rows 649 cols
[2025-05-31 05:19:46] [INFO ] Computed 109 invariants in 18 ms
[2025-05-31 05:19:46] [INFO ] State equation strengthened by 136 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.
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")
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
SMT process timed out in 30611ms, After SMT, problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 30613ms
Starting structural reductions in SI_LTL mode, iteration 1 : 649/1437 places, 1272/2484 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31182 ms. Remains : 649/1437 places, 1272/2484 transitions.
Built C files in :
/tmp/ltsmin8781834832766384466
[2025-05-31 05:20:17] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8781834832766384466
Running compilation step : cd /tmp/ltsmin8781834832766384466;'/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/ltsmin8781834832766384466;'/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/ltsmin8781834832766384466;'/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 7 out of 1437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1437/1437 places, 2484/2484 transitions.
Applied a total of 0 rules in 45 ms. Remains 1437 /1437 variables (removed 0) and now considering 2484/2484 (removed 0) transitions.
// Phase 1: matrix 2484 rows 1437 cols
[2025-05-31 05:20:20] [INFO ] Computed 109 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:20:21] [INFO ] Implicit Places using invariants in 637 ms returned []
[2025-05-31 05:20:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:20:22] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
Running 2483 sub problems to find dead transitions.
[2025-05-31 05:20:22] [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 1436/3921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2483 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 2483/2483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2483 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 1436/3921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2483 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 0/2483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60712ms problems are : Problem set: 0 solved, 2483 unsolved
Search for dead transitions found 0 dead transitions in 60717ms
Finished structural reductions in LTL mode , in 1 iterations and 62781 ms. Remains : 1437/1437 places, 2484/2484 transitions.
Built C files in :
/tmp/ltsmin10331478394538357852
[2025-05-31 05:21:23] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10331478394538357852
Running compilation step : cd /tmp/ltsmin10331478394538357852;'/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/ltsmin10331478394538357852;'/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/ltsmin10331478394538357852;'/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 05:21:26] [INFO ] Flatten gal took : 45 ms
[2025-05-31 05:21:26] [INFO ] Flatten gal took : 45 ms
[2025-05-31 05:21:26] [INFO ] Time to serialize gal into /tmp/LTL13811018863947727801.gal : 10 ms
[2025-05-31 05:21:26] [INFO ] Time to serialize properties into /tmp/LTL7452231475509585566.prop : 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/LTL13811018863947727801.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17739334392201174706.hoa' '-atoms' '/tmp/LTL7452231475509585566.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/LTL7452231475509585566.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17739334392201174706.hoa
Detected timeout of ITS tools.
[2025-05-31 05:21:41] [INFO ] Flatten gal took : 45 ms
[2025-05-31 05:21:41] [INFO ] Flatten gal took : 62 ms
[2025-05-31 05:21:41] [INFO ] Time to serialize gal into /tmp/LTL2843864688538307821.gal : 10 ms
[2025-05-31 05:21:41] [INFO ] Time to serialize properties into /tmp/LTL4588559230819403311.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/LTL2843864688538307821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4588559230819403311.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 : !(((("((p1183==0)||(p706==1))")U(X(X(X("((p457==0)||(p453==1))")))))U((!("((p168==0)||(p963==1))"))U((G(!("((p168==0)||(p963==1))")))|...209
Formula 0 simplified : (!"((p1183==0)||(p706==1))" R XXX!"((p457==0)||(p453==1))") R (F!"(p602!=1)" U "((p168==0)||(p963==1))")
Detected timeout of ITS tools.
[2025-05-31 05:21:56] [INFO ] Flatten gal took : 44 ms
[2025-05-31 05:21:56] [INFO ] Applying decomposition
[2025-05-31 05:21:57] [INFO ] Flatten gal took : 44 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/graph3378583011307921976.txt' '-o' '/tmp/graph3378583011307921976.bin' '-w' '/tmp/graph3378583011307921976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3378583011307921976.bin' '-l' '-1' '-v' '-w' '/tmp/graph3378583011307921976.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:21:57] [INFO ] Decomposing Gal with order
[2025-05-31 05:21:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:21:57] [INFO ] Removed a total of 2193 redundant transitions.
[2025-05-31 05:21:57] [INFO ] Flatten gal took : 89 ms
[2025-05-31 05:21:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 32 ms.
[2025-05-31 05:21:57] [INFO ] Time to serialize gal into /tmp/LTL13249987797268634187.gal : 18 ms
[2025-05-31 05:21:57] [INFO ] Time to serialize properties into /tmp/LTL6862435734081242609.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/LTL13249987797268634187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6862435734081242609.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 : !(((("((i18.u284.p1183==0)||(i10.u165.p706==1))")U(X(X(X("((i5.u95.p457==0)||(i5.u93.p453==1))")))))U((!("((i1.i1.i1.u34.p168==0)||(i1...333
Formula 0 simplified : (!"((i18.u284.p1183==0)||(i10.u165.p706==1))" R XXX!"((i5.u95.p457==0)||(i5.u93.p453==1))") R (F!"(i8.u138.p602!=1)" U "((i1.i1.i1.u...195
Detected timeout of ITS tools.
Treatment of property DLCround-PT-06b-LTLCardinality-04 finished in 340466 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)&&G((p1||X(p1))))))))'
Support contains 3 out of 1490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1468 transition count 2506
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1468 transition count 2506
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 1454 transition count 2492
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 1454 transition count 2492
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1448 transition count 2486
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1448 transition count 2486
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 1444 transition count 2482
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 1444 transition count 2482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 1441 transition count 2479
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 1441 transition count 2479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 1439 transition count 2477
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 1439 transition count 2477
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 1438 transition count 2476
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 1438 transition count 2476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 1437 transition count 2475
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 1437 transition count 2475
Applied a total of 106 rules in 414 ms. Remains 1437 /1490 variables (removed 53) and now considering 2475/2537 (removed 62) transitions.
// Phase 1: matrix 2475 rows 1437 cols
[2025-05-31 05:22:13] [INFO ] Computed 109 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:22:13] [INFO ] Implicit Places using invariants in 664 ms returned []
[2025-05-31 05:22:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:22:15] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
Running 2474 sub problems to find dead transitions.
[2025-05-31 05:22:15] [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 1436/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2474 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 2474/2474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2474 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 1436/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2474 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 0/2474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60745ms problems are : Problem set: 0 solved, 2474 unsolved
Search for dead transitions found 0 dead transitions in 60751ms
Starting structural reductions in LTL mode, iteration 1 : 1437/1490 places, 2475/2537 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63266 ms. Remains : 1437/1490 places, 2475/2537 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 9067 steps with 0 reset in 46 ms.
FORMULA DLCround-PT-06b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-06 finished in 63661 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(G(p0)))'
Support contains 2 out of 1490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Graph (trivial) has 1354 edges and 1490 vertex of which 407 / 1490 are part of one of the 32 SCC in 1 ms
Free SCC test removed 375 places
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 254 place count 1114 transition count 1879
Reduce places removed 253 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 286 rules applied. Total rules applied 540 place count 861 transition count 1846
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 562 place count 839 transition count 1846
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 562 place count 839 transition count 1740
Deduced a syphon composed of 106 places in 5 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 774 place count 733 transition count 1740
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 837 place count 670 transition count 1407
Iterating global reduction 3 with 63 rules applied. Total rules applied 900 place count 670 transition count 1407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 903 place count 670 transition count 1404
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 903 place count 670 transition count 1395
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 921 place count 661 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 924 place count 658 transition count 1371
Iterating global reduction 4 with 3 rules applied. Total rules applied 927 place count 658 transition count 1371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 930 place count 658 transition count 1368
Performed 243 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 243 places in 1 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 5 with 486 rules applied. Total rules applied 1416 place count 415 transition count 1118
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1423 place count 415 transition count 1111
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1440 place count 398 transition count 950
Iterating global reduction 6 with 17 rules applied. Total rules applied 1457 place count 398 transition count 950
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1473 place count 398 transition count 934
Performed 19 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 1511 place count 379 transition count 1081
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1515 place count 375 transition count 1017
Iterating global reduction 7 with 4 rules applied. Total rules applied 1519 place count 375 transition count 1017
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1550 place count 375 transition count 986
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 1586 place count 375 transition count 950
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1600 place count 361 transition count 922
Iterating global reduction 8 with 14 rules applied. Total rules applied 1614 place count 361 transition count 922
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1628 place count 347 transition count 776
Iterating global reduction 8 with 14 rules applied. Total rules applied 1642 place count 347 transition count 776
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1656 place count 347 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1657 place count 346 transition count 761
Applied a total of 1657 rules in 161 ms. Remains 346 /1490 variables (removed 1144) and now considering 761/2537 (removed 1776) transitions.
[2025-05-31 05:23:16] [INFO ] Flow matrix only has 734 transitions (discarded 27 similar events)
// Phase 1: matrix 734 rows 346 cols
[2025-05-31 05:23:16] [INFO ] Computed 109 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:16] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-05-31 05:23:16] [INFO ] Flow matrix only has 734 transitions (discarded 27 similar events)
[2025-05-31 05:23:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:16] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-31 05:23:16] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:23:16] [INFO ] Redundant transitions in 9 ms returned []
Running 701 sub problems to find dead transitions.
[2025-05-31 05:23:16] [INFO ] Flow matrix only has 734 transitions (discarded 27 similar events)
[2025-05-31 05:23:16] [INFO ] Invariant cache hit.
[2025-05-31 05:23:16] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (OVERLAPS) 1/346 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 733/1079 variables, 346/455 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 48/503 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1080 variables, and 503 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 346/346 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (OVERLAPS) 1/346 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 733/1079 variables, 346/455 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 48/503 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 701/1204 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1080 variables, and 1204 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 346/346 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Starting structural reductions in SI_LTL mode, iteration 1 : 346/1490 places, 761/2537 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61058 ms. Remains : 346/1490 places, 761/2537 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-07
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 5 ms.
FORMULA DLCround-PT-06b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-07 finished in 61137 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(p0))'
Support contains 1 out of 1490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Graph (trivial) has 1353 edges and 1490 vertex of which 407 / 1490 are part of one of the 32 SCC in 0 ms
Free SCC test removed 375 places
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 252 place count 1114 transition count 1881
Reduce places removed 251 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 284 rules applied. Total rules applied 536 place count 863 transition count 1848
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 558 place count 841 transition count 1848
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 558 place count 841 transition count 1741
Deduced a syphon composed of 107 places in 4 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 772 place count 734 transition count 1741
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 835 place count 671 transition count 1408
Iterating global reduction 3 with 63 rules applied. Total rules applied 898 place count 671 transition count 1408
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 901 place count 671 transition count 1405
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 901 place count 671 transition count 1396
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 919 place count 662 transition count 1396
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 922 place count 659 transition count 1372
Iterating global reduction 4 with 3 rules applied. Total rules applied 925 place count 659 transition count 1372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 928 place count 659 transition count 1369
Performed 245 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 245 places in 0 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 5 with 490 rules applied. Total rules applied 1418 place count 414 transition count 1117
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1425 place count 414 transition count 1110
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1442 place count 397 transition count 949
Iterating global reduction 6 with 17 rules applied. Total rules applied 1459 place count 397 transition count 949
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1475 place count 397 transition count 933
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1509 place count 380 transition count 1063
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1513 place count 376 transition count 1001
Iterating global reduction 7 with 4 rules applied. Total rules applied 1517 place count 376 transition count 1001
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1546 place count 376 transition count 972
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 1578 place count 376 transition count 940
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1592 place count 362 transition count 912
Iterating global reduction 8 with 14 rules applied. Total rules applied 1606 place count 362 transition count 912
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1620 place count 348 transition count 768
Iterating global reduction 8 with 14 rules applied. Total rules applied 1634 place count 348 transition count 768
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1648 place count 348 transition count 754
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1649 place count 347 transition count 753
Applied a total of 1649 rules in 144 ms. Remains 347 /1490 variables (removed 1143) and now considering 753/2537 (removed 1784) transitions.
[2025-05-31 05:24:17] [INFO ] Flow matrix only has 731 transitions (discarded 22 similar events)
// Phase 1: matrix 731 rows 347 cols
[2025-05-31 05:24:17] [INFO ] Computed 109 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:24:17] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-31 05:24:17] [INFO ] Flow matrix only has 731 transitions (discarded 22 similar events)
[2025-05-31 05:24:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:24:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-05-31 05:24:18] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:24:18] [INFO ] Redundant transitions in 6 ms returned []
Running 693 sub problems to find dead transitions.
[2025-05-31 05:24:18] [INFO ] Flow matrix only has 731 transitions (discarded 22 similar events)
[2025-05-31 05:24:18] [INFO ] Invariant cache hit.
[2025-05-31 05:24:18] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 730/1077 variables, 347/456 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1077 variables, 43/499 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1077/1078 variables, and 499 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 347/347 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 730/1077 variables, 347/456 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1077 variables, 43/499 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 693/1192 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1077/1078 variables, and 1192 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 347/347 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60309ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1490 places, 753/2537 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61102 ms. Remains : 347/1490 places, 753/2537 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-08 finished in 61156 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(G((G(p1)||p0))))'
Support contains 3 out of 1490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1468 transition count 2506
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1468 transition count 2506
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 1455 transition count 2493
Iterating global reduction 0 with 13 rules applied. Total rules applied 70 place count 1455 transition count 2493
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 1448 transition count 2486
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 1448 transition count 2486
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 1443 transition count 2481
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 1443 transition count 2481
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 1439 transition count 2477
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 1439 transition count 2477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 1437 transition count 2475
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 1437 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 1436 transition count 2474
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 1436 transition count 2474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 1435 transition count 2473
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 1435 transition count 2473
Applied a total of 110 rules in 373 ms. Remains 1435 /1490 variables (removed 55) and now considering 2473/2537 (removed 64) transitions.
// Phase 1: matrix 2473 rows 1435 cols
[2025-05-31 05:25:18] [INFO ] Computed 109 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:25:19] [INFO ] Implicit Places using invariants in 587 ms returned []
[2025-05-31 05:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:25:20] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
Running 2472 sub problems to find dead transitions.
[2025-05-31 05:25:20] [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 1434/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1435 constraints, PredecessorRefiner: 2472/2472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2472 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 1434/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1435 constraints, PredecessorRefiner: 0/2472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60681ms problems are : Problem set: 0 solved, 2472 unsolved
Search for dead transitions found 0 dead transitions in 60684ms
Starting structural reductions in LTL mode, iteration 1 : 1435/1490 places, 2473/2537 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63135 ms. Remains : 1435/1490 places, 2473/2537 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 201 steps with 0 reset in 5 ms.
FORMULA DLCround-PT-06b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-09 finished in 63316 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((G(p0)||X(X(X(F((G(p2)||p1))))))))'
Support contains 4 out of 1490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1468 transition count 2506
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1468 transition count 2506
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 1456 transition count 2494
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 1456 transition count 2494
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1450 transition count 2488
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1450 transition count 2488
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 1445 transition count 2483
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 1445 transition count 2483
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 1441 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 1441 transition count 2479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 1439 transition count 2477
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 1439 transition count 2477
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 1438 transition count 2476
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 1438 transition count 2476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 1437 transition count 2475
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 1437 transition count 2475
Applied a total of 106 rules in 388 ms. Remains 1437 /1490 variables (removed 53) and now considering 2475/2537 (removed 62) transitions.
// Phase 1: matrix 2475 rows 1437 cols
[2025-05-31 05:26:22] [INFO ] Computed 109 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:26:22] [INFO ] Implicit Places using invariants in 594 ms returned []
[2025-05-31 05:26:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:26:24] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
Running 2474 sub problems to find dead transitions.
[2025-05-31 05:26:24] [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 1436/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2474 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 2474/2474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2474 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 1436/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2474 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 0/2474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60682ms problems are : Problem set: 0 solved, 2474 unsolved
Search for dead transitions found 0 dead transitions in 60686ms
Starting structural reductions in LTL mode, iteration 1 : 1437/1490 places, 2475/2537 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63090 ms. Remains : 1437/1490 places, 2475/2537 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 323 ms.
Product exploration explored 100000 steps with 25000 reset in 340 ms.
Computed a total of 218 stabilizing places and 218 stable transitions
Computed a total of 218 stabilizing places and 218 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
[2025-05-31 05:27:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 209/213 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1224/1437 variables, 105/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1437 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2475/3912 variables, 1437/1546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3912 variables, 0/1546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3912 variables, 0/1546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3912/3912 variables, and 1546 constraints, problems are : Problem set: 1 solved, 1 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1437/1437 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 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: 1 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 213/3912 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 4/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 866ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (G (OR (NOT p0) p1 (NOT p2))), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F p2)]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[false, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[false, false, false, false]
Support contains 4 out of 1437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1437/1437 places, 2475/2475 transitions.
Applied a total of 0 rules in 43 ms. Remains 1437 /1437 variables (removed 0) and now considering 2475/2475 (removed 0) transitions.
[2025-05-31 05:27:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:27:28] [INFO ] Implicit Places using invariants in 569 ms returned []
[2025-05-31 05:27:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:27:29] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
Running 2474 sub problems to find dead transitions.
[2025-05-31 05:27:29] [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 1436/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2474 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 2474/2474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2474 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 1436/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2474 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 0/2474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60779ms problems are : Problem set: 0 solved, 2474 unsolved
Search for dead transitions found 0 dead transitions in 60784ms
Finished structural reductions in LTL mode , in 1 iterations and 62796 ms. Remains : 1437/1437 places, 2475/2475 transitions.
Computed a total of 218 stabilizing places and 218 stable transitions
Computed a total of 218 stabilizing places and 218 stable transitions
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[false, false, false, false]
RANDOM walk for 33752 steps (7 resets) in 176 ms. (190 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[false, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[false, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[false, false, false, false]
Product exploration explored 100000 steps with 25000 reset in 289 ms.
Product exploration explored 100000 steps with 25000 reset in 320 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 185 ms :[false, false, false, false]
Support contains 4 out of 1437 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1437/1437 places, 2475/2475 transitions.
Graph (trivial) has 1295 edges and 1437 vertex of which 360 / 1437 are part of one of the 32 SCC in 2 ms
Free SCC test removed 328 places
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1109 transition count 2123
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 261 place count 1109 transition count 2112
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 261 place count 1109 transition count 2117
Deduced a syphon composed of 259 places in 5 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 271 place count 1109 transition count 2117
Discarding 119 places :
Symmetric choice reduction at 2 with 119 rule applications. Total rules 390 place count 990 transition count 1737
Deduced a syphon composed of 185 places in 4 ms
Iterating global reduction 2 with 119 rules applied. Total rules applied 509 place count 990 transition count 1737
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 512 place count 990 transition count 1734
Performed 363 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 548 places in 1 ms
Iterating global reduction 3 with 363 rules applied. Total rules applied 875 place count 990 transition count 1741
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 883 place count 990 transition count 1733
Renaming transitions due to excessive name length > 1024 char.
Discarding 274 places :
Symmetric choice reduction at 4 with 274 rule applications. Total rules 1157 place count 716 transition count 1318
Deduced a syphon composed of 291 places in 1 ms
Iterating global reduction 4 with 274 rules applied. Total rules applied 1431 place count 716 transition count 1318
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1447 place count 716 transition count 1302
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1454 place count 709 transition count 1295
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1461 place count 709 transition count 1295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 285 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1462 place count 709 transition count 1295
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1464 place count 707 transition count 1293
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1466 place count 707 transition count 1293
Performed 33 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 316 places in 1 ms
Iterating global reduction 5 with 33 rules applied. Total rules applied 1499 place count 707 transition count 1538
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1516 place count 707 transition count 1521
Discarding 47 places :
Symmetric choice reduction at 6 with 47 rule applications. Total rules 1563 place count 660 transition count 1355
Deduced a syphon composed of 274 places in 1 ms
Iterating global reduction 6 with 47 rules applied. Total rules applied 1610 place count 660 transition count 1355
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1642 place count 660 transition count 1323
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1651 place count 651 transition count 1305
Deduced a syphon composed of 265 places in 1 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1660 place count 651 transition count 1305
Deduced a syphon composed of 265 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 1688 place count 651 transition count 1277
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1700 place count 639 transition count 1253
Deduced a syphon composed of 265 places in 0 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1712 place count 639 transition count 1253
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1724 place count 627 transition count 1131
Deduced a syphon composed of 265 places in 0 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1736 place count 627 transition count 1131
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1754 place count 627 transition count 1113
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1766 place count 615 transition count 1095
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 1778 place count 615 transition count 1095
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1779 place count 615 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1780 place count 614 transition count 1106
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1781 place count 614 transition count 1106
Deduced a syphon composed of 253 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1784 place count 614 transition count 1103
Deduced a syphon composed of 253 places in 0 ms
Applied a total of 1784 rules in 475 ms. Remains 614 /1437 variables (removed 823) and now considering 1103/2475 (removed 1372) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:28:32] [INFO ] Redundant transitions in 17 ms returned []
Running 1102 sub problems to find dead transitions.
[2025-05-31 05:28:32] [INFO ] Flow matrix only has 1074 transitions (discarded 29 similar events)
// Phase 1: matrix 1074 rows 614 cols
[2025-05-31 05:28:32] [INFO ] Computed 109 invariants in 19 ms
[2025-05-31 05:28:32] [INFO ] State equation strengthened by 138 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1102 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 1102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:01] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:01] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:02] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
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 614/1688 variables, and 112 constraints, problems are : Problem set: 1 solved, 1101 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 0/614 constraints, ReadFeed: 0/138 constraints, PredecessorRefiner: 1102/945 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1101 unsolved
At refinement iteration 1 (OVERLAPS) 2/614 variables, 109/109 constraints. Problems are: Problem set: 1 solved, 1101 unsolved
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 3/112 constraints. Problems are: Problem set: 116 solved, 986 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:15] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 5 ms to minimize.
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:15] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:15] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:15] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:15] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:15] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:15] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:15] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:15] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Problem TDEAD246 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:16] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:16] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD292 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:16] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD301 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:16] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Problem TDEAD307 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:16] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Problem TDEAD313 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:16] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:16] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Problem TDEAD323 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Problem TDEAD328 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD334 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/132 constraints. Problems are: Problem set: 200 solved, 902 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:20] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD345 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:20] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Problem TDEAD350 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:20] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD356 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Problem TDEAD361 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:20] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD366 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:20] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Problem TDEAD371 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD377 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Problem TDEAD382 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:20] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD388 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD393 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Problem TDEAD399 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD404 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD414 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD420 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Problem TDEAD425 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Problem TDEAD431 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD436 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD442 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:21] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 20/152 constraints. Problems are: Problem set: 220 solved, 882 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:25] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Problem TDEAD452 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:25] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD457 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Problem TDEAD463 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Problem TDEAD468 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:25] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD474 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD479 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD485 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD490 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD495 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Problem TDEAD500 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD504 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD509 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD515 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD520 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD526 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD531 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD536 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD541 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD547 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD452 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD552 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 20/172 constraints. Problems are: Problem set: 240 solved, 862 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:31] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD561 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD566 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD575 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD580 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD588 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD593 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD602 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD608 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD614 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD620 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD626 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD632 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD638 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:32] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD644 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD650 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD656 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD662 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD668 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD674 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
SMT process timed out in 60593ms, After SMT, problems are : Problem set: 259 solved, 843 unsolved
Search for dead transitions found 259 dead transitions in 60595ms
Found 259 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 259 transitions
Dead transitions reduction (with SMT) removed 259 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 614/1437 places, 844/2475 transitions.
Graph (complete) has 1514 edges and 614 vertex of which 388 are kept as prefixes of interest. Removing 226 places using SCC suffix rule.1 ms
Discarding 226 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 388 transition count 881
Deduced a syphon composed of 31 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 30 place count 388 transition count 856
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 388 transition count 893
Deduced a syphon composed of 35 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 58 place count 388 transition count 869
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 388 transition count 906
Deduced a syphon composed of 39 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 87 place count 388 transition count 881
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 91 place count 388 transition count 918
Deduced a syphon composed of 43 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 115 place count 388 transition count 894
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 119 place count 388 transition count 931
Deduced a syphon composed of 47 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 144 place count 388 transition count 906
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 148 place count 388 transition count 943
Deduced a syphon composed of 51 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 172 place count 388 transition count 919
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 176 place count 388 transition count 956
Deduced a syphon composed of 55 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 201 place count 388 transition count 931
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 205 place count 388 transition count 968
Deduced a syphon composed of 59 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 229 place count 388 transition count 944
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 233 place count 388 transition count 981
Deduced a syphon composed of 63 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 258 place count 388 transition count 956
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 262 place count 388 transition count 990
Deduced a syphon composed of 67 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 388 transition count 970
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 285 place count 388 transition count 1000
Deduced a syphon composed of 70 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 306 place count 388 transition count 979
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 309 place count 388 transition count 1010
Deduced a syphon composed of 73 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 330 place count 388 transition count 989
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 333 place count 388 transition count 1021
Deduced a syphon composed of 76 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 351 place count 388 transition count 1003
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 353 place count 388 transition count 1031
Deduced a syphon composed of 78 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 365 place count 388 transition count 1019
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 366 place count 388 transition count 1034
Deduced a syphon composed of 79 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 367 place count 388 transition count 1033
Deduced a syphon composed of 79 places in 1 ms
Applied a total of 367 rules in 344 ms. Remains 388 /614 variables (removed 226) and now considering 1033/844 (removed -189) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 388/1437 places, 1033/2475 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61445 ms. Remains : 388/1437 places, 1033/2475 transitions.
Built C files in :
/tmp/ltsmin6258559045152142377
[2025-05-31 05:29:33] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6258559045152142377
Running compilation step : cd /tmp/ltsmin6258559045152142377;'/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/ltsmin6258559045152142377;'/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/ltsmin6258559045152142377;'/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 1437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1437/1437 places, 2475/2475 transitions.
Applied a total of 0 rules in 38 ms. Remains 1437 /1437 variables (removed 0) and now considering 2475/2475 (removed 0) transitions.
// Phase 1: matrix 2475 rows 1437 cols
[2025-05-31 05:29:36] [INFO ] Computed 109 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:29:37] [INFO ] Implicit Places using invariants in 596 ms returned []
[2025-05-31 05:29:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:29:38] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
Running 2474 sub problems to find dead transitions.
[2025-05-31 05:29:38] [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 1436/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2474 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 2474/2474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2474 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 1436/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2474 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1437 constraints, PredecessorRefiner: 0/2474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60781ms problems are : Problem set: 0 solved, 2474 unsolved
Search for dead transitions found 0 dead transitions in 60786ms
Finished structural reductions in LTL mode , in 1 iterations and 62875 ms. Remains : 1437/1437 places, 2475/2475 transitions.
Built C files in :
/tmp/ltsmin274748476730928598
[2025-05-31 05:30:39] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin274748476730928598
Running compilation step : cd /tmp/ltsmin274748476730928598;'/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/ltsmin274748476730928598;'/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/ltsmin274748476730928598;'/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 05:30:42] [INFO ] Flatten gal took : 42 ms
[2025-05-31 05:30:42] [INFO ] Flatten gal took : 42 ms
[2025-05-31 05:30:42] [INFO ] Time to serialize gal into /tmp/LTL14225035333627362120.gal : 9 ms
[2025-05-31 05:30:42] [INFO ] Time to serialize properties into /tmp/LTL8241595637397274440.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/LTL14225035333627362120.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9595428433452205750.hoa' '-atoms' '/tmp/LTL8241595637397274440.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/LTL8241595637397274440.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9595428433452205750.hoa
Detected timeout of ITS tools.
[2025-05-31 05:30:58] [INFO ] Flatten gal took : 42 ms
[2025-05-31 05:30:58] [INFO ] Flatten gal took : 42 ms
[2025-05-31 05:30:58] [INFO ] Time to serialize gal into /tmp/LTL13697362763540092954.gal : 9 ms
[2025-05-31 05:30:58] [INFO ] Time to serialize properties into /tmp/LTL2437840377735040490.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/LTL13697362763540092954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2437840377735040490.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((p1185==0)||(p292==1))"))||(X(X(X(F(("((p2068==0)||(p1751==1))")||(G("((p292==0)&&(p1185==1))"))))))))))
Formula 0 simplified : G(F!"((p1185==0)||(p292==1))" & XXXG(!"((p2068==0)||(p1751==1))" & F!"((p292==0)&&(p1185==1))"))
Detected timeout of ITS tools.
[2025-05-31 05:31:13] [INFO ] Flatten gal took : 40 ms
[2025-05-31 05:31:13] [INFO ] Applying decomposition
[2025-05-31 05:31:13] [INFO ] Flatten gal took : 41 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/graph6671435272254728877.txt' '-o' '/tmp/graph6671435272254728877.bin' '-w' '/tmp/graph6671435272254728877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6671435272254728877.bin' '-l' '-1' '-v' '-w' '/tmp/graph6671435272254728877.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:31:13] [INFO ] Decomposing Gal with order
[2025-05-31 05:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:31:13] [INFO ] Removed a total of 2166 redundant transitions.
[2025-05-31 05:31:13] [INFO ] Flatten gal took : 83 ms
[2025-05-31 05:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 14 ms.
[2025-05-31 05:31:13] [INFO ] Time to serialize gal into /tmp/LTL13161991664440679097.gal : 15 ms
[2025-05-31 05:31:13] [INFO ] Time to serialize properties into /tmp/LTL18209451741591184819.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/LTL13161991664440679097.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18209451741591184819.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 : !((F((G("((i19.i1.i1.u297.p1185==0)||(i3.i0.i2.u59.p292==1))"))||(X(X(X(F(("((i10.u491.p2068==0)||(i13.u431.p1751==1))")||(G("((i3.i0....209
Formula 0 simplified : G(F!"((i19.i1.i1.u297.p1185==0)||(i3.i0.i2.u59.p292==1))" & XXXG(!"((i10.u491.p2068==0)||(i13.u431.p1751==1))" & F!"((i3.i0.i2.u59.p...193
Detected timeout of ITS tools.
Treatment of property DLCround-PT-06b-LTLCardinality-10 finished in 306923 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(G(p0)))))'
Support contains 2 out of 1490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1465 transition count 2503
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1465 transition count 2503
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 65 place count 1450 transition count 2488
Iterating global reduction 0 with 15 rules applied. Total rules applied 80 place count 1450 transition count 2488
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 1443 transition count 2481
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 1443 transition count 2481
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 1438 transition count 2476
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 1438 transition count 2476
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 1434 transition count 2472
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 1434 transition count 2472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 1432 transition count 2470
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 1430 transition count 2468
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 1430 transition count 2468
Applied a total of 120 rules in 405 ms. Remains 1430 /1490 variables (removed 60) and now considering 2468/2537 (removed 69) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2025-05-31 05:31:29] [INFO ] Computed 109 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:31:29] [INFO ] Implicit Places using invariants in 603 ms returned []
[2025-05-31 05:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:31:31] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
Running 2467 sub problems to find dead transitions.
[2025-05-31 05:31:31] [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 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 2467/2467 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2467 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 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 0/2467 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60799ms problems are : Problem set: 0 solved, 2467 unsolved
Search for dead transitions found 0 dead transitions in 60803ms
Starting structural reductions in LTL mode, iteration 1 : 1430/1490 places, 2468/2537 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63188 ms. Remains : 1430/1490 places, 2468/2537 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2556 steps with 0 reset in 11 ms.
FORMULA DLCround-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-11 finished in 63367 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 1490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Graph (trivial) has 1352 edges and 1490 vertex of which 407 / 1490 are part of one of the 32 SCC in 0 ms
Free SCC test removed 375 places
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 253 place count 1114 transition count 1880
Reduce places removed 252 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 285 rules applied. Total rules applied 538 place count 862 transition count 1847
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 560 place count 840 transition count 1847
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 560 place count 840 transition count 1741
Deduced a syphon composed of 106 places in 5 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 772 place count 734 transition count 1741
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 836 place count 670 transition count 1407
Iterating global reduction 3 with 64 rules applied. Total rules applied 900 place count 670 transition count 1407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 903 place count 670 transition count 1404
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 903 place count 670 transition count 1394
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 923 place count 660 transition count 1394
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 926 place count 657 transition count 1370
Iterating global reduction 4 with 3 rules applied. Total rules applied 929 place count 657 transition count 1370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 932 place count 657 transition count 1367
Performed 244 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 244 places in 0 ms
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 5 with 488 rules applied. Total rules applied 1420 place count 413 transition count 1116
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1427 place count 413 transition count 1109
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1444 place count 396 transition count 948
Iterating global reduction 6 with 17 rules applied. Total rules applied 1461 place count 396 transition count 948
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1477 place count 396 transition count 932
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1509 place count 380 transition count 1057
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1513 place count 376 transition count 995
Iterating global reduction 7 with 4 rules applied. Total rules applied 1517 place count 376 transition count 995
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1546 place count 376 transition count 966
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 1576 place count 376 transition count 936
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1590 place count 362 transition count 908
Iterating global reduction 8 with 14 rules applied. Total rules applied 1604 place count 362 transition count 908
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1618 place count 348 transition count 766
Iterating global reduction 8 with 14 rules applied. Total rules applied 1632 place count 348 transition count 766
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1646 place count 348 transition count 752
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1647 place count 347 transition count 751
Applied a total of 1647 rules in 192 ms. Remains 347 /1490 variables (removed 1143) and now considering 751/2537 (removed 1786) transitions.
[2025-05-31 05:32:32] [INFO ] Flow matrix only has 729 transitions (discarded 22 similar events)
// Phase 1: matrix 729 rows 347 cols
[2025-05-31 05:32:32] [INFO ] Computed 109 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:32:32] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-05-31 05:32:32] [INFO ] Flow matrix only has 729 transitions (discarded 22 similar events)
[2025-05-31 05:32:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:32:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 05:32:32] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:32:32] [INFO ] Redundant transitions in 7 ms returned []
Running 691 sub problems to find dead transitions.
[2025-05-31 05:32:32] [INFO ] Flow matrix only has 729 transitions (discarded 22 similar events)
[2025-05-31 05:32:32] [INFO ] Invariant cache hit.
[2025-05-31 05:32:32] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 728/1075 variables, 347/456 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1075 variables, 40/496 constraints. Problems are: Problem set: 0 solved, 691 unsolved
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 1075/1076 variables, and 496 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 347/347 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 728/1075 variables, 347/456 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1075 variables, 40/496 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1075 variables, 691/1187 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1075/1076 variables, and 1187 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 347/347 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60346ms
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1490 places, 751/2537 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61159 ms. Remains : 347/1490 places, 751/2537 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-12 finished in 61245 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((F(p0)&&(p0||F(G(p1))))))'
Support contains 3 out of 1490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1465 transition count 2503
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1465 transition count 2503
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 65 place count 1450 transition count 2488
Iterating global reduction 0 with 15 rules applied. Total rules applied 80 place count 1450 transition count 2488
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 1443 transition count 2481
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 1443 transition count 2481
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 1438 transition count 2476
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 1438 transition count 2476
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 1434 transition count 2472
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 1434 transition count 2472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 1432 transition count 2470
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 1430 transition count 2468
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 1430 transition count 2468
Applied a total of 120 rules in 367 ms. Remains 1430 /1490 variables (removed 60) and now considering 2468/2537 (removed 69) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2025-05-31 05:33:33] [INFO ] Computed 109 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:33:34] [INFO ] Implicit Places using invariants in 568 ms returned []
[2025-05-31 05:33:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:33:35] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
Running 2467 sub problems to find dead transitions.
[2025-05-31 05:33:35] [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 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 2467/2467 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2467 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 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 0/2467 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60678ms problems are : Problem set: 0 solved, 2467 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Starting structural reductions in LTL mode, iteration 1 : 1430/1490 places, 2468/2537 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62964 ms. Remains : 1430/1490 places, 2468/2537 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 370 ms.
Product exploration explored 100000 steps with 50000 reset in 408 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLCardinality-13 finished in 63964 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)&&G(p1)))))'
Support contains 4 out of 1490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1469 transition count 2507
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1469 transition count 2507
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 1456 transition count 2494
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 1456 transition count 2494
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1450 transition count 2488
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1450 transition count 2488
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 1446 transition count 2484
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 1446 transition count 2484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 1443 transition count 2481
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 1443 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 1442 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 1442 transition count 2480
Applied a total of 96 rules in 326 ms. Remains 1442 /1490 variables (removed 48) and now considering 2480/2537 (removed 57) transitions.
// Phase 1: matrix 2480 rows 1442 cols
[2025-05-31 05:34:37] [INFO ] Computed 109 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:34:38] [INFO ] Implicit Places using invariants in 621 ms returned []
[2025-05-31 05:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:34:39] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
Running 2479 sub problems to find dead transitions.
[2025-05-31 05:34:39] [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 1441/3922 variables, and 0 constraints, problems are : Problem set: 0 solved, 2479 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1442 constraints, PredecessorRefiner: 2479/2479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2479 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 1441/3922 variables, and 0 constraints, problems are : Problem set: 0 solved, 2479 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1442 constraints, PredecessorRefiner: 0/2479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60689ms problems are : Problem set: 0 solved, 2479 unsolved
Search for dead transitions found 0 dead transitions in 60693ms
Starting structural reductions in LTL mode, iteration 1 : 1442/1490 places, 2480/2537 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63028 ms. Remains : 1442/1490 places, 2480/2537 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-15 finished in 63247 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)&&G(p1)) U (X(X(p2)) U (p2 U p3))))'
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(X(X(p1)))) U (!p2 U (G(!p2)||(!p2&&G(p3))))))'
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((G(p0)||X(X(X(F((G(p2)||p1))))))))'
Found a Shortening insensitive property : DLCround-PT-06b-LTLCardinality-10
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 out of 1490 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1490/1490 places, 2537/2537 transitions.
Graph (trivial) has 1347 edges and 1490 vertex of which 374 / 1490 are part of one of the 32 SCC in 2 ms
Free SCC test removed 342 places
Ensure Unique test removed 366 transitions
Reduce isomorphic transitions removed 366 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 264 place count 1147 transition count 1907
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 296 rules applied. Total rules applied 560 place count 884 transition count 1874
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 583 place count 862 transition count 1873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 584 place count 861 transition count 1873
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 112 Pre rules applied. Total rules applied 584 place count 861 transition count 1761
Deduced a syphon composed of 112 places in 5 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 4 with 224 rules applied. Total rules applied 808 place count 749 transition count 1761
Discarding 56 places :
Symmetric choice reduction at 4 with 56 rule applications. Total rules 864 place count 693 transition count 1450
Iterating global reduction 4 with 56 rules applied. Total rules applied 920 place count 693 transition count 1450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 922 place count 693 transition count 1448
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 922 place count 693 transition count 1440
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 938 place count 685 transition count 1440
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 940 place count 683 transition count 1426
Iterating global reduction 5 with 2 rules applied. Total rules applied 942 place count 683 transition count 1426
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 944 place count 683 transition count 1424
Performed 255 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 255 places in 0 ms
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 6 with 510 rules applied. Total rules applied 1454 place count 428 transition count 1162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1462 place count 428 transition count 1154
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 1479 place count 411 transition count 993
Iterating global reduction 7 with 17 rules applied. Total rules applied 1496 place count 411 transition count 993
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1511 place count 411 transition count 978
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1515 place count 409 transition count 976
Performed 19 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1553 place count 390 transition count 1123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1555 place count 390 transition count 1121
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1560 place count 385 transition count 1045
Iterating global reduction 9 with 5 rules applied. Total rules applied 1565 place count 385 transition count 1045
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 1594 place count 385 transition count 1016
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1599 place count 385 transition count 1011
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1600 place count 384 transition count 1010
Applied a total of 1600 rules in 158 ms. Remains 384 /1490 variables (removed 1106) and now considering 1010/2537 (removed 1527) transitions.
[2025-05-31 05:35:41] [INFO ] Flow matrix only has 974 transitions (discarded 36 similar events)
// Phase 1: matrix 974 rows 384 cols
[2025-05-31 05:35:41] [INFO ] Computed 109 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:35:41] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-05-31 05:35:41] [INFO ] Flow matrix only has 974 transitions (discarded 36 similar events)
[2025-05-31 05:35:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:35:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 05:35:42] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 940 sub problems to find dead transitions.
[2025-05-31 05:35:42] [INFO ] Flow matrix only has 974 transitions (discarded 36 similar events)
[2025-05-31 05:35:42] [INFO ] Invariant cache hit.
[2025-05-31 05:35:42] [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/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 2 (OVERLAPS) 2/384 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 940 unsolved
SMT process timed out in 30425ms, After SMT, problems are : Problem set: 0 solved, 940 unsolved
Search for dead transitions found 0 dead transitions in 30428ms
Starting structural reductions in LI_LTL mode, iteration 1 : 384/1490 places, 1010/2537 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31218 ms. Remains : 384/1490 places, 1010/2537 transitions.
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-10
Product exploration explored 100000 steps with 23756 reset in 863 ms.
Product exploration explored 100000 steps with 23443 reset in 833 ms.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 655 ms. (60 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2025-05-31 05:36:15] [INFO ] Flow matrix only has 974 transitions (discarded 36 similar events)
[2025-05-31 05:36:15] [INFO ] Invariant cache hit.
[2025-05-31 05:36:15] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 284/315 variables, 96/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 879/1194 variables, 315/415 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1194 variables, 31/446 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1194 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 163/1357 variables, 69/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1357 variables, 9/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1357 variables, 26/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1357 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1357 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1357/1358 variables, and 550 constraints, problems are : Problem set: 1 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 384/384 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 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: 1 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 31/1358 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 4/109 constraints, State Equation: 0/384 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 321ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (G (OR (NOT p0) p1 (NOT p2))), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F p2)]
Knowledge based reduction with 3 factoid took 251 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[false, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[false, false, false, false]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1010/1010 transitions.
Applied a total of 0 rules in 7 ms. Remains 384 /384 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2025-05-31 05:36:15] [INFO ] Flow matrix only has 974 transitions (discarded 36 similar events)
[2025-05-31 05:36:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:36:16] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-31 05:36:16] [INFO ] Flow matrix only has 974 transitions (discarded 36 similar events)
[2025-05-31 05:36:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:36:16] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 05:36:16] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 940 sub problems to find dead transitions.
[2025-05-31 05:36:16] [INFO ] Flow matrix only has 974 transitions (discarded 36 similar events)
[2025-05-31 05:36:16] [INFO ] Invariant cache hit.
[2025-05-31 05:36:16] [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/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 2 (OVERLAPS) 2/384 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 940 unsolved
SMT process timed out in 30372ms, After SMT, problems are : Problem set: 0 solved, 940 unsolved
Search for dead transitions found 0 dead transitions in 30374ms
Finished structural reductions in LTL mode , in 1 iterations and 31029 ms. Remains : 384/384 places, 1010/1010 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[false, false, false, false]
RANDOM walk for 36945 steps (8 resets) in 354 ms. (104 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[false, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[false, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[false, false, false, false]
Product exploration explored 100000 steps with 23846 reset in 721 ms.
Product exploration explored 100000 steps with 23614 reset in 763 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 164 ms :[false, false, false, false]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1010/1010 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 384 transition count 985
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 37 place count 372 transition count 961
Iterating global reduction 0 with 12 rules applied. Total rules applied 49 place count 372 transition count 961
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 61 place count 360 transition count 837
Iterating global reduction 0 with 12 rules applied. Total rules applied 73 place count 360 transition count 837
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 85 place count 360 transition count 825
Applied a total of 85 rules in 57 ms. Remains 360 /384 variables (removed 24) and now considering 825/1010 (removed 185) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:36:49] [INFO ] Redundant transitions in 9 ms returned []
Running 767 sub problems to find dead transitions.
[2025-05-31 05:36:49] [INFO ] Flow matrix only has 801 transitions (discarded 24 similar events)
// Phase 1: matrix 801 rows 360 cols
[2025-05-31 05:36:49] [INFO ] Computed 109 invariants in 3 ms
[2025-05-31 05:36:49] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (OVERLAPS) 2/360 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (OVERLAPS) 800/1160 variables, 360/469 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1160 variables, 53/522 constraints. Problems are: Problem set: 0 solved, 767 unsolved
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 1160/1161 variables, and 522 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 360/360 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (OVERLAPS) 2/360 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (OVERLAPS) 800/1160 variables, 360/469 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1160 variables, 53/522 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1160 variables, 767/1289 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1160/1161 variables, and 1289 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 360/360 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in SI_LTL mode, iteration 1 : 360/384 places, 825/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60431 ms. Remains : 360/384 places, 825/1010 transitions.
Built C files in :
/tmp/ltsmin4459652777213264297
[2025-05-31 05:37:50] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4459652777213264297
Running compilation step : cd /tmp/ltsmin4459652777213264297;'/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'
Compilation finished in 1774 ms.
Running link step : cd /tmp/ltsmin4459652777213264297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin4459652777213264297;'/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' '--hoa' '/tmp/stateBased15012524377570418012.hoa' '--buchi-type=spotba'
LTSmin run took 5039 ms.
Treatment of property DLCround-PT-06b-LTLCardinality-10 finished in 135970 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-05-31 05:37:57] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3070920181401748661
[2025-05-31 05:37:57] [INFO ] Too many transitions (2537) to apply POR reductions. Disabling POR matrices.
[2025-05-31 05:37:57] [INFO ] Applying decomposition
[2025-05-31 05:37:57] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3070920181401748661
Running compilation step : cd /tmp/ltsmin3070920181401748661;'/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 05:37:57] [INFO ] Flatten gal took : 44 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/graph10791609018178279246.txt' '-o' '/tmp/graph10791609018178279246.bin' '-w' '/tmp/graph10791609018178279246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10791609018178279246.bin' '-l' '-1' '-v' '-w' '/tmp/graph10791609018178279246.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:37:57] [INFO ] Decomposing Gal with order
[2025-05-31 05:37:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:37:57] [INFO ] Removed a total of 2213 redundant transitions.
[2025-05-31 05:37:57] [INFO ] Flatten gal took : 82 ms
[2025-05-31 05:37:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 22 ms.
[2025-05-31 05:37:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality3194965976578375811.gal : 16 ms
[2025-05-31 05:37:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality4733603347022482389.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/LTLCardinality3194965976578375811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4733603347022482389.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 3 LTL properties
Checking formula 0 : !((((X("((i17.u567.p2326==0)||(i13.i0.i6.u441.p1703==1))"))&&(G("((i18.u330.p1255==0)||(i7.u176.p731==1))")))U((X(X("((i14.u258.p1013=...255
Formula 0 simplified : (X!"((i17.u567.p2326==0)||(i13.i0.i6.u441.p1703==1))" | F!"((i18.u330.p1255==0)||(i7.u176.p731==1))") R (XX!"((i14.u258.p1013==0)||(...246
Compilation finished in 5254 ms.
Running link step : cd /tmp/ltsmin3070920181401748661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3070920181401748661;'/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((LTLAPp0==true))&&[]((LTLAPp1==true))) U (X(X((LTLAPp2==true))) U ((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin run took 918 ms.
FORMULA DLCround-PT-06b-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3070920181401748661;'/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' '(((LTLAPp4==true) U X(X(X((LTLAPp5==true))))) U (!(LTLAPp6==true) U ([](!(LTLAPp6==true))||(!(LTLAPp6==true)&&[]((LTLAPp7==true))))))' '--buchi-type=spotba'
LTSmin run took 2324 ms.
FORMULA DLCround-PT-06b-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3070920181401748661;'/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' '<>(([]((LTLAPp8==true))||X(X(X(<>(([]((LTLAPp10==true))||(LTLAPp9==true))))))))' '--buchi-type=spotba'
LTSmin run took 797 ms.
FORMULA DLCround-PT-06b-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1761745 ms.

BK_STOP 1748669886718

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-06b"
export BK_EXAMINATION="LTLCardinality"
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-06b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860066900171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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