Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812200252.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 NoC3x3-PT-7A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812200252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 355K 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 NoC3x3-PT-7A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748844115928

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 06:01:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 06:01:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:01:57] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2025-06-02 06:01:57] [INFO ] Transformed 801 places.
[2025-06-02 06:01:57] [INFO ] Transformed 1544 transitions.
[2025-06-02 06:01:57] [INFO ] Found NUPN structural information;
[2025-06-02 06:01:57] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
FORMULA NoC3x3-PT-7A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Discarding 176 places :
Symmetric choice reduction at 0 with 176 rule applications. Total rules 176 place count 625 transition count 1183
Ensure Unique test removed 41 places
Iterating global reduction 0 with 217 rules applied. Total rules applied 393 place count 584 transition count 1183
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 430 place count 584 transition count 1146
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 449 place count 584 transition count 1127
Applied a total of 449 rules in 105 ms. Remains 584 /801 variables (removed 217) and now considering 1127/1437 (removed 310) transitions.
[2025-06-02 06:01:57] [INFO ] Flow matrix only has 1122 transitions (discarded 5 similar events)
// Phase 1: matrix 1122 rows 584 cols
[2025-06-02 06:01:57] [INFO ] Computed 70 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:58] [INFO ] Implicit Places using invariants in 382 ms returned [11, 80, 156, 218, 299, 379, 441, 495]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 414 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 576/801 places, 1127/1437 transitions.
Applied a total of 0 rules in 9 ms. Remains 576 /576 variables (removed 0) and now considering 1127/1127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 541 ms. Remains : 576/801 places, 1127/1437 transitions.
Support contains 41 out of 576 places after structural reductions.
[2025-06-02 06:01:58] [INFO ] Flatten gal took : 93 ms
[2025-06-02 06:01:58] [INFO ] Flatten gal took : 52 ms
[2025-06-02 06:01:58] [INFO ] Input system was already deterministic with 1127 transitions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (8 resets) in 1653 ms. (24 steps per ms) remains 3/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
[2025-06-02 06:01:59] [INFO ] Flow matrix only has 1122 transitions (discarded 5 similar events)
// Phase 1: matrix 1122 rows 576 cols
[2025-06-02 06:01:59] [INFO ] Computed 62 invariants in 6 ms
[2025-06-02 06:01:59] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 516/569 variables, 53/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 5 (OVERLAPS) 7/576 variables, 3/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1122/1698 variables, 576/638 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1698 variables, 16/654 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1698 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1698 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1698/1698 variables, and 654 constraints, problems are : Problem set: 1 solved, 2 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 576/576 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 532/569 variables, 55/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:00] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 1/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/576 variables, 3/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1122/1698 variables, 576/639 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1698 variables, 16/655 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1698 variables, 2/657 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1698 variables, 0/657 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1698 variables, 0/657 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1698/1698 variables, and 657 constraints, problems are : Problem set: 1 solved, 2 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 576/576 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1520ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 2 stabilizing places and 1 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' '!(X((F(G(p0))&&(X(p1)||G(p2)))))'
Support contains 4 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 569 transition count 1115
Ensure Unique test removed 3 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 17 place count 566 transition count 1115
Applied a total of 17 rules in 15 ms. Remains 566 /576 variables (removed 10) and now considering 1115/1127 (removed 12) transitions.
// Phase 1: matrix 1115 rows 566 cols
[2025-06-02 06:02:01] [INFO ] Computed 59 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:01] [INFO ] Implicit Places using invariants in 170 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/576 places, 1115/1127 transitions.
Applied a total of 0 rules in 11 ms. Remains 565 /565 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 204 ms. Remains : 565/576 places, 1115/1127 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 470 ms.
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 13 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-00 finished in 1137 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(p1)&&p0) U X(X(X(p2)))))'
Support contains 3 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 568 transition count 1114
Ensure Unique test removed 4 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 564 transition count 1114
Applied a total of 20 rules in 19 ms. Remains 564 /576 variables (removed 12) and now considering 1114/1127 (removed 13) transitions.
// Phase 1: matrix 1114 rows 564 cols
[2025-06-02 06:02:02] [INFO ] Computed 58 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:02] [INFO ] Implicit Places using invariants in 162 ms returned [530]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 563/576 places, 1114/1127 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 563/576 places, 1114/1127 transitions.
Stuttering acceptance computed with spot in 572 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-01 finished in 806 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))||G((p1||(X(X(F(!p0)))&&F(p2))))))'
Support contains 5 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 569 transition count 1116
Ensure Unique test removed 4 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 18 place count 565 transition count 1116
Applied a total of 18 rules in 16 ms. Remains 565 /576 variables (removed 11) and now considering 1116/1127 (removed 11) transitions.
[2025-06-02 06:02:03] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
// Phase 1: matrix 1115 rows 565 cols
[2025-06-02 06:02:03] [INFO ] Computed 58 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:03] [INFO ] Implicit Places using invariants in 136 ms returned [531]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 564/576 places, 1116/1127 transitions.
Applied a total of 0 rules in 8 ms. Remains 564 /564 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 564/576 places, 1116/1127 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND p0 (NOT p1)), (AND p1 p0), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-03
Product exploration explored 100000 steps with 51 reset in 430 ms.
Product exploration explored 100000 steps with 79 reset in 474 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (OR (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 148 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND p0 (NOT p1)), (AND p1 p0), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 559 ms. (71 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
[2025-06-02 06:02:05] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
// Phase 1: matrix 1115 rows 564 cols
[2025-06-02 06:02:05] [INFO ] Computed 57 invariants in 3 ms
[2025-06-02 06:02:05] [INFO ] State equation strengthened by 14 read => feed constraints.
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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 510/564 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1115/1679 variables, 564/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1679 variables, 14/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1679 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1679 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1679/1679 variables, and 635 constraints, problems are : Problem set: 0 solved, 3 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 564/564 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 510/564 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1115/1679 variables, 564/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1679 variables, 14/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1679 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1679 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1679 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1679/1679 variables, and 639 constraints, problems are : Problem set: 0 solved, 3 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 564/564 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1347ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 170 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=34 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (OR (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F p2), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 12 factoid took 431 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND p0 (NOT p1)), (AND p1 p0), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 188 ms :[(AND p0 (NOT p1)), (AND p1 p0), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Support contains 5 out of 564 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 1116/1116 transitions.
Applied a total of 0 rules in 6 ms. Remains 564 /564 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2025-06-02 06:02:07] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2025-06-02 06:02:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:07] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 06:02:07] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2025-06-02 06:02:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:02:07] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-02 06:02:07] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2025-06-02 06:02:07] [INFO ] Invariant cache hit.
[2025-06-02 06:02:07] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/1679 variables, and 57 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/1679 variables, and 57 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60343ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Finished structural reductions in LTL mode , in 1 iterations and 60919 ms. Remains : 564/564 places, 1116/1116 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (OR p1 (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (AND p1 (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 149 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND p0 (NOT p1)), (AND p1 p0), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 310 ms. (128 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
[2025-06-02 06:03:08] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2025-06-02 06:03:08] [INFO ] Invariant cache hit.
[2025-06-02 06:03:08] [INFO ] State equation strengthened by 14 read => feed constraints.
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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 510/564 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1115/1679 variables, 564/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1679 variables, 14/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1679 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1679 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1679/1679 variables, and 635 constraints, problems are : Problem set: 0 solved, 3 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 564/564 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 510/564 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1115/1679 variables, 564/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1679 variables, 14/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1679 variables, 3/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1679 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1679 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1679/1679 variables, and 640 constraints, problems are : Problem set: 0 solved, 3 unsolved in 966 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 564/564 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1370ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 176 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=35 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (OR p1 (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (AND p1 (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p0) p2))), (F p0)]
Knowledge based reduction with 12 factoid took 454 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND p0 (NOT p1)), (AND p1 p0), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 217 ms :[(AND p0 (NOT p1)), (AND p1 p0), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 195 ms :[(AND p0 (NOT p1)), (AND p1 p0), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 64 reset in 363 ms.
Product exploration explored 100000 steps with 70 reset in 402 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 213 ms :[(AND p0 (NOT p1)), (AND p1 p0), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Support contains 5 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 1116/1116 transitions.
Graph (trivial) has 705 edges and 564 vertex of which 98 / 564 are part of one of the 9 SCC in 8 ms
Free SCC test removed 89 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 475 transition count 905
Performed 151 Post agglomeration using F-continuation condition with reduction of 41 identical transitions.
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 1 with 151 rules applied. Total rules applied 164 place count 475 transition count 973
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 290 place count 475 transition count 847
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 323 place count 442 transition count 806
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 356 place count 442 transition count 806
Performed 30 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 386 place count 442 transition count 883
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 423 place count 442 transition count 846
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 465 place count 400 transition count 756
Deduced a syphon composed of 118 places in 1 ms
Iterating global reduction 3 with 42 rules applied. Total rules applied 507 place count 400 transition count 756
Deduced a syphon composed of 118 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 3 with 96 rules applied. Total rules applied 603 place count 400 transition count 660
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 606 place count 397 transition count 654
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 609 place count 397 transition count 654
Deduced a syphon composed of 115 places in 0 ms
Applied a total of 609 rules in 133 ms. Remains 397 /564 variables (removed 167) and now considering 654/1116 (removed 462) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:03:12] [INFO ] Redundant transitions in 37 ms returned []
Running 653 sub problems to find dead transitions.
[2025-06-02 06:03:12] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
// Phase 1: matrix 645 rows 397 cols
[2025-06-02 06:03:12] [INFO ] Computed 57 invariants in 2 ms
[2025-06-02 06:03:12] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:23] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:23] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:23] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:23] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:23] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:23] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:24] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD595 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 20/77 constraints. Problems are: Problem set: 72 solved, 581 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:25] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:26] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 3 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:26] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 20/97 constraints. Problems are: Problem set: 129 solved, 524 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Problem TDEAD151 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Problem TDEAD169 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Problem TDEAD170 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD204 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Problem TDEAD222 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:30] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Problem TDEAD238 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:32] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Problem TDEAD533 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 7/104 constraints. Problems are: Problem set: 136 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/104 constraints. Problems are: Problem set: 136 solved, 517 unsolved
At refinement iteration 6 (OVERLAPS) 644/1041 variables, 397/501 constraints. Problems are: Problem set: 136 solved, 517 unsolved
SMT process timed out in 30120ms, After SMT, problems are : Problem set: 136 solved, 517 unsolved
Search for dead transitions found 136 dead transitions in 30122ms
Found 136 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 136 transitions
Dead transitions reduction (with SMT) removed 136 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 397/564 places, 518/1116 transitions.
Graph (complete) has 1034 edges and 397 vertex of which 282 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.3 ms
Discarding 115 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 282 /397 variables (removed 115) and now considering 518/518 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 282/564 places, 518/1116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30315 ms. Remains : 282/564 places, 518/1116 transitions.
Built C files in :
/tmp/ltsmin11082124931669672155
[2025-06-02 06:03:42] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11082124931669672155
Running compilation step : cd /tmp/ltsmin11082124931669672155;'/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 1785 ms.
Running link step : cd /tmp/ltsmin11082124931669672155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11082124931669672155;'/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/stateBased6403038270131193080.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 564 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 564 /564 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2025-06-02 06:03:58] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
// Phase 1: matrix 1115 rows 564 cols
[2025-06-02 06:03:58] [INFO ] Computed 57 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:58] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 06:03:58] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2025-06-02 06:03:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:58] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:03:58] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-02 06:03:58] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2025-06-02 06:03:58] [INFO ] Invariant cache hit.
[2025-06-02 06:03:58] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/1679 variables, and 57 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/1679 variables, and 57 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Finished structural reductions in LTL mode , in 1 iterations and 60794 ms. Remains : 564/564 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin12696851908595759187
[2025-06-02 06:04:58] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12696851908595759187
Running compilation step : cd /tmp/ltsmin12696851908595759187;'/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 1724 ms.
Running link step : cd /tmp/ltsmin12696851908595759187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12696851908595759187;'/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/stateBased9068545714571733197.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 06:05:14] [INFO ] Flatten gal took : 38 ms
[2025-06-02 06:05:14] [INFO ] Flatten gal took : 39 ms
[2025-06-02 06:05:14] [INFO ] Time to serialize gal into /tmp/LTL9607545772159973836.gal : 7 ms
[2025-06-02 06:05:14] [INFO ] Time to serialize properties into /tmp/LTL17452359802443501855.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/LTL9607545772159973836.gal' '-t' 'CGAL' '-hoa' '/tmp/aut577966729186770073.hoa' '-atoms' '/tmp/LTL17452359802443501855.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL17452359802443501855.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut577966729186770073.hoa
Detected timeout of ITS tools.
[2025-06-02 06:05:29] [INFO ] Flatten gal took : 36 ms
[2025-06-02 06:05:29] [INFO ] Flatten gal took : 57 ms
[2025-06-02 06:05:29] [INFO ] Time to serialize gal into /tmp/LTL306346627640155535.gal : 7 ms
[2025-06-02 06:05:29] [INFO ] Time to serialize properties into /tmp/LTL11250062835467255952.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/LTL306346627640155535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11250062835467255952.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 : !(((G(F("((p639!=1)||(p669!=1))")))||(G(("(p155==0)")||((X(X(F("((p639!=1)||(p669!=1))"))))&&(F("((p486==1)&&(p554==1))")))))))
Formula 0 simplified : FG!"((p639!=1)||(p669!=1))" & F(!"(p155==0)" & (XXG!"((p639!=1)||(p669!=1))" | G!"((p486==1)&&(p554==1))"))
Detected timeout of ITS tools.
[2025-06-02 06:05:44] [INFO ] Flatten gal took : 29 ms
[2025-06-02 06:05:44] [INFO ] Applying decomposition
[2025-06-02 06:05:44] [INFO ] Flatten gal took : 28 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/graph9312603644050195140.txt' '-o' '/tmp/graph9312603644050195140.bin' '-w' '/tmp/graph9312603644050195140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9312603644050195140.bin' '-l' '-1' '-v' '-w' '/tmp/graph9312603644050195140.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:05:44] [INFO ] Decomposing Gal with order
[2025-06-02 06:05:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:05:44] [INFO ] Removed a total of 553 redundant transitions.
[2025-06-02 06:05:44] [INFO ] Flatten gal took : 93 ms
[2025-06-02 06:05:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 24 ms.
[2025-06-02 06:05:44] [INFO ] Time to serialize gal into /tmp/LTL7184828739990887351.gal : 11 ms
[2025-06-02 06:05:44] [INFO ] Time to serialize properties into /tmp/LTL6570372233922299269.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/LTL7184828739990887351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6570372233922299269.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...254
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i11.u101.p639!=1)||(i11.u99.p669!=1))")))||(G(("(i4.u28.p155==0)")||((X(X(F("((i11.u101.p639!=1)||(i11.u99.p669!=1))"))))&&...203
Formula 0 simplified : FG!"((i11.u101.p639!=1)||(i11.u99.p669!=1))" & F(!"(i4.u28.p155==0)" & (XXG!"((i11.u101.p639!=1)||(i11.u99.p669!=1))" | G!"((i9.u77....185
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
354 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.639,96352,1,0,168304,6356,6856,258033,978,26422,396345
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NoC3x3-PT-7A-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property NoC3x3-PT-7A-LTLFireability-03 finished in 225822 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(G((X(X(p0))||G(p1))))))'
Support contains 2 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 568 transition count 1114
Ensure Unique test removed 4 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 564 transition count 1114
Applied a total of 20 rules in 19 ms. Remains 564 /576 variables (removed 12) and now considering 1114/1127 (removed 13) transitions.
// Phase 1: matrix 1114 rows 564 cols
[2025-06-02 06:05:48] [INFO ] Computed 58 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:49] [INFO ] Implicit Places using invariants in 163 ms returned [530]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 164 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 563/576 places, 1114/1127 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 563/576 places, 1114/1127 transitions.
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-04 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(F(!p1)&&(p1||X(p1)))))))'
Support contains 3 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 568 transition count 1114
Ensure Unique test removed 4 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 564 transition count 1114
Applied a total of 20 rules in 18 ms. Remains 564 /576 variables (removed 12) and now considering 1114/1127 (removed 13) transitions.
[2025-06-02 06:05:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:49] [INFO ] Implicit Places using invariants in 146 ms returned [530]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 563/576 places, 1114/1127 transitions.
Applied a total of 0 rules in 10 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 563/576 places, 1114/1127 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, p1, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2423 steps with 0 reset in 21 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-05 finished in 471 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(((G(p0) U p1)||X(F((G(p2)||(p2&&F(!p3))))))))'
Support contains 7 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Graph (trivial) has 705 edges and 576 vertex of which 104 / 576 are part of one of the 9 SCC in 3 ms
Free SCC test removed 95 places
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 479 transition count 890
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 465 transition count 889
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 34 place count 460 transition count 882
Ensure Unique test removed 3 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 457 transition count 882
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 457 transition count 880
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 47 place count 455 transition count 879
Performed 146 Post agglomeration using F-continuation condition with reduction of 40 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 4 with 292 rules applied. Total rules applied 339 place count 309 transition count 693
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 4 with 84 rules applied. Total rules applied 423 place count 309 transition count 609
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 453 place count 294 transition count 588
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 464 place count 294 transition count 577
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 494 place count 279 transition count 585
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 499 place count 279 transition count 580
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 7 with 74 rules applied. Total rules applied 573 place count 279 transition count 506
Applied a total of 573 rules in 70 ms. Remains 279 /576 variables (removed 297) and now considering 506/1127 (removed 621) transitions.
[2025-06-02 06:05:50] [INFO ] Flow matrix only has 503 transitions (discarded 3 similar events)
// Phase 1: matrix 503 rows 279 cols
[2025-06-02 06:05:50] [INFO ] Computed 55 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:50] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 06:05:50] [INFO ] Flow matrix only has 503 transitions (discarded 3 similar events)
[2025-06-02 06:05:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:05:50] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:05:50] [INFO ] Redundant transitions in 150 ms returned [395, 401, 403, 404, 411, 419, 423, 425, 426, 428, 429, 435, 437, 439, 443, 445, 446]
Found 17 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 17 transitions
Redundant transitions reduction (with SMT) removed 17 transitions.
Running 452 sub problems to find dead transitions.
[2025-06-02 06:05:50] [INFO ] Flow matrix only has 486 transitions (discarded 3 similar events)
// Phase 1: matrix 486 rows 279 cols
[2025-06-02 06:05:50] [INFO ] Computed 55 invariants in 1 ms
[2025-06-02 06:05:50] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (OVERLAPS) 485/764 variables, 279/334 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 14/348 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/765 variables, and 348 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (OVERLAPS) 485/764 variables, 279/334 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 14/348 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 452/800 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:29] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:29] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 4/804 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:36] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/764 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 452 unsolved
((t0 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((t0 1timeout
)
(t1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/765 variables, and 805 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in SI_LTL mode, iteration 1 : 279/576 places, 489/1127 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 0 with 4 rules applied. Total rules applied 4 place count 279 transition count 485
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 275 transition count 485
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 2 with 6 rules applied. Total rules applied 14 place count 272 transition count 482
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 269 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 269 transition count 479
Applied a total of 23 rules in 23 ms. Remains 269 /279 variables (removed 10) and now considering 479/489 (removed 10) transitions.
[2025-06-02 06:06:50] [INFO ] Flow matrix only has 476 transitions (discarded 3 similar events)
// Phase 1: matrix 476 rows 269 cols
[2025-06-02 06:06:50] [INFO ] Computed 55 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:50] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 06:06:50] [INFO ] Flow matrix only has 476 transitions (discarded 3 similar events)
[2025-06-02 06:06:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:06:50] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 269/576 places, 479/1127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60952 ms. Remains : 269/576 places, 479/1127 transitions.
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p0)), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-07
Stuttering criterion allowed to conclude after 1123 steps with 342 reset in 14 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-07 finished in 61335 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)&&F(G(p1)))))'
Support contains 3 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Graph (trivial) has 710 edges and 576 vertex of which 106 / 576 are part of one of the 9 SCC in 2 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 477 transition count 885
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 463 transition count 884
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 36 place count 456 transition count 873
Ensure Unique test removed 4 places
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 452 transition count 873
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 452 transition count 869
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 55 place count 449 transition count 868
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 349 place count 302 transition count 679
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 430 place count 302 transition count 598
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 460 place count 287 transition count 577
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 471 place count 287 transition count 566
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 497 place count 274 transition count 574
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 501 place count 274 transition count 570
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 7 with 72 rules applied. Total rules applied 573 place count 274 transition count 498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 573 place count 274 transition count 497
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 575 place count 273 transition count 497
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 576 place count 273 transition count 496
Applied a total of 576 rules in 69 ms. Remains 273 /576 variables (removed 303) and now considering 496/1127 (removed 631) transitions.
[2025-06-02 06:06:51] [INFO ] Flow matrix only has 495 transitions (discarded 1 similar events)
// Phase 1: matrix 495 rows 273 cols
[2025-06-02 06:06:51] [INFO ] Computed 54 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:51] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 06:06:51] [INFO ] Flow matrix only has 495 transitions (discarded 1 similar events)
[2025-06-02 06:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:06:51] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:06:51] [INFO ] Redundant transitions in 131 ms returned [384, 390, 392, 393, 400, 406, 408, 412, 416, 418, 419, 421, 422, 428, 430, 432, 437, 439, 440]
Found 19 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
Running 442 sub problems to find dead transitions.
[2025-06-02 06:06:51] [INFO ] Flow matrix only has 476 transitions (discarded 1 similar events)
// Phase 1: matrix 476 rows 273 cols
[2025-06-02 06:06:51] [INFO ] Computed 54 invariants in 2 ms
[2025-06-02 06:06:51] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 475/748 variables, 273/327 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/748 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/748 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (OVERLAPS) 0/748 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/749 variables, and 341 constraints, problems are : Problem set: 0 solved, 442 unsolved in 27551 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 273/273 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 475/748 variables, 273/327 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/748 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/748 variables, 442/783 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:25] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 6/789 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/749 variables, and 789 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 273/273 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57610ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 57611ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/576 places, 477/1127 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 273 transition count 472
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 268 transition count 472
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 264 transition count 468
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 261 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 261 transition count 466
Applied a total of 26 rules in 20 ms. Remains 261 /273 variables (removed 12) and now considering 466/477 (removed 11) transitions.
[2025-06-02 06:07:49] [INFO ] Flow matrix only has 465 transitions (discarded 1 similar events)
// Phase 1: matrix 465 rows 261 cols
[2025-06-02 06:07:49] [INFO ] Computed 54 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:49] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 06:07:49] [INFO ] Flow matrix only has 465 transitions (discarded 1 similar events)
[2025-06-02 06:07:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:07:49] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 261/576 places, 466/1127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58483 ms. Remains : 261/576 places, 466/1127 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-08 finished in 58632 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 1 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Graph (trivial) has 712 edges and 576 vertex of which 106 / 576 are part of one of the 9 SCC in 2 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 477 transition count 885
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 463 transition count 884
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 37 place count 455 transition count 871
Ensure Unique test removed 4 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 49 place count 451 transition count 871
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 53 place count 451 transition count 867
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 57 place count 448 transition count 866
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 351 place count 301 transition count 677
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 432 place count 301 transition count 596
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 462 place count 286 transition count 575
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 473 place count 286 transition count 564
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 499 place count 273 transition count 572
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 503 place count 273 transition count 568
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 7 with 72 rules applied. Total rules applied 575 place count 273 transition count 496
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 575 place count 273 transition count 495
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 577 place count 272 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 578 place count 272 transition count 494
Applied a total of 578 rules in 72 ms. Remains 272 /576 variables (removed 304) and now considering 494/1127 (removed 633) transitions.
// Phase 1: matrix 494 rows 272 cols
[2025-06-02 06:07:50] [INFO ] Computed 54 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:50] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 06:07:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:07:50] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:07:50] [INFO ] Redundant transitions in 121 ms returned [382, 388, 390, 391, 398, 404, 406, 410, 414, 416, 417, 419, 420, 426, 428, 430, 435, 437, 438]
Found 19 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
Running 440 sub problems to find dead transitions.
// Phase 1: matrix 475 rows 272 cols
[2025-06-02 06:07:50] [INFO ] Computed 54 invariants in 6 ms
[2025-06-02 06:07:50] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (OVERLAPS) 474/746 variables, 272/326 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/746 variables, 14/340 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (OVERLAPS) 0/746 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 440 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/747 variables, and 340 constraints, problems are : Problem set: 0 solved, 440 unsolved in 26782 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 272/272 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (OVERLAPS) 474/746 variables, 272/326 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/746 variables, 14/340 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 440/780 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:22] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:23] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 3/783 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/747 variables, and 784 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 272/272 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56858ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 56859ms
Starting structural reductions in SI_LTL mode, iteration 1 : 272/576 places, 475/1127 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 272 transition count 470
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 267 transition count 470
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 262 transition count 465
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 260 transition count 465
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 260 transition count 463
Applied a total of 26 rules in 20 ms. Remains 260 /272 variables (removed 12) and now considering 463/475 (removed 12) transitions.
// Phase 1: matrix 463 rows 260 cols
[2025-06-02 06:08:47] [INFO ] Computed 54 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:08:47] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 06:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:08:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:08:47] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 260/576 places, 463/1127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57763 ms. Remains : 260/576 places, 463/1127 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-09
Stuttering criterion allowed to conclude after 327 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-09 finished in 57811 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 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 568 transition count 1114
Ensure Unique test removed 4 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 564 transition count 1114
Applied a total of 20 rules in 18 ms. Remains 564 /576 variables (removed 12) and now considering 1114/1127 (removed 13) transitions.
// Phase 1: matrix 1114 rows 564 cols
[2025-06-02 06:08:47] [INFO ] Computed 58 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:08:47] [INFO ] Implicit Places using invariants in 135 ms returned [530]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 563/576 places, 1114/1127 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 563/576 places, 1114/1127 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1052 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-11 finished in 343 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(p0)))'
Support contains 2 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 568 transition count 1114
Ensure Unique test removed 4 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 564 transition count 1114
Applied a total of 20 rules in 17 ms. Remains 564 /576 variables (removed 12) and now considering 1114/1127 (removed 13) transitions.
[2025-06-02 06:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:08:48] [INFO ] Implicit Places using invariants in 146 ms returned [530]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 563/576 places, 1114/1127 transitions.
Applied a total of 0 rules in 5 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 563/576 places, 1114/1127 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-12 finished in 276 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(G((F(X(((F(p2)||(p3 U p4))&&p1)))&&p0)))))'
Support contains 7 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Graph (trivial) has 702 edges and 576 vertex of which 105 / 576 are part of one of the 9 SCC in 2 ms
Free SCC test removed 96 places
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 480 transition count 891
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 469 transition count 890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 468 transition count 890
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 33 place count 460 transition count 877
Ensure Unique test removed 4 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 45 place count 456 transition count 877
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 49 place count 456 transition count 873
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 51 place count 454 transition count 873
Performed 145 Post agglomeration using F-continuation condition with reduction of 38 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 5 with 290 rules applied. Total rules applied 341 place count 309 transition count 690
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 5 with 83 rules applied. Total rules applied 424 place count 309 transition count 607
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 454 place count 294 transition count 586
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 465 place count 294 transition count 575
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 493 place count 280 transition count 583
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 498 place count 280 transition count 578
Drop transitions (Redundant composition of simpler transitions.) removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 8 with 66 rules applied. Total rules applied 564 place count 280 transition count 512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 564 place count 280 transition count 511
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 566 place count 279 transition count 511
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 567 place count 279 transition count 511
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 569 place count 279 transition count 509
Applied a total of 569 rules in 61 ms. Remains 279 /576 variables (removed 297) and now considering 509/1127 (removed 618) transitions.
[2025-06-02 06:08:48] [INFO ] Flow matrix only has 501 transitions (discarded 8 similar events)
// Phase 1: matrix 501 rows 279 cols
[2025-06-02 06:08:48] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:08:48] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 06:08:48] [INFO ] Flow matrix only has 501 transitions (discarded 8 similar events)
[2025-06-02 06:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:08:48] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-02 06:08:48] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:08:48] [INFO ] Redundant transitions in 4 ms returned []
Running 508 sub problems to find dead transitions.
[2025-06-02 06:08:48] [INFO ] Flow matrix only has 501 transitions (discarded 8 similar events)
[2025-06-02 06:08:48] [INFO ] Invariant cache hit.
[2025-06-02 06:08:48] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (OVERLAPS) 500/779 variables, 279/337 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 50/387 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 8 (OVERLAPS) 1/780 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 780/780 variables, and 388 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 279/279 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (OVERLAPS) 500/779 variables, 279/337 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 50/387 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 508/895 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/780 variables, and 896 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 279/279 constraints, ReadFeed: 50/51 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 279/576 places, 509/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60524 ms. Remains : 279/576 places, 509/1127 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p4))), (OR (NOT p1) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-13 finished in 60758 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 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Graph (trivial) has 715 edges and 576 vertex of which 106 / 576 are part of one of the 9 SCC in 0 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 477 transition count 885
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 463 transition count 884
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 36 place count 456 transition count 872
Ensure Unique test removed 3 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 453 transition count 872
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 50 place count 453 transition count 868
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 54 place count 450 transition count 867
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 348 place count 303 transition count 678
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 4 with 82 rules applied. Total rules applied 430 place count 303 transition count 596
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 460 place count 288 transition count 575
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 471 place count 288 transition count 564
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 499 place count 274 transition count 572
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 504 place count 274 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 575 place count 274 transition count 496
Applied a total of 575 rules in 45 ms. Remains 274 /576 variables (removed 302) and now considering 496/1127 (removed 631) transitions.
// Phase 1: matrix 496 rows 274 cols
[2025-06-02 06:09:49] [INFO ] Computed 55 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:09:49] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 06:09:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:09:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:09:49] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:09:49] [INFO ] Redundant transitions in 99 ms returned [386, 391, 398, 404, 406, 410, 414, 416, 417, 419, 420, 426, 428, 430, 435, 437, 438]
Found 17 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 17 transitions
Redundant transitions reduction (with SMT) removed 17 transitions.
Running 444 sub problems to find dead transitions.
// Phase 1: matrix 479 rows 274 cols
[2025-06-02 06:09:49] [INFO ] Computed 55 invariants in 1 ms
[2025-06-02 06:09:49] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (OVERLAPS) 478/752 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 14/343 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (OVERLAPS) 0/752 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 444 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/753 variables, and 343 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (OVERLAPS) 478/752 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 14/343 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 444/787 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:10:24] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:10:24] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:10:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:10:25] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:10:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:10:26] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:10:26] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 7/794 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 794 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/576 places, 479/1127 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 0 with 4 rules applied. Total rules applied 4 place count 274 transition count 475
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 270 transition count 475
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 266 transition count 471
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 264 transition count 471
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 264 transition count 469
Applied a total of 22 rules in 16 ms. Remains 264 /274 variables (removed 10) and now considering 469/479 (removed 10) transitions.
// Phase 1: matrix 469 rows 264 cols
[2025-06-02 06:10:49] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:10:49] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 06:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:10:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:10:49] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 264/576 places, 469/1127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60856 ms. Remains : 264/576 places, 469/1127 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-14
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-14 finished in 60899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 1127/1127 transitions.
Graph (trivial) has 710 edges and 576 vertex of which 105 / 576 are part of one of the 9 SCC in 0 ms
Free SCC test removed 96 places
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 478 transition count 889
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 464 transition count 888
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 37 place count 456 transition count 875
Ensure Unique test removed 4 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 49 place count 452 transition count 875
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 53 place count 452 transition count 871
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 57 place count 449 transition count 870
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 351 place count 302 transition count 681
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 432 place count 302 transition count 600
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 462 place count 287 transition count 579
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 473 place count 287 transition count 568
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 501 place count 273 transition count 576
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 506 place count 273 transition count 571
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 7 with 70 rules applied. Total rules applied 576 place count 273 transition count 501
Applied a total of 576 rules in 44 ms. Remains 273 /576 variables (removed 303) and now considering 501/1127 (removed 626) transitions.
// Phase 1: matrix 501 rows 273 cols
[2025-06-02 06:10:50] [INFO ] Computed 54 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:10:50] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 06:10:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:10:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:10:50] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:10:50] [INFO ] Redundant transitions in 100 ms returned [388, 394, 396, 397, 404, 410, 412, 416, 420, 422, 423, 425, 426, 434, 436, 440, 442, 443]
Found 18 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 18 transitions
Redundant transitions reduction (with SMT) removed 18 transitions.
Running 446 sub problems to find dead transitions.
// Phase 1: matrix 483 rows 273 cols
[2025-06-02 06:10:50] [INFO ] Computed 54 invariants in 0 ms
[2025-06-02 06:10:50] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 482/755 variables, 273/327 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/755 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (OVERLAPS) 0/755 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/756 variables, and 341 constraints, problems are : Problem set: 0 solved, 446 unsolved in 26877 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 273/273 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 482/755 variables, 273/327 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/755 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 446/787 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:11:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:11:25] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/755 variables, 2/789 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:11:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:11:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/755 variables, 2/791 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:11:36] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/756 variables, and 792 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 273/273 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56933ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 56934ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/576 places, 483/1127 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 273 transition count 478
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 268 transition count 478
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 264 transition count 474
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 262 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 262 transition count 472
Applied a total of 24 rules in 15 ms. Remains 262 /273 variables (removed 11) and now considering 472/483 (removed 11) transitions.
// Phase 1: matrix 472 rows 262 cols
[2025-06-02 06:11:47] [INFO ] Computed 54 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:11:47] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 06:11:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:11:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:11:47] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 262/576 places, 472/1127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57688 ms. Remains : 262/576 places, 472/1127 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-15 finished in 57823 ms.
All properties solved by simple procedures.
Total runtime 590709 ms.

BK_STOP 1748844707868

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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