About the Execution of ITS-Tools for JoinFreeModules-PT-5000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | ????F????F?T???? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422800483.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 JoinFreeModules-PT-5000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422800483
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M 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 JoinFreeModules-PT-5000-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-5000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748854823468
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-5000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 09:00:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 09:00:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:00:26] [INFO ] Load time of PNML (sax parser for PT used): 1055 ms
[2025-06-02 09:00:26] [INFO ] Transformed 25001 places.
[2025-06-02 09:00:26] [INFO ] Transformed 40001 transitions.
[2025-06-02 09:00:26] [INFO ] Parsed PT model containing 25001 places and 40001 transitions and 115002 arcs in 1312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-5000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 8693 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2025-06-02 09:00:36] [INFO ] Computed 5000 invariants in 257 ms
[2025-06-02 09:00:37] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20656 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20437 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 153633ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 153836ms
[2025-06-02 09:03:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:03:21] [INFO ] Implicit Places using invariants in 12232 ms returned []
Implicit Place search using SMT only with invariants took 12244 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:03:22] [INFO ] Invariant cache hit.
[2025-06-02 09:03:22] [INFO ] State equation strengthened by 5000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30337 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30342 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 172315ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 172387ms
Finished structural reductions in LTL mode , in 1 iterations and 347470 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Support contains 50 out of 25000 places after structural reductions.
[2025-06-02 09:06:15] [INFO ] Flatten gal took : 1123 ms
[2025-06-02 09:06:16] [INFO ] Flatten gal took : 789 ms
[2025-06-02 09:06:18] [INFO ] Input system was already deterministic with 40001 transitions.
RANDOM walk for 45019 steps (7 resets) in 11119 ms. (4 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1040 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1060 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1406 ms. (2 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1057 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1025 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1263 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1548 ms. (2 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1314 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1154 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1026 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1029 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1016 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1023 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1054 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1098 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1029 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1231 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1031 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1018 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1148 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1008 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1022 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1130 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1029 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1015 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1150 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1020 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1016 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1145 ms. (3 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1019 ms. (3 steps per ms) remains 30/30 properties
Probabilistic random walk after 82023 steps, saw 81970 distinct states, run finished after 40390 ms. (steps per millisecond=2 ) properties seen :6
[2025-06-02 09:07:12] [INFO ] Invariant cache hit.
[2025-06-02 09:07:13] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 168/210 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 336/546 variables, 210/252 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 42/294 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/546 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/65001 variables, and 294 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1423 ms.
Refiners :[Positive P Invariants (semi-flows): 42/5000 constraints, State Equation: 210/25000 constraints, ReadFeed: 42/5000 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 168/210 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:18] [INFO ] Deduced a trap composed of 3 places in 333 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:18] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:18] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:19] [INFO ] Deduced a trap composed of 3 places in 542 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:19] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:19] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:19] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:19] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:19] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:19] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:20] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 6 ms to minimize.
SMT process timed out in 7815ms, After SMT, problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 42 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 210 are kept as prefixes of interest. Removing 24790 places using SCC suffix rule.135 ms
Discarding 24790 places :
Also discarding 39664 output transitions
Drop transitions (Output transitions of discarded places.) removed 39664 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 336
Applied a total of 2 rules in 644 ms. Remains 210 /25000 variables (removed 24790) and now considering 336/40001 (removed 39665) transitions.
Running 252 sub problems to find dead transitions.
// Phase 1: matrix 336 rows 210 cols
[2025-06-02 09:07:21] [INFO ] Computed 42 invariants in 12 ms
[2025-06-02 09:07:21] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 42/210 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 336/546 variables, 210/252 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 42/294 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/546 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 294 constraints, problems are : Problem set: 0 solved, 252 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 210/210 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 42/210 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 336/546 variables, 210/252 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 42/294 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 252/546 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:45] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 5/551 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:08:00] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 553 constraints, problems are : Problem set: 0 solved, 252 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 210/210 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40164ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 40165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40817 ms. Remains : 210/25000 places, 336/40001 transitions.
Computed a total of 0 stabilizing places and 0 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' '!(G((X(X(X(p0)))||F(p1))))'
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 5022 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2025-06-02 09:08:19] [INFO ] Computed 5000 invariants in 147 ms
[2025-06-02 09:08:19] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20358 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20359 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 156313ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 156372ms
[2025-06-02 09:10:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:11:08] [INFO ] Implicit Places using invariants in 12712 ms returned []
Implicit Place search using SMT only with invariants took 12714 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:11:08] [INFO ] Invariant cache hit.
[2025-06-02 09:11:08] [INFO ] State equation strengthened by 5000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30320 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30343 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 166479ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 166527ms
Finished structural reductions in LTL mode , in 1 iterations and 340739 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 484 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLCardinality-00
Product exploration timeout after 6910 steps with 0 reset in 10011 ms.
Product exploration timeout after 6800 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 42520 steps (6 resets) in 16101 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (0 resets) in 15954 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (0 resets) in 15774 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (0 resets) in 16578 ms. (2 steps per ms) remains 3/3 properties
Probabilistic random walk after 85023 steps, saw 84970 distinct states, run finished after 51198 ms. (steps per millisecond=1 ) properties seen :1
[2025-06-02 09:15:32] [INFO ] Invariant cache hit.
[2025-06-02 09:15:32] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 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 09:15:33] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:33] [INFO ] Deduced a trap composed of 3 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 09:15:33] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/65001 variables, and 24 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1805 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5000 constraints, State Equation: 15/25000 constraints, ReadFeed: 3/5000 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/65001 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5000 constraints, State Equation: 15/25000 constraints, ReadFeed: 3/5000 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3464ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 5562 steps, including 0 resets, run visited all 2 properties in 2073 ms. (steps per millisecond=2 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 2156 ms.
Knowledge obtained : [(AND p1 p0), (X p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 2848 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:15:41] [INFO ] Invariant cache hit.
[2025-06-02 09:15:41] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20374 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20347 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160018ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 160068ms
[2025-06-02 09:18:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:18:35] [INFO ] Implicit Places using invariants in 13923 ms returned []
Implicit Place search using SMT only with invariants took 13926 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:18:35] [INFO ] Invariant cache hit.
[2025-06-02 09:18:35] [INFO ] State equation strengthened by 5000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30374 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30343 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 175279ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 175362ms
Finished structural reductions in LTL mode , in 1 iterations and 352351 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 42519 steps (6 resets) in 13492 ms. (3 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (0 resets) in 16712 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (0 resets) in 13421 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (0 resets) in 12917 ms. (3 steps per ms) remains 3/3 properties
Probabilistic random walk after 78018 steps, saw 77970 distinct states, run finished after 42339 ms. (steps per millisecond=1 ) properties seen :1
[2025-06-02 09:22:38] [INFO ] Invariant cache hit.
[2025-06-02 09:22:43] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 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 09:22:43] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:43] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:43] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/65001 variables, and 24 constraints, problems are : Problem set: 0 solved, 2 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5000 constraints, State Equation: 15/25000 constraints, ReadFeed: 3/5000 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/65001 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5000 constraints, State Equation: 15/25000 constraints, ReadFeed: 3/5000 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7511ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 5590 steps, including 0 resets, run visited all 2 properties in 2402 ms. (steps per millisecond=2 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 2423 ms.
Knowledge obtained : [(AND p1 p0), (X p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration timeout after 6940 steps with 0 reset in 10006 ms.
Product exploration timeout after 6350 steps with 0 reset in 10002 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 21188 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:23:31] [INFO ] Invariant cache hit.
[2025-06-02 09:23:31] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20377 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20385 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 164337ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 164384ms
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:26:15] [INFO ] Invariant cache hit.
[2025-06-02 09:26:15] [INFO ] State equation strengthened by 5000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30369 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30373 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 178038ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 178091ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 363742 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Built C files in :
/tmp/ltsmin8598769698947317292
[2025-06-02 09:29:14] [INFO ] Built C files in 461ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8598769698947317292
Running compilation step : cd /tmp/ltsmin8598769698947317292;'/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/ltsmin8598769698947317292;'/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/ltsmin8598769698947317292;'/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 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 3617 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:29:21] [INFO ] Invariant cache hit.
[2025-06-02 09:29:21] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20346 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20415 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 158026ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 158082ms
[2025-06-02 09:31:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:12] [INFO ] Implicit Places using invariants in 12951 ms returned []
Implicit Place search using SMT only with invariants took 12957 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:32:12] [INFO ] Invariant cache hit.
[2025-06-02 09:32:12] [INFO ] State equation strengthened by 5000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30370 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30349 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 184594ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 184644ms
Finished structural reductions in LTL mode , in 1 iterations and 359379 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Built C files in :
/tmp/ltsmin1330027715077961492
[2025-06-02 09:35:17] [INFO ] Built C files in 313ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1330027715077961492
Running compilation step : cd /tmp/ltsmin1330027715077961492;'/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/ltsmin1330027715077961492;'/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/ltsmin1330027715077961492;'/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 09:35:23] [INFO ] Flatten gal took : 1350 ms
[2025-06-02 09:35:24] [INFO ] Flatten gal took : 890 ms
[2025-06-02 09:35:24] [INFO ] Time to serialize gal into /tmp/LTL15146507025441335383.gal : 255 ms
[2025-06-02 09:35:24] [INFO ] Time to serialize properties into /tmp/LTL6531262992561813792.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/LTL15146507025441335383.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12425798892182744808.hoa' '-atoms' '/tmp/LTL6531262992561813792.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
Detected timeout of ITS tools.
[2025-06-02 09:35:41] [INFO ] Flatten gal took : 764 ms
[2025-06-02 09:35:41] [INFO ] Flatten gal took : 805 ms
[2025-06-02 09:35:42] [INFO ] Time to serialize gal into /tmp/LTL16484019705540644401.gal : 231 ms
[2025-06-02 09:35:42] [INFO ] Time to serialize properties into /tmp/LTL2642598880239614051.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16484019705540644401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2642598880239614051.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
Detected timeout of ITS tools.
[2025-06-02 09:35:57] [INFO ] Flatten gal took : 759 ms
[2025-06-02 09:35:57] [INFO ] Applying decomposition
[2025-06-02 09:35:58] [INFO ] Flatten gal took : 771 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/graph353720947427956719.txt' '-o' '/tmp/graph353720947427956719.bin' '-w' '/tmp/graph353720947427956719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph353720947427956719.bin' '-l' '-1' '-v' '-w' '/tmp/graph353720947427956719.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:36:01] [INFO ] Decomposing Gal with order
[2025-06-02 09:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:37:17] [INFO ] Flatten gal took : 1010 ms
[2025-06-02 09:37:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2140 ms.
[2025-06-02 09:37:20] [INFO ] Time to serialize gal into /tmp/LTL2857646859905723870.gal : 159 ms
[2025-06-02 09:37:20] [INFO ] Time to serialize properties into /tmp/LTL8250142706545175939.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/LTL2857646859905723870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8250142706545175939.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X(X(X("(gu351.p24844<=gu351.p1754)"))))||(F("(gu3480.p17398>=1)")))))
Formula 0 simplified : F(XXX!"(gu351.p24844<=gu351.p1754)" & G!"(gu3480.p17398>=1)")
Detected timeout of ITS tools.
Treatment of property JoinFreeModules-PT-5000-LTLCardinality-00 finished in 1761498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(p1))))'
Support contains 6 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 4623 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:37:40] [INFO ] Invariant cache hit.
[2025-06-02 09:37:40] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20339 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20351 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 157300ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 157354ms
[2025-06-02 09:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:40:31] [INFO ] Implicit Places using invariants in 13684 ms returned []
Implicit Place search using SMT only with invariants took 13690 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:40:31] [INFO ] Invariant cache hit.
[2025-06-02 09:40:31] [INFO ] State equation strengthened by 5000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30337 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30368 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 170360ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 170414ms
Finished structural reductions in LTL mode , in 1 iterations and 346169 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLCardinality-01
Product exploration timeout after 7230 steps with 0 reset in 10015 ms.
Product exploration timeout after 7000 steps with 0 reset in 10009 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1)]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 45019 steps (7 resets) in 11211 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (0 resets) in 12803 ms. (3 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (0 resets) in 13731 ms. (2 steps per ms) remains 2/2 properties
Probabilistic random walk after 71018 steps, saw 70983 distinct states, run finished after 31494 ms. (steps per millisecond=2 ) properties seen :0
[2025-06-02 09:44:32] [INFO ] Invariant cache hit.
[2025-06-02 09:44:34] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/65001 variables, and 42 constraints, problems are : Problem set: 0 solved, 2 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 6/5000 constraints, State Equation: 30/25000 constraints, ReadFeed: 6/5000 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 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 09:44:35] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:44:35] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:44:35] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:44:35] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/65001 variables, and 48 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3443 ms.
Refiners :[Positive P Invariants (semi-flows): 6/5000 constraints, State Equation: 30/25000 constraints, ReadFeed: 6/5000 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5840ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 88 steps, including 0 resets, run visited all 2 properties in 47 ms. (steps per millisecond=1 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 86 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 363 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Support contains 6 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 26317 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:45:05] [INFO ] Invariant cache hit.
[2025-06-02 09:45:05] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20403 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20354 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 158987ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 159035ms
[2025-06-02 09:47:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:47:57] [INFO ] Implicit Places using invariants in 13211 ms returned []
Implicit Place search using SMT only with invariants took 13217 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:47:57] [INFO ] Invariant cache hit.
[2025-06-02 09:47:57] [INFO ] State equation strengthened by 5000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30368 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30347 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 168634ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 168680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 367333 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 45019 steps (6 resets) in 10231 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (0 resets) in 13395 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (0 resets) in 15333 ms. (2 steps per ms) remains 2/2 properties
Probabilistic random walk after 77018 steps, saw 76972 distinct states, run finished after 32673 ms. (steps per millisecond=2 ) properties seen :0
[2025-06-02 09:51:38] [INFO ] Invariant cache hit.
[2025-06-02 09:51:38] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/65001 variables, and 42 constraints, problems are : Problem set: 0 solved, 2 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 6/5000 constraints, State Equation: 30/25000 constraints, ReadFeed: 6/5000 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 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 09:51:39] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:39] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:39] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:39] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/65001 variables, and 48 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2604 ms.
Refiners :[Positive P Invariants (semi-flows): 6/5000 constraints, State Equation: 30/25000 constraints, ReadFeed: 6/5000 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3723ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 41 steps, including 0 resets, run visited all 2 properties in 21 ms. (steps per millisecond=1 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 3 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 74 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Product exploration timeout after 6540 steps with 0 reset in 10011 ms.
Product exploration timeout after 6870 steps with 0 reset in 10013 ms.
Built C files in :
/tmp/ltsmin13349238690205682345
[2025-06-02 09:52:02] [INFO ] Too many transitions (40001) to apply POR reductions. Disabling POR matrices.
[2025-06-02 09:52:02] [INFO ] Built C files in 393ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13349238690205682345
Running compilation step : cd /tmp/ltsmin13349238690205682345;'/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/ltsmin13349238690205682345;'/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/ltsmin13349238690205682345;'/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 6 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 22738 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:52:28] [INFO ] Invariant cache hit.
[2025-06-02 09:52:28] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20341 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20355 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 161095ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 161145ms
[2025-06-02 09:55:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:55:23] [INFO ] Implicit Places using invariants in 13468 ms returned []
Implicit Place search using SMT only with invariants took 13472 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:55:23] [INFO ] Invariant cache hit.
[2025-06-02 09:55:23] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30308 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 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 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30381 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 169924ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 169968ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 367403 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Built C files in :
/tmp/ltsmin13077171996159316903
[2025-06-02 09:58:13] [INFO ] Too many transitions (40001) to apply POR reductions. Disabling POR matrices.
[2025-06-02 09:58:13] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13077171996159316903
Running compilation step : cd /tmp/ltsmin13077171996159316903;'/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/ltsmin13077171996159316903;'/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/ltsmin13077171996159316903;'/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 09:58:19] [INFO ] Flatten gal took : 1621 ms
[2025-06-02 09:58:20] [INFO ] Flatten gal took : 864 ms
[2025-06-02 09:58:20] [INFO ] Time to serialize gal into /tmp/LTL16205404733072499119.gal : 352 ms
[2025-06-02 09:58:20] [INFO ] Time to serialize properties into /tmp/LTL9734148835756976577.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/LTL16205404733072499119.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14070886929595867904.hoa' '-atoms' '/tmp/LTL9734148835756976577.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
Detected timeout of ITS tools.
[2025-06-02 09:58:36] [INFO ] Flatten gal took : 816 ms
[2025-06-02 09:58:37] [INFO ] Flatten gal took : 864 ms
[2025-06-02 09:58:37] [INFO ] Time to serialize gal into /tmp/LTL1070457741736088815.gal : 127 ms
[2025-06-02 09:58:37] [INFO ] Time to serialize properties into /tmp/LTL597964967886024246.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/LTL1070457741736088815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL597964967886024246.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Detected timeout of ITS tools.
[2025-06-02 09:58:53] [INFO ] Flatten gal took : 816 ms
[2025-06-02 09:58:53] [INFO ] Applying decomposition
[2025-06-02 09:58:54] [INFO ] Flatten gal took : 870 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/graph7291558503786341544.txt' '-o' '/tmp/graph7291558503786341544.bin' '-w' '/tmp/graph7291558503786341544.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7291558503786341544.bin' '-l' '-1' '-v' '-w' '/tmp/graph7291558503786341544.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:58:57] [INFO ] Decomposing Gal with order
[2025-06-02 09:59:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:00:07] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 10:00:07] [INFO ] Flatten gal took : 1017 ms
[2025-06-02 10:00:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4257 ms.
[2025-06-02 10:00:13] [INFO ] Time to serialize gal into /tmp/LTL13352123768444910577.gal : 137 ms
[2025-06-02 10:00:13] [INFO ] Time to serialize properties into /tmp/LTL9255723535671065235.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/LTL13352123768444910577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9255723535671065235.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 : !((X((F(G("((gu298.p1489>=3)&&(gu79.p5093>gu79.p396))")))U(G("((gu4367.p21830>=2)||(gu2116.p10574<=gu2116.p7487))")))))
Formula 0 simplified : X(GF!"((gu298.p1489>=3)&&(gu79.p5093>gu79.p396))" R F!"((gu4367.p21830>=2)||(gu2116.p10574<=gu2116.p7487))")
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-5000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-5000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422800483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-5000.tgz
mv JoinFreeModules-PT-5000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;