Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813700308.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 CANInsertWithFailure-PT-070, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813700308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 31M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 30M 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 CANInsertWithFailure-PT-070-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748821405766

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 23:43:28] [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-01 23:43:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 23:43:29] [INFO ] Load time of PNML (sax parser for PT used): 1346 ms
[2025-06-01 23:43:29] [INFO ] Transformed 10644 places.
[2025-06-01 23:43:30] [INFO ] Transformed 29820 transitions.
[2025-06-01 23:43:30] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 1888 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 10644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10643 transition count 29820
Applied a total of 1 rules in 4866 ms. Remains 10643 /10644 variables (removed 1) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2025-06-01 23:43:44] [INFO ] Computed 72 invariants in 7900 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:44:03] [INFO ] Implicit Places using invariants in 27208 ms returned []
Implicit Place search using SMT only with invariants took 27405 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2025-06-01 23:44:03] [INFO ] Invariant cache hit.
[2025-06-01 23:44:04] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 125021ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 125343ms
Starting structural reductions in LTL mode, iteration 1 : 10643/10644 places, 29820/29820 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157864 ms. Remains : 10643/10644 places, 29820/29820 transitions.
Support contains 40 out of 10643 places after structural reductions.
[2025-06-01 23:46:10] [INFO ] Flatten gal took : 1299 ms
[2025-06-01 23:46:11] [INFO ] Flatten gal took : 780 ms
[2025-06-01 23:46:13] [INFO ] Input system was already deterministic with 29820 transitions.
RANDOM walk for 40000 steps (20 resets) in 3616 ms. (11 steps per ms) remains 13/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
[2025-06-01 23:46:15] [INFO ] Invariant cache hit.
[2025-06-01 23:46:16] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10488/10507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10507/40463 variables, and 4 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10488/10507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:46:24] [INFO ] Deduced a trap composed of 5 places in 852 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:46:25] [INFO ] Deduced a trap composed of 5 places in 817 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:46:26] [INFO ] Deduced a trap composed of 5 places in 1029 ms of which 29 ms to minimize.
SMT process timed out in 10947ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 485 transitions
Trivial Post-agglo rules discarded 485 transitions
Performed 485 trivial Post agglomeration. Transition count delta: 485
Iterating post reduction 0 with 485 rules applied. Total rules applied 485 place count 10643 transition count 29335
Reduce places removed 485 places and 0 transitions.
Iterating post reduction 1 with 485 rules applied. Total rules applied 970 place count 10158 transition count 29335
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 970 place count 10158 transition count 29333
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 974 place count 10156 transition count 29333
Performed 4820 Post agglomeration using F-continuation condition.Transition count delta: 4820
Deduced a syphon composed of 4820 places in 60 ms
Reduce places removed 4820 places and 0 transitions.
Iterating global reduction 2 with 9640 rules applied. Total rules applied 10614 place count 5336 transition count 24513
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10618 place count 5336 transition count 24509
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 10622 place count 5332 transition count 24509
Partial Free-agglomeration rule applied 4967 times.
Drop transitions (Partial Free agglomeration) removed 4967 transitions
Iterating global reduction 3 with 4967 rules applied. Total rules applied 15589 place count 5332 transition count 24509
Partial Free-agglomeration rule applied 140 times.
Drop transitions (Partial Free agglomeration) removed 140 transitions
Iterating global reduction 3 with 140 rules applied. Total rules applied 15729 place count 5332 transition count 24509
Applied a total of 15729 rules in 14927 ms. Remains 5332 /10643 variables (removed 5311) and now considering 24509/29820 (removed 5311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14930 ms. Remains : 5332/10643 places, 24509/29820 transitions.
RANDOM walk for 40000 steps (92 resets) in 2116 ms. (18 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
[2025-06-01 23:46:42] [INFO ] Flow matrix only has 24503 transitions (discarded 6 similar events)
// Phase 1: matrix 24503 rows 5332 cols
[2025-06-01 23:46:44] [INFO ] Computed 72 invariants in 2000 ms
[2025-06-01 23:46:44] [INFO ] State equation strengthened by 24262 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5184/5196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:46:46] [INFO ] Deduced a trap composed of 2 places in 243 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5196 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 132/5328 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5328 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/5330 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5330 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 24503/29833 variables, 5330/5403 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29833 variables, 24262/29665 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 29833/29835 variables, and 29665 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45073 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5330/5332 constraints, ReadFeed: 24262/24262 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5184/5196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5196 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 132/5328 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5328 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/5330 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5330 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 24503/29833 variables, 5330/5403 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29833 variables, 24262/29665 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 29833/29835 variables, and 29671 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45098 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5330/5332 constraints, ReadFeed: 24262/24262 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92360ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 5332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5332/5332 places, 24509/24509 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 5329 transition count 24506
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 5329 transition count 24506
Applied a total of 10 rules in 5278 ms. Remains 5329 /5332 variables (removed 3) and now considering 24506/24509 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5282 ms. Remains : 5329/5332 places, 24506/24509 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p1||F(p2)||X(F((p1&&X(F(!p1))))))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2460 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2025-06-01 23:48:29] [INFO ] Computed 72 invariants in 6542 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:48:52] [INFO ] Implicit Places using invariants in 29180 ms returned []
Implicit Place search using SMT only with invariants took 29185 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2025-06-01 23:48:52] [INFO ] Invariant cache hit.
[2025-06-01 23:48:52] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30601 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 29750/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29750 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30491 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 153667ms problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 153782ms
Finished structural reductions in LTL mode , in 1 iterations and 185501 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 460 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-00
Stuttering criterion allowed to conclude after 1628 steps with 0 reset in 113 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-00 finished in 186264 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))) U (p1&&F(!p2)))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2789 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2025-06-01 23:51:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:51:52] [INFO ] Implicit Places using invariants in 22112 ms returned []
Implicit Place search using SMT only with invariants took 22116 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2025-06-01 23:51:52] [INFO ] Invariant cache hit.
[2025-06-01 23:51:52] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30514 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 29750/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29750 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30528 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 150416ms problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 150495ms
Finished structural reductions in LTL mode , in 1 iterations and 175473 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p0), p2, (NOT p0), true]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-01
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-01 finished in 175833 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(p1)||p0))&&F(p2)))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2571 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2025-06-01 23:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:54:47] [INFO ] Implicit Places using invariants in 21956 ms returned []
Implicit Place search using SMT only with invariants took 21959 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2025-06-01 23:54:47] [INFO ] Invariant cache hit.
[2025-06-01 23:54:48] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30527 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 29750/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29750 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 154215ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 154539ms
Finished structural reductions in LTL mode , in 1 iterations and 179109 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-02
Stuttering criterion allowed to conclude after 1673 steps with 0 reset in 60 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-02 finished in 179453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1))||G(p2))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2884 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2025-06-01 23:57:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:57:47] [INFO ] Implicit Places using invariants in 21906 ms returned []
Implicit Place search using SMT only with invariants took 21912 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2025-06-01 23:57:47] [INFO ] Invariant cache hit.
[2025-06-01 23:57:47] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30837 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 29750/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29750 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 153117ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 153174ms
Finished structural reductions in LTL mode , in 1 iterations and 178003 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-03
Product exploration explored 100000 steps with 58 reset in 2632 ms.
Product exploration explored 100000 steps with 59 reset in 2726 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 168 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 9 to 7
RANDOM walk for 40000 steps (21 resets) in 1296 ms. (30 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
[2025-06-02 00:00:27] [INFO ] Invariant cache hit.
[2025-06-02 00:00:27] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10498/10501 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:00:31] [INFO ] Deduced a trap composed of 5 places in 723 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:00:32] [INFO ] Deduced a trap composed of 5 places in 701 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:00:33] [INFO ] Deduced a trap composed of 5 places in 1049 ms of which 28 ms to minimize.
SMT process timed out in 6064ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 13 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 2 with 9656 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10637 place count 5325 transition count 24501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Partial Free-agglomeration rule applied 4971 times.
Drop transitions (Partial Free agglomeration) removed 4971 transitions
Iterating global reduction 3 with 4971 rules applied. Total rules applied 15609 place count 5324 transition count 24501
Applied a total of 15609 rules in 10662 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10663 ms. Remains : 5324/10643 places, 24501/29820 transitions.
RANDOM walk for 40000 steps (93 resets) in 2005 ms. (19 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
// Phase 1: matrix 24501 rows 5324 cols
[2025-06-02 00:00:46] [INFO ] Computed 72 invariants in 1798 ms
[2025-06-02 00:00:46] [INFO ] State equation strengthened by 24286 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:00:48] [INFO ] Deduced a trap composed of 2 places in 219 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/5320 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5320 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5322 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:01:07] [INFO ] Deduced a trap composed of 76 places in 17873 ms of which 798 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:01:24] [INFO ] Deduced a trap composed of 74 places in 16682 ms of which 771 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5322 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5322 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 29823/29825 variables, and 5397 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5322/5324 constraints, ReadFeed: 0/24286 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/5320 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5320 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5322 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5322 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:01:49] [INFO ] Deduced a trap composed of 76 places in 16199 ms of which 1118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:02:05] [INFO ] Deduced a trap composed of 74 places in 16111 ms of which 729 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:02:21] [INFO ] Deduced a trap composed of 76 places in 15525 ms of which 718 ms to minimize.
SMT process timed out in 96552ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1676 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1676 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 20 factoid took 491 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2599 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2025-06-02 00:02:32] [INFO ] Computed 72 invariants in 6259 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:02:55] [INFO ] Implicit Places using invariants in 29053 ms returned []
Implicit Place search using SMT only with invariants took 29060 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2025-06-02 00:02:55] [INFO ] Invariant cache hit.
[2025-06-02 00:02:55] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30512 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 29750/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29750 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30595 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 156274ms problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 156327ms
Finished structural reductions in LTL mode , in 1 iterations and 188018 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 167 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (21 resets) in 1226 ms. (32 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
[2025-06-02 00:05:33] [INFO ] Invariant cache hit.
[2025-06-02 00:05:33] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10499/10501 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:05:35] [INFO ] Deduced a trap composed of 5 places in 518 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:05:36] [INFO ] Deduced a trap composed of 5 places in 539 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:05:37] [INFO ] Deduced a trap composed of 5 places in 520 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:05:37] [INFO ] Deduced a trap composed of 5 places in 511 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:05:38] [INFO ] Deduced a trap composed of 5 places in 837 ms of which 29 ms to minimize.
SMT process timed out in 5815ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 14 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 2 with 9656 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10637 place count 5325 transition count 24501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Partial Free-agglomeration rule applied 4971 times.
Drop transitions (Partial Free agglomeration) removed 4971 transitions
Iterating global reduction 3 with 4971 rules applied. Total rules applied 15609 place count 5324 transition count 24501
Applied a total of 15609 rules in 11249 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11250 ms. Remains : 5324/10643 places, 24501/29820 transitions.
RANDOM walk for 40000 steps (93 resets) in 1902 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 60271 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 60271 steps, saw 51367 distinct states, run finished after 3010 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 24501 rows 5324 cols
[2025-06-02 00:05:55] [INFO ] Computed 72 invariants in 1976 ms
[2025-06-02 00:05:55] [INFO ] State equation strengthened by 24286 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:05:57] [INFO ] Deduced a trap composed of 2 places in 215 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 138/5320 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5320 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/5322 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:06:15] [INFO ] Deduced a trap composed of 76 places in 15924 ms of which 714 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:06:32] [INFO ] Deduced a trap composed of 74 places in 16668 ms of which 784 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:06:47] [INFO ] Deduced a trap composed of 76 places in 14888 ms of which 719 ms to minimize.
SMT process timed out in 53664ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 2091 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2091 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 2035 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2025-06-02 00:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:07:09] [INFO ] Implicit Places using invariants in 17680 ms returned []
Implicit Place search using SMT only with invariants took 17698 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2025-06-02 00:07:09] [INFO ] Invariant cache hit.
[2025-06-02 00:07:09] [INFO ] State equation strengthened by 24286 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 96383ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 96426ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116190 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0))), (F p1)]
Knowledge based reduction with 13 factoid took 478 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 222 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 58 reset in 2508 ms.
Product exploration explored 100000 steps with 58 reset in 2099 ms.
Applying partial POR strategy [true, false, true, false, true]
Stuttering acceptance computed with spot in 206 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 10643 transition count 29820
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 70 Pre rules applied. Total rules applied 350 place count 10643 transition count 29820
Deduced a syphon composed of 420 places in 11 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 420 place count 10643 transition count 29820
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 560 place count 10503 transition count 29680
Deduced a syphon composed of 280 places in 10 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 700 place count 10503 transition count 29680
Performed 4897 Post agglomeration using F-continuation condition.Transition count delta: -9514
Deduced a syphon composed of 5177 places in 12 ms
Iterating global reduction 1 with 4897 rules applied. Total rules applied 5597 place count 10503 transition count 39194
Discarding 280 places :
Symmetric choice reduction at 1 with 280 rule applications. Total rules 5877 place count 10223 transition count 38914
Deduced a syphon composed of 4897 places in 9 ms
Iterating global reduction 1 with 280 rules applied. Total rules applied 6157 place count 10223 transition count 38914
Deduced a syphon composed of 4897 places in 8 ms
Applied a total of 6157 rules in 19599 ms. Remains 10223 /10643 variables (removed 420) and now considering 38914/29820 (removed -9094) transitions.
Running 38844 sub problems to find dead transitions.
[2025-06-02 00:09:12] [INFO ] Flow matrix only has 34225 transitions (discarded 4689 similar events)
// Phase 1: matrix 34225 rows 10223 cols
[2025-06-02 00:09:21] [INFO ] Computed 72 invariants in 9007 ms
[2025-06-02 00:09:21] [INFO ] State equation strengthened by 14625 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 215992ms, After SMT, problems are : Problem set: 0 solved, 38844 unsolved
Search for dead transitions found 0 dead transitions in 216347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10223/10643 places, 38914/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236142 ms. Remains : 10223/10643 places, 38914/29820 transitions.
Built C files in :
/tmp/ltsmin1721748546053982676
[2025-06-02 00:12:49] [INFO ] Built C files in 427ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1721748546053982676
Running compilation step : cd /tmp/ltsmin1721748546053982676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1721748546053982676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1721748546053982676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 5067 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2025-06-02 00:13:04] [INFO ] Computed 72 invariants in 6997 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:13:28] [INFO ] Implicit Places using invariants in 30806 ms returned []
Implicit Place search using SMT only with invariants took 30810 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2025-06-02 00:13:28] [INFO ] Invariant cache hit.
[2025-06-02 00:13:28] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30457 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 29750/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29750 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30744 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 157305ms problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 157457ms
Finished structural reductions in LTL mode , in 1 iterations and 193479 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Built C files in :
/tmp/ltsmin13526341374036490404
[2025-06-02 00:16:06] [INFO ] Built C files in 296ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13526341374036490404
Running compilation step : cd /tmp/ltsmin13526341374036490404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13526341374036490404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13526341374036490404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 00:16:11] [INFO ] Flatten gal took : 1052 ms
[2025-06-02 00:16:11] [INFO ] Flatten gal took : 628 ms
[2025-06-02 00:16:12] [INFO ] Time to serialize gal into /tmp/LTL4571230117374557623.gal : 235 ms
[2025-06-02 00:16:12] [INFO ] Time to serialize properties into /tmp/LTL15443242479690680704.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/LTL4571230117374557623.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13616095640360521003.hoa' '-atoms' '/tmp/LTL15443242479690680704.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15443242479690680704.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13616095640360521003.hoa
Detected timeout of ITS tools.
[2025-06-02 00:16:28] [INFO ] Flatten gal took : 583 ms
[2025-06-02 00:16:28] [INFO ] Flatten gal took : 609 ms
[2025-06-02 00:16:28] [INFO ] Time to serialize gal into /tmp/LTL6675539298980899132.gal : 103 ms
[2025-06-02 00:16:28] [INFO ] Time to serialize properties into /tmp/LTL10770398059325496356.ltl : 4 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/LTL6675539298980899132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10770398059325496356.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((("(Node24GiveAnswer18<1)")||(X(G("((Node2GiveAnswer43>=1)||(Node61GiveAnswer5>=1))"))))||(G("(Node2GiveAnswer43<1)")))))
Formula 0 simplified : F(!"(Node24GiveAnswer18<1)" & XF!"((Node2GiveAnswer43>=1)||(Node61GiveAnswer5>=1))" & F!"(Node2GiveAnswer43<1)")
Detected timeout of ITS tools.
[2025-06-02 00:16:44] [INFO ] Flatten gal took : 572 ms
[2025-06-02 00:16:44] [INFO ] Applying decomposition
[2025-06-02 00:16:45] [INFO ] Flatten gal took : 587 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/graph4285375851329234527.txt' '-o' '/tmp/graph4285375851329234527.bin' '-w' '/tmp/graph4285375851329234527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4285375851329234527.bin' '-l' '-1' '-v' '-w' '/tmp/graph4285375851329234527.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:16:47] [INFO ] Decomposing Gal with order
[2025-06-02 00:16:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:16:53] [INFO ] Removed a total of 14730 redundant transitions.
[2025-06-02 00:16:53] [INFO ] Flatten gal took : 3546 ms
[2025-06-02 00:16:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 19670 labels/synchronizations in 3203 ms.
[2025-06-02 00:16:58] [INFO ] Time to serialize gal into /tmp/LTL14628440472464330540.gal : 245 ms
[2025-06-02 00:16:58] [INFO ] Time to serialize properties into /tmp/LTL8906187226984665480.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/LTL14628440472464330540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8906187226984665480.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((("(i19.u75.Node24GiveAnswer18<1)")||(X(G("((i44.u175.Node2GiveAnswer43>=1)||(i6.u23.Node61GiveAnswer5>=1))"))))||(G("(i44.u175.N...180
Formula 0 simplified : F(!"(i19.u75.Node24GiveAnswer18<1)" & XF!"((i44.u175.Node2GiveAnswer43>=1)||(i6.u23.Node61GiveAnswer5>=1))" & F!"(i44.u175.Node2Give...168
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-03 finished in 1190630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 19 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10640 place count 5323 transition count 24500
Applied a total of 10640 rules in 11916 ms. Remains 5323 /10643 variables (removed 5320) and now considering 24500/29820 (removed 5320) transitions.
[2025-06-02 00:17:24] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
// Phase 1: matrix 19808 rows 5323 cols
[2025-06-02 00:17:27] [INFO ] Computed 72 invariants in 2283 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:17:39] [INFO ] Implicit Places using invariants in 14147 ms returned []
Implicit Place search using SMT only with invariants took 14150 ms to find 0 implicit places.
Running 24430 sub problems to find dead transitions.
[2025-06-02 00:17:39] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2025-06-02 00:17:39] [INFO ] Invariant cache hit.
[2025-06-02 00:17:39] [INFO ] State equation strengthened by 14628 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5322 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24430 unsolved
SMT process timed out in 95253ms, After SMT, problems are : Problem set: 0 solved, 24430 unsolved
Search for dead transitions found 0 dead transitions in 95302ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5323/10643 places, 24500/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121415 ms. Remains : 5323/10643 places, 24500/29820 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-04
Stuttering criterion allowed to conclude after 553 steps with 1 reset in 66 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-04 finished in 121659 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(p1)||p0))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 976 place count 10155 transition count 29331
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 14 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 2 with 9656 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Applied a total of 10634 rules in 11596 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
[2025-06-02 00:19:26] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
// Phase 1: matrix 19812 rows 5326 cols
[2025-06-02 00:19:28] [INFO ] Computed 72 invariants in 2278 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:19:40] [INFO ] Implicit Places using invariants in 13920 ms returned []
Implicit Place search using SMT only with invariants took 13925 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2025-06-02 00:19:40] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
[2025-06-02 00:19:40] [INFO ] Invariant cache hit.
[2025-06-02 00:19:40] [INFO ] State equation strengthened by 14626 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 91896ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 91935ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5326/10643 places, 24503/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117484 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-05
Product exploration explored 100000 steps with 280 reset in 3086 ms.
Product exploration explored 100000 steps with 279 reset in 2831 ms.
Computed a total of 211 stabilizing places and 350 stable transitions
Computed a total of 211 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (112 resets) in 1992 ms. (20 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
[2025-06-02 00:21:19] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
[2025-06-02 00:21:19] [INFO ] Invariant cache hit.
[2025-06-02 00:21:19] [INFO ] State equation strengthened by 14626 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5183/5186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:20] [INFO ] Deduced a trap composed of 2 places in 355 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:21] [INFO ] Deduced a trap composed of 2 places in 329 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:21] [INFO ] Deduced a trap composed of 2 places in 348 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:22] [INFO ] Deduced a trap composed of 2 places in 302 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:22] [INFO ] Deduced a trap composed of 2 places in 402 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:23] [INFO ] Deduced a trap composed of 2 places in 329 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:23] [INFO ] Deduced a trap composed of 2 places in 335 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:24] [INFO ] Deduced a trap composed of 2 places in 333 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:24] [INFO ] Deduced a trap composed of 2 places in 260 ms of which 7 ms to minimize.
SMT process timed out in 5145ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5326 transition count 24501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5324 transition count 24501
Partial Free-agglomeration rule applied 4972 times.
Drop transitions (Partial Free agglomeration) removed 4972 transitions
Iterating global reduction 1 with 4972 rules applied. Total rules applied 4976 place count 5324 transition count 24501
Partial Free-agglomeration rule applied 70 times.
Drop transitions (Partial Free agglomeration) removed 70 transitions
Iterating global reduction 1 with 70 rules applied. Total rules applied 5046 place count 5324 transition count 24501
Applied a total of 5046 rules in 11588 ms. Remains 5324 /5326 variables (removed 2) and now considering 24501/24503 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11589 ms. Remains : 5324/5326 places, 24501/24503 transitions.
RANDOM walk for 40000 steps (93 resets) in 2016 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 64596 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 64596 steps, saw 52023 distinct states, run finished after 3010 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 24501 rows 5324 cols
[2025-06-02 00:21:41] [INFO ] Computed 72 invariants in 1743 ms
[2025-06-02 00:21:41] [INFO ] State equation strengthened by 24288 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:42] [INFO ] Deduced a trap composed of 2 places in 214 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:43] [INFO ] Deduced a trap composed of 2 places in 278 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:43] [INFO ] Deduced a trap composed of 2 places in 423 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:44] [INFO ] Deduced a trap composed of 2 places in 257 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:44] [INFO ] Deduced a trap composed of 2 places in 262 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:44] [INFO ] Deduced a trap composed of 2 places in 211 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:45] [INFO ] Deduced a trap composed of 2 places in 247 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:45] [INFO ] Deduced a trap composed of 2 places in 210 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:45] [INFO ] Deduced a trap composed of 2 places in 256 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:46] [INFO ] Deduced a trap composed of 2 places in 315 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:46] [INFO ] Deduced a trap composed of 2 places in 253 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:47] [INFO ] Deduced a trap composed of 2 places in 256 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:47] [INFO ] Deduced a trap composed of 2 places in 258 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:47] [INFO ] Deduced a trap composed of 2 places in 316 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:48] [INFO ] Deduced a trap composed of 2 places in 218 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:48] [INFO ] Deduced a trap composed of 2 places in 208 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:48] [INFO ] Deduced a trap composed of 2 places in 201 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:49] [INFO ] Deduced a trap composed of 2 places in 196 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:49] [INFO ] Deduced a trap composed of 2 places in 196 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:49] [INFO ] Deduced a trap composed of 2 places in 204 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5183 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:50] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:50] [INFO ] Deduced a trap composed of 2 places in 239 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:50] [INFO ] Deduced a trap composed of 2 places in 192 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:50] [INFO ] Deduced a trap composed of 2 places in 197 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:51] [INFO ] Deduced a trap composed of 2 places in 203 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:51] [INFO ] Deduced a trap composed of 2 places in 323 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:52] [INFO ] Deduced a trap composed of 2 places in 242 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:52] [INFO ] Deduced a trap composed of 2 places in 240 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:52] [INFO ] Deduced a trap composed of 2 places in 235 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:53] [INFO ] Deduced a trap composed of 2 places in 233 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:53] [INFO ] Deduced a trap composed of 2 places in 230 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:53] [INFO ] Deduced a trap composed of 2 places in 227 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:54] [INFO ] Deduced a trap composed of 2 places in 231 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:54] [INFO ] Deduced a trap composed of 2 places in 203 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:54] [INFO ] Deduced a trap composed of 2 places in 324 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:55] [INFO ] Deduced a trap composed of 2 places in 275 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:55] [INFO ] Deduced a trap composed of 2 places in 282 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:55] [INFO ] Deduced a trap composed of 2 places in 273 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:56] [INFO ] Deduced a trap composed of 2 places in 314 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:56] [INFO ] Deduced a trap composed of 2 places in 276 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/5183 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:57] [INFO ] Deduced a trap composed of 2 places in 314 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:57] [INFO ] Deduced a trap composed of 2 places in 307 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:58] [INFO ] Deduced a trap composed of 2 places in 217 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:58] [INFO ] Deduced a trap composed of 2 places in 222 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:58] [INFO ] Deduced a trap composed of 2 places in 238 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:59] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:59] [INFO ] Deduced a trap composed of 2 places in 314 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:21:59] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:00] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:00] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:00] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:00] [INFO ] Deduced a trap composed of 2 places in 187 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:01] [INFO ] Deduced a trap composed of 2 places in 227 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:01] [INFO ] Deduced a trap composed of 2 places in 302 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:02] [INFO ] Deduced a trap composed of 2 places in 300 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:02] [INFO ] Deduced a trap composed of 2 places in 261 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:02] [INFO ] Deduced a trap composed of 2 places in 257 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:03] [INFO ] Deduced a trap composed of 2 places in 283 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:03] [INFO ] Deduced a trap composed of 2 places in 255 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:04] [INFO ] Deduced a trap composed of 2 places in 273 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/5183 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:04] [INFO ] Deduced a trap composed of 2 places in 289 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:04] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:05] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:05] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:05] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:05] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:06] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:06] [INFO ] Deduced a trap composed of 2 places in 248 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:06] [INFO ] Deduced a trap composed of 2 places in 201 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/5183 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/5183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/5321 variables, 69/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5321 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:22] [INFO ] Deduced a trap composed of 76 places in 14660 ms of which 334 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:22:37] [INFO ] Deduced a trap composed of 74 places in 14184 ms of which 773 ms to minimize.
SMT process timed out in 57305ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 3225 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3226 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 2930 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2025-06-02 00:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:23:02] [INFO ] Implicit Places using invariants in 18953 ms returned []
Implicit Place search using SMT only with invariants took 18956 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2025-06-02 00:23:02] [INFO ] Invariant cache hit.
[2025-06-02 00:23:02] [INFO ] State equation strengthened by 24288 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 98092ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 98140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120055 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 219 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 3563 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2025-06-02 00:24:44] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
// Phase 1: matrix 19812 rows 5326 cols
[2025-06-02 00:24:46] [INFO ] Computed 72 invariants in 2165 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:24:57] [INFO ] Implicit Places using invariants in 13239 ms returned []
Implicit Place search using SMT only with invariants took 13243 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2025-06-02 00:24:57] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
[2025-06-02 00:24:57] [INFO ] Invariant cache hit.
[2025-06-02 00:24:57] [INFO ] State equation strengthened by 14626 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 93256ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 93310ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110155 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Computed a total of 211 stabilizing places and 350 stable transitions
Computed a total of 211 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (112 resets) in 1470 ms. (27 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2025-06-02 00:26:31] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
[2025-06-02 00:26:31] [INFO ] Invariant cache hit.
[2025-06-02 00:26:31] [INFO ] State equation strengthened by 14626 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5183/5186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:33] [INFO ] Deduced a trap composed of 2 places in 278 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:33] [INFO ] Deduced a trap composed of 2 places in 465 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:34] [INFO ] Deduced a trap composed of 2 places in 269 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:34] [INFO ] Deduced a trap composed of 2 places in 268 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:34] [INFO ] Deduced a trap composed of 2 places in 315 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:35] [INFO ] Deduced a trap composed of 2 places in 272 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:35] [INFO ] Deduced a trap composed of 2 places in 340 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:36] [INFO ] Deduced a trap composed of 2 places in 289 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:36] [INFO ] Deduced a trap composed of 2 places in 271 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:36] [INFO ] Deduced a trap composed of 2 places in 266 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:37] [INFO ] Deduced a trap composed of 2 places in 273 ms of which 6 ms to minimize.
SMT process timed out in 5360ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5326 transition count 24501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5324 transition count 24501
Partial Free-agglomeration rule applied 4972 times.
Drop transitions (Partial Free agglomeration) removed 4972 transitions
Iterating global reduction 1 with 4972 rules applied. Total rules applied 4976 place count 5324 transition count 24501
Partial Free-agglomeration rule applied 70 times.
Drop transitions (Partial Free agglomeration) removed 70 transitions
Iterating global reduction 1 with 70 rules applied. Total rules applied 5046 place count 5324 transition count 24501
Applied a total of 5046 rules in 12242 ms. Remains 5324 /5326 variables (removed 2) and now considering 24501/24503 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12243 ms. Remains : 5324/5326 places, 24501/24503 transitions.
RANDOM walk for 40000 steps (94 resets) in 2039 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 62895 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 1
Probabilistic random walk after 62895 steps, saw 51826 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 24501 rows 5324 cols
[2025-06-02 00:26:54] [INFO ] Computed 72 invariants in 1771 ms
[2025-06-02 00:26:54] [INFO ] State equation strengthened by 24288 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:56] [INFO ] Deduced a trap composed of 2 places in 353 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:56] [INFO ] Deduced a trap composed of 2 places in 351 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:57] [INFO ] Deduced a trap composed of 2 places in 308 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:57] [INFO ] Deduced a trap composed of 2 places in 300 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:58] [INFO ] Deduced a trap composed of 2 places in 308 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:58] [INFO ] Deduced a trap composed of 2 places in 298 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:59] [INFO ] Deduced a trap composed of 2 places in 306 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:59] [INFO ] Deduced a trap composed of 2 places in 295 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:26:59] [INFO ] Deduced a trap composed of 2 places in 345 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:00] [INFO ] Deduced a trap composed of 2 places in 297 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:00] [INFO ] Deduced a trap composed of 2 places in 340 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:01] [INFO ] Deduced a trap composed of 2 places in 353 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:01] [INFO ] Deduced a trap composed of 2 places in 332 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:02] [INFO ] Deduced a trap composed of 2 places in 200 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:02] [INFO ] Deduced a trap composed of 2 places in 265 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:02] [INFO ] Deduced a trap composed of 2 places in 292 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:03] [INFO ] Deduced a trap composed of 2 places in 288 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:03] [INFO ] Deduced a trap composed of 2 places in 283 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:04] [INFO ] Deduced a trap composed of 2 places in 292 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:04] [INFO ] Deduced a trap composed of 2 places in 286 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5183 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:04] [INFO ] Deduced a trap composed of 2 places in 323 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:05] [INFO ] Deduced a trap composed of 2 places in 285 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:05] [INFO ] Deduced a trap composed of 2 places in 288 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:06] [INFO ] Deduced a trap composed of 2 places in 325 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:06] [INFO ] Deduced a trap composed of 2 places in 288 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:07] [INFO ] Deduced a trap composed of 2 places in 291 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:07] [INFO ] Deduced a trap composed of 2 places in 285 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:07] [INFO ] Deduced a trap composed of 2 places in 283 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:08] [INFO ] Deduced a trap composed of 2 places in 327 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:08] [INFO ] Deduced a trap composed of 2 places in 322 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:09] [INFO ] Deduced a trap composed of 2 places in 315 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:09] [INFO ] Deduced a trap composed of 2 places in 315 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:10] [INFO ] Deduced a trap composed of 2 places in 318 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:10] [INFO ] Deduced a trap composed of 2 places in 275 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:11] [INFO ] Deduced a trap composed of 2 places in 273 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:11] [INFO ] Deduced a trap composed of 2 places in 226 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:11] [INFO ] Deduced a trap composed of 2 places in 222 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:12] [INFO ] Deduced a trap composed of 2 places in 222 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:12] [INFO ] Deduced a trap composed of 2 places in 279 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:12] [INFO ] Deduced a trap composed of 2 places in 220 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/5183 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:13] [INFO ] Deduced a trap composed of 2 places in 221 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:13] [INFO ] Deduced a trap composed of 2 places in 218 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:13] [INFO ] Deduced a trap composed of 2 places in 192 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:14] [INFO ] Deduced a trap composed of 2 places in 303 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:14] [INFO ] Deduced a trap composed of 2 places in 274 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:15] [INFO ] Deduced a trap composed of 2 places in 273 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:15] [INFO ] Deduced a trap composed of 2 places in 302 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:16] [INFO ] Deduced a trap composed of 2 places in 289 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:16] [INFO ] Deduced a trap composed of 2 places in 213 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:16] [INFO ] Deduced a trap composed of 2 places in 263 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:17] [INFO ] Deduced a trap composed of 2 places in 187 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:17] [INFO ] Deduced a trap composed of 2 places in 230 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:17] [INFO ] Deduced a trap composed of 2 places in 320 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:18] [INFO ] Deduced a trap composed of 2 places in 288 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:18] [INFO ] Deduced a trap composed of 2 places in 259 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:18] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:19] [INFO ] Deduced a trap composed of 2 places in 199 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:19] [INFO ] Deduced a trap composed of 2 places in 200 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:19] [INFO ] Deduced a trap composed of 2 places in 280 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:20] [INFO ] Deduced a trap composed of 2 places in 259 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/5183 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:20] [INFO ] Deduced a trap composed of 2 places in 245 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:21] [INFO ] Deduced a trap composed of 2 places in 192 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:21] [INFO ] Deduced a trap composed of 2 places in 195 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:21] [INFO ] Deduced a trap composed of 2 places in 195 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:21] [INFO ] Deduced a trap composed of 2 places in 191 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:22] [INFO ] Deduced a trap composed of 2 places in 298 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:22] [INFO ] Deduced a trap composed of 2 places in 253 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:23] [INFO ] Deduced a trap composed of 2 places in 260 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:23] [INFO ] Deduced a trap composed of 2 places in 241 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/5183 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/5183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/5321 variables, 69/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5321 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:39] [INFO ] Deduced a trap composed of 76 places in 14754 ms of which 218 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:27:54] [INFO ] Deduced a trap composed of 74 places in 15073 ms of which 804 ms to minimize.
SMT process timed out in 61673ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 3138 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3138 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 3013 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2025-06-02 00:28:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:28:20] [INFO ] Implicit Places using invariants in 19936 ms returned []
Implicit Place search using SMT only with invariants took 19940 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2025-06-02 00:28:20] [INFO ] Invariant cache hit.
[2025-06-02 00:28:20] [INFO ] State equation strengthened by 24288 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 94012ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 94063ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117080 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 281 reset in 2794 ms.
Product exploration explored 100000 steps with 280 reset in 2750 ms.
Built C files in :
/tmp/ltsmin6300648991251548402
[2025-06-02 00:30:00] [INFO ] Too many transitions (24503) to apply POR reductions. Disabling POR matrices.
[2025-06-02 00:30:01] [INFO ] Built C files in 325ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6300648991251548402
Running compilation step : cd /tmp/ltsmin6300648991251548402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6300648991251548402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6300648991251548402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 3130 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2025-06-02 00:30:07] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
// Phase 1: matrix 19812 rows 5326 cols
[2025-06-02 00:30:09] [INFO ] Computed 72 invariants in 2434 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:30:21] [INFO ] Implicit Places using invariants in 14262 ms returned []
Implicit Place search using SMT only with invariants took 14264 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2025-06-02 00:30:21] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
[2025-06-02 00:30:21] [INFO ] Invariant cache hit.
[2025-06-02 00:30:21] [INFO ] State equation strengthened by 14626 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 89730ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 89791ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107227 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Built C files in :
/tmp/ltsmin18274254065521413485
[2025-06-02 00:31:51] [INFO ] Too many transitions (24503) to apply POR reductions. Disabling POR matrices.
[2025-06-02 00:31:51] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18274254065521413485
Running compilation step : cd /tmp/ltsmin18274254065521413485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18274254065521413485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18274254065521413485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 00:31:57] [INFO ] Flatten gal took : 1259 ms
[2025-06-02 00:31:57] [INFO ] Flatten gal took : 529 ms
[2025-06-02 00:31:58] [INFO ] Time to serialize gal into /tmp/LTL11494086769552253412.gal : 349 ms
[2025-06-02 00:31:58] [INFO ] Time to serialize properties into /tmp/LTL3478888802012882974.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11494086769552253412.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10960584691535833424.hoa' '-atoms' '/tmp/LTL3478888802012882974.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3478888802012882974.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10960584691535833424.hoa
Detected timeout of ITS tools.
[2025-06-02 00:32:14] [INFO ] Flatten gal took : 480 ms
[2025-06-02 00:32:14] [INFO ] Flatten gal took : 475 ms
[2025-06-02 00:32:14] [INFO ] Time to serialize gal into /tmp/LTL4793821309489169877.gal : 87 ms
[2025-06-02 00:32:14] [INFO ] Time to serialize properties into /tmp/LTL16174381761032481114.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/LTL4793821309489169877.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16174381761032481114.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((Node32Request<1)||(Node69IsInserted<1))")||(G("(Node40GiveAnswer45<1)"))))))
Formula 0 simplified : G(F!"(Node40GiveAnswer45<1)" & FG!"((Node32Request<1)||(Node69IsInserted<1))")
Detected timeout of ITS tools.
[2025-06-02 00:32:30] [INFO ] Flatten gal took : 552 ms
[2025-06-02 00:32:30] [INFO ] Applying decomposition
[2025-06-02 00:32:30] [INFO ] Flatten gal took : 546 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/graph15476865862899024332.txt' '-o' '/tmp/graph15476865862899024332.bin' '-w' '/tmp/graph15476865862899024332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15476865862899024332.bin' '-l' '-1' '-v' '-w' '/tmp/graph15476865862899024332.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:32:32] [INFO ] Decomposing Gal with order
[2025-06-02 00:32:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:32:37] [INFO ] Removed a total of 19431 redundant transitions.
[2025-06-02 00:32:38] [INFO ] Flatten gal took : 4576 ms
[2025-06-02 00:32:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 14558 labels/synchronizations in 5432 ms.
[2025-06-02 00:32:44] [INFO ] Time to serialize gal into /tmp/LTL2943834045463913294.gal : 158 ms
[2025-06-02 00:32:44] [INFO ] Time to serialize properties into /tmp/LTL13255160637744267171.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2943834045463913294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13255160637744267171.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i33.u34.Node32Request<1)||(u71.Node69IsInserted<1))")||(G("(u47.Node40GiveAnswer45<1)"))))))
Formula 0 simplified : G(F!"(u47.Node40GiveAnswer45<1)" & FG!"((i33.u34.Node32Request<1)||(u71.Node69IsInserted<1))")
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-05 finished in 824562 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((F(G(p0)) U (p1&&(F(p2) U p3))))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 5094 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2025-06-02 00:33:11] [INFO ] Computed 72 invariants in 6742 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:33:33] [INFO ] Implicit Places using invariants in 28655 ms returned []
Implicit Place search using SMT only with invariants took 28667 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2025-06-02 00:33:33] [INFO ] Invariant cache hit.
[2025-06-02 00:33:33] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10642/40463 variables, and 70 constraints, problems are : Problem set: 0 solved, 29750 unsolved in 30435 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 29750/29750 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29750 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 161236ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 161286ms
Finished structural reductions in LTL mode , in 1 iterations and 195082 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-06
Stuttering criterion allowed to conclude after 1891 steps with 0 reset in 38 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-06 finished in 195626 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 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 486 rules applied. Total rules applied 486 place count 10643 transition count 29334
Reduce places removed 486 places and 0 transitions.
Iterating post reduction 1 with 486 rules applied. Total rules applied 972 place count 10157 transition count 29334
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 972 place count 10157 transition count 29332
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 12 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 2 with 9654 rules applied. Total rules applied 10630 place count 5328 transition count 24505
Applied a total of 10630 rules in 10482 ms. Remains 5328 /10643 variables (removed 5315) and now considering 24505/29820 (removed 5315) transitions.
[2025-06-02 00:36:25] [INFO ] Flow matrix only has 19814 transitions (discarded 4691 similar events)
// Phase 1: matrix 19814 rows 5328 cols
[2025-06-02 00:36:27] [INFO ] Computed 72 invariants in 2247 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:36:38] [INFO ] Implicit Places using invariants in 13481 ms returned []
Implicit Place search using SMT only with invariants took 13485 ms to find 0 implicit places.
Running 24435 sub problems to find dead transitions.
[2025-06-02 00:36:38] [INFO ] Flow matrix only has 19814 transitions (discarded 4691 similar events)
[2025-06-02 00:36:38] [INFO ] Invariant cache hit.
[2025-06-02 00:36:39] [INFO ] State equation strengthened by 14625 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5327 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24435 unsolved
SMT process timed out in 88830ms, After SMT, problems are : Problem set: 0 solved, 24435 unsolved
Search for dead transitions found 0 dead transitions in 88883ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5328/10643 places, 24505/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112882 ms. Remains : 5328/10643 places, 24505/29820 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-07
Stuttering criterion allowed to conclude after 367 steps with 0 reset in 10 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-07 finished in 112984 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(X(X(X(X(G((p0 U X(p0)))))))))))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 4198 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2025-06-02 00:38:18] [INFO ] Computed 72 invariants in 6872 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:38:41] [INFO ] Implicit Places using invariants in 28930 ms returned []
Implicit Place search using SMT only with invariants took 28934 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2025-06-02 00:38:41] [INFO ] Invariant cache hit.
[2025-06-02 00:38:41] [INFO ] State equation strengthened by 9730 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 148408ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 148458ms
Finished structural reductions in LTL mode , in 1 iterations and 181624 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 356 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-10
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-10 finished in 182069 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 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 15 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 15103 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2025-06-02 00:41:25] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
// Phase 1: matrix 19809 rows 5324 cols
[2025-06-02 00:41:27] [INFO ] Computed 72 invariants in 2043 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:41:37] [INFO ] Implicit Places using invariants in 12786 ms returned []
Implicit Place search using SMT only with invariants took 12788 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2025-06-02 00:41:37] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2025-06-02 00:41:37] [INFO ] Invariant cache hit.
[2025-06-02 00:41:37] [INFO ] State equation strengthened by 14628 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 98358ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 98404ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126324 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-12
Stuttering criterion allowed to conclude after 343 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-12 finished in 126450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(!p0 U (G(!p0)||(G(!p2)&&X(p3)&&p1)))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 4615 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-070"
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 CANInsertWithFailure-PT-070, 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 r030-smll-174853813700308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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