About the Execution of ITS-Tools for FunctionPointer-PT-a064
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 | FT?TTFFFTFFTTFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007300043.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 FunctionPointer-PT-a064, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007300043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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.1K 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 34K 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 FunctionPointer-PT-a064-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-a064-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748718145997
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 19:02:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 19:02:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 19:02:28] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2025-05-31 19:02:28] [INFO ] Transformed 40 places.
[2025-05-31 19:02:28] [INFO ] Transformed 70 transitions.
[2025-05-31 19:02:29] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-a064-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Applied a total of 0 rules in 18 ms. Remains 34 /34 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2025-05-31 19:02:29] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2025-05-31 19:02:29] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:29] [INFO ] Implicit Places using invariants in 300 ms returned []
[2025-05-31 19:02:29] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-05-31 19:02:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 19:02:29] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-05-31 19:02:29] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-05-31 19:02:29] [INFO ] Invariant cache hit.
[2025-05-31 19:02:29] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 46/79 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/80 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2279 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 46/79 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:02:33] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 1/80 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 60/111 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/80 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (OVERLAPS) 0/80 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 111 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6453ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6473ms
Finished structural reductions in LTL mode , in 1 iterations and 7082 ms. Remains : 34/34 places, 66/66 transitions.
Support contains 20 out of 34 places after structural reductions.
[2025-05-31 19:02:36] [INFO ] Flatten gal took : 32 ms
[2025-05-31 19:02:36] [INFO ] Flatten gal took : 15 ms
[2025-05-31 19:02:36] [INFO ] Input system was already deterministic with 66 transitions.
RANDOM walk for 40017 steps (104 resets) in 844 ms. (47 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40004 steps (74 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (25 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (67 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (203 resets) in 272 ms. (146 steps per ms) remains 4/4 properties
[2025-05-31 19:02:37] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-05-31 19:02:37] [INFO ] Invariant cache hit.
[2025-05-31 19:02:37] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 12/80 variables, and 3 constraints, problems are : Problem set: 4 solved, 0 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FunctionPointer-PT-a064-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 8 simplifications.
FORMULA FunctionPointer-PT-a064-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
FORMULA FunctionPointer-PT-a064-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 60
Applied a total of 7 rules in 41 ms. Remains 30 /34 variables (removed 4) and now considering 60/66 (removed 6) transitions.
[2025-05-31 19:02:37] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2025-05-31 19:02:37] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:37] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-31 19:02:37] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:02:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 19:02:38] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 19:02:38] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2025-05-31 19:02:38] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:02:38] [INFO ] Invariant cache hit.
[2025-05-31 19:02:38] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 43/73 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 58 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 40 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 43/73 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 58/98 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 98 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1773 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2851ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2852ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/34 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3096 ms. Remains : 30/34 places, 60/66 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a064-LTLCardinality-00
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-a064-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a064-LTLCardinality-00 finished in 3420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)||X(X(F(p1)))) U p2)))'
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 66
Applied a total of 2 rules in 2 ms. Remains 32 /34 variables (removed 2) and now considering 66/66 (removed 0) transitions.
[2025-05-31 19:02:41] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 32 cols
[2025-05-31 19:02:41] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:41] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-31 19:02:41] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-05-31 19:02:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 19:02:41] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-05-31 19:02:41] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-05-31 19:02:41] [INFO ] Invariant cache hit.
[2025-05-31 19:02:41] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 46/77 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/78 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1297 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 46/77 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 1/78 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 60/106 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/78 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 106 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3877ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3878ms
Starting structural reductions in LTL mode, iteration 1 : 32/34 places, 66/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4018 ms. Remains : 32/34 places, 66/66 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FunctionPointer-PT-a064-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 149 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 27 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-a064-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-a064-LTLCardinality-01 finished in 5019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 31 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 31 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 31 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 31 transition count 60
Applied a total of 7 rules in 15 ms. Remains 31 /34 variables (removed 3) and now considering 60/66 (removed 6) transitions.
[2025-05-31 19:02:46] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2025-05-31 19:02:46] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:46] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-31 19:02:46] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:02:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 19:02:46] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 19:02:46] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2025-05-31 19:02:46] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:02:46] [INFO ] Invariant cache hit.
[2025-05-31 19:02:46] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 43/74 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 42 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 43/74 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 58/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 100 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3357ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3358ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/34 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3557 ms. Remains : 31/34 places, 60/66 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a064-LTLCardinality-02
Product exploration explored 100000 steps with 2054 reset in 649 ms.
Product exploration explored 100000 steps with 2039 reset in 469 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 141 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1062 steps (1 resets) in 9 ms. (106 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2025-05-31 19:02:51] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:02:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-31 19:02:51] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:02:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:02:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 19:02:51] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 19:02:51] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2025-05-31 19:02:51] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:02:51] [INFO ] Invariant cache hit.
[2025-05-31 19:02:51] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 43/74 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 42 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 43/74 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 58/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 100 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3465ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3466ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3670 ms. Remains : 31/31 places, 60/60 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 141 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1412 steps (2 resets) in 10 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2054 reset in 164 ms.
Product exploration explored 100000 steps with 2060 reset in 308 ms.
Built C files in :
/tmp/ltsmin17861181248841584456
[2025-05-31 19:02:56] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2025-05-31 19:02:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 19:02:56] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2025-05-31 19:02:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 19:02:56] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2025-05-31 19:02:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 19:02:56] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17861181248841584456
Running compilation step : cd /tmp/ltsmin17861181248841584456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 593 ms.
Running link step : cd /tmp/ltsmin17861181248841584456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin17861181248841584456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5419924966375602817.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2025-05-31 19:03:11] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:03:11] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-31 19:03:11] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:03:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 19:03:11] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 19:03:11] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2025-05-31 19:03:11] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2025-05-31 19:03:11] [INFO ] Invariant cache hit.
[2025-05-31 19:03:11] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 43/74 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 42 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 43/74 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 58/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 100 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1718 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2743ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2744ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3004 ms. Remains : 31/31 places, 60/60 transitions.
Built C files in :
/tmp/ltsmin16342003038663090082
[2025-05-31 19:03:14] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2025-05-31 19:03:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 19:03:14] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2025-05-31 19:03:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 19:03:14] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2025-05-31 19:03:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 19:03:14] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16342003038663090082
Running compilation step : cd /tmp/ltsmin16342003038663090082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 338 ms.
Running link step : cd /tmp/ltsmin16342003038663090082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16342003038663090082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12578096603969307674.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 19:03:29] [INFO ] Flatten gal took : 17 ms
[2025-05-31 19:03:29] [INFO ] Flatten gal took : 11 ms
[2025-05-31 19:03:29] [INFO ] Time to serialize gal into /tmp/LTL8468489313666459031.gal : 5 ms
[2025-05-31 19:03:29] [INFO ] Time to serialize properties into /tmp/LTL8162588578931625390.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/LTL8468489313666459031.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15399639514818194930.hoa' '-atoms' '/tmp/LTL8162588578931625390.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8162588578931625390.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15399639514818194930.hoa
Detected timeout of ITS tools.
[2025-05-31 19:03:44] [INFO ] Flatten gal took : 6 ms
[2025-05-31 19:03:44] [INFO ] Flatten gal took : 6 ms
[2025-05-31 19:03:44] [INFO ] Time to serialize gal into /tmp/LTL14200632521808384117.gal : 2 ms
[2025-05-31 19:03:44] [INFO ] Time to serialize properties into /tmp/LTL11244104391478715866.ltl : 2 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/LTL14200632521808384117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11244104391478715866.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((l30>l19)||(s5<=l13))"))))
Formula 0 simplified : FG!"((l30>l19)||(s5<=l13))"
Detected timeout of ITS tools.
[2025-05-31 19:03:59] [INFO ] Flatten gal took : 6 ms
[2025-05-31 19:03:59] [INFO ] Applying decomposition
[2025-05-31 19:03:59] [INFO ] Flatten gal took : 5 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/graph2449934682289891844.txt' '-o' '/tmp/graph2449934682289891844.bin' '-w' '/tmp/graph2449934682289891844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2449934682289891844.bin' '-l' '-1' '-v' '-w' '/tmp/graph2449934682289891844.weights' '-q' '0' '-e' '0.001'
[2025-05-31 19:03:59] [INFO ] Decomposing Gal with order
[2025-05-31 19:03:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 19:03:59] [INFO ] Removed a total of 34 redundant transitions.
[2025-05-31 19:03:59] [INFO ] Flatten gal took : 65 ms
[2025-05-31 19:03:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 16 ms.
[2025-05-31 19:04:00] [INFO ] Time to serialize gal into /tmp/LTL10176884676306797350.gal : 4 ms
[2025-05-31 19:04:00] [INFO ] Time to serialize properties into /tmp/LTL3920461865370292177.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/LTL10176884676306797350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3920461865370292177.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu6.l30>gu6.l19)||(gu2.s5<=gu2.l13))"))))
Formula 0 simplified : FG!"((gu6.l30>gu6.l19)||(gu2.s5<=gu2.l13))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-a064-LTLCardinality-02 finished in 88895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0&&F(G(p1)))))))))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 7 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
[2025-05-31 19:04:15] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2025-05-31 19:04:15] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:04:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-31 19:04:15] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2025-05-31 19:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:04:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 19:04:15] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-31 19:04:15] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2025-05-31 19:04:15] [INFO ] Invariant cache hit.
[2025-05-31 19:04:15] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 44/74 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 40 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 44/74 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 60/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 100 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2209 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3372ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3373ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3508 ms. Remains : 30/34 places, 62/66 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-a064-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-a064-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a064-LTLCardinality-07 finished in 3888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(X(G(p0)))))))))'
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 2 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
[2025-05-31 19:04:18] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 31 cols
[2025-05-31 19:04:18] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:04:19] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-05-31 19:04:19] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-05-31 19:04:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:04:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 19:04:19] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-05-31 19:04:19] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-05-31 19:04:19] [INFO ] Invariant cache hit.
[2025-05-31 19:04:19] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 46/77 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/77 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 41 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 46/77 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 105 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2299 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3876ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3880ms
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 66/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4096 ms. Remains : 31/34 places, 66/66 transitions.
Stuttering acceptance computed with spot in 411 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a064-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-a064-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a064-LTLCardinality-10 finished in 4528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2025-05-31 19:04:23] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5837089466212395986
[2025-05-31 19:04:23] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2025-05-31 19:04:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 19:04:23] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2025-05-31 19:04:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 19:04:23] [INFO ] Applying decomposition
[2025-05-31 19:04:23] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2025-05-31 19:04:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 19:04:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5837089466212395986
Running compilation step : cd /tmp/ltsmin5837089466212395986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-31 19:04:23] [INFO ] Flatten gal took : 11 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/graph15817937144708604152.txt' '-o' '/tmp/graph15817937144708604152.bin' '-w' '/tmp/graph15817937144708604152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15817937144708604152.bin' '-l' '-1' '-v' '-w' '/tmp/graph15817937144708604152.weights' '-q' '0' '-e' '0.001'
[2025-05-31 19:04:23] [INFO ] Decomposing Gal with order
[2025-05-31 19:04:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 19:04:24] [INFO ] Removed a total of 43 redundant transitions.
[2025-05-31 19:04:24] [INFO ] Flatten gal took : 11 ms
[2025-05-31 19:04:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 3 ms.
[2025-05-31 19:04:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality9975698429349520408.gal : 1 ms
[2025-05-31 19:04:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality866415590260380241.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/LTLCardinality9975698429349520408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality866415590260380241.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...296
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu5.l30>gu5.l19)||(gu2.s5<=gu2.l13))"))))
Formula 0 simplified : FG!"((gu5.l30>gu5.l19)||(gu2.s5<=gu2.l13))"
Compilation finished in 379 ms.
Running link step : cd /tmp/ltsmin5837089466212395986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5837089466212395986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 67, guards 66
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 0.026: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.026: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.066: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.067: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.111: There are 69 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.111: State length is 35, there are 69 groups
pins2lts-mc-linux64( 0/ 8), 0.111: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.111: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.111: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.111: Visible groups: 0 / 69, labels: 1 / 69
pins2lts-mc-linux64( 0/ 8), 0.111: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.111: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.188: [Blue] ~120 levels ~960 states ~3048 transitions
pins2lts-mc-linux64( 3/ 8), 0.251: [Blue] ~240 levels ~1920 states ~7368 transitions
pins2lts-mc-linux64( 7/ 8), 0.354: [Blue] ~480 levels ~3840 states ~16624 transitions
pins2lts-mc-linux64( 7/ 8), 0.551: [Blue] ~960 levels ~7680 states ~33264 transitions
pins2lts-mc-linux64( 7/ 8), 0.850: [Blue] ~1920 levels ~15360 states ~66544 transitions
pins2lts-mc-linux64( 7/ 8), 1.397: [Blue] ~3840 levels ~30720 states ~133104 transitions
pins2lts-mc-linux64( 7/ 8), 2.319: [Blue] ~7680 levels ~61440 states ~266224 transitions
pins2lts-mc-linux64( 7/ 8), 3.392: [Blue] ~15360 levels ~122880 states ~532464 transitions
pins2lts-mc-linux64( 7/ 8), 4.641: [Blue] ~30720 levels ~245760 states ~1064944 transitions
pins2lts-mc-linux64( 3/ 8), 5.848: [Blue] ~54582 levels ~491520 states ~2266824 transitions
pins2lts-mc-linux64( 3/ 8), 7.872: [Blue] ~88715 levels ~983040 states ~3741384 transitions
pins2lts-mc-linux64( 3/ 8), 11.798: [Blue] ~156982 levels ~1966080 states ~6690504 transitions
pins2lts-mc-linux64( 3/ 8), 19.742: [Blue] ~293515 levels ~3932160 states ~12588744 transitions
pins2lts-mc-linux64( 3/ 8), 36.050: [Blue] ~566582 levels ~7864320 states ~24385224 transitions
pins2lts-mc-linux64( 3/ 8), 48.790: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 49.022:
pins2lts-mc-linux64( 0/ 8), 49.022: Explored 7435290 states 33832518 transitions, fanout: 4.550
pins2lts-mc-linux64( 0/ 8), 49.023: Total exploration time 48.900 sec (48.680 sec minimum, 48.746 sec on average)
pins2lts-mc-linux64( 0/ 8), 49.023: States per second: 152051, Transitions per second: 691872
pins2lts-mc-linux64( 0/ 8), 49.023:
pins2lts-mc-linux64( 0/ 8), 49.023: State space has 28813149 states, 6140 are accepting
pins2lts-mc-linux64( 0/ 8), 49.023: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 49.023: blue states: 7435290 (25.81%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 49.023: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 49.023: all-red states: 6140 (0.02%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 49.023:
pins2lts-mc-linux64( 0/ 8), 49.023: Total memory used for local state coloring: 105.2MB
pins2lts-mc-linux64( 0/ 8), 49.023:
pins2lts-mc-linux64( 0/ 8), 49.023: Queue width: 8B, total height: 6896424, memory: 52.62MB
pins2lts-mc-linux64( 0/ 8), 49.023: Tree memory: 475.8MB, 17.3 B/state, compr.: 12.2%
pins2lts-mc-linux64( 0/ 8), 49.023: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 49.023: Stored 66 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 49.023: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 49.023: Est. total memory use: 528.4MB (~1076.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5837089466212395986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5837089466212395986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-31 19:25:02] [INFO ] Flatten gal took : 7 ms
[2025-05-31 19:25:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality12080147620157036243.gal : 2 ms
[2025-05-31 19:25:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality1559459542566198526.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/LTLCardinality12080147620157036243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1559459542566198526.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...298
Read 1 LTL properties
Checking formula 0 : !((G(F("((l30>l19)||(s5<=l13))"))))
Formula 0 simplified : FG!"((l30>l19)||(s5<=l13))"
Detected timeout of ITS tools.
[2025-05-31 19:45:41] [INFO ] Flatten gal took : 6 ms
[2025-05-31 19:45:41] [INFO ] Input system was already deterministic with 66 transitions.
[2025-05-31 19:45:41] [INFO ] Transformed 34 places.
[2025-05-31 19:45:41] [INFO ] Transformed 66 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-31 19:45:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality11738591733081540563.gal : 1 ms
[2025-05-31 19:45:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality12897497760168507662.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/LTLCardinality11738591733081540563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12897497760168507662.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((l30>l19)||(s5<=l13))"))))
Formula 0 simplified : FG!"((l30>l19)||(s5<=l13))"
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="FunctionPointer-PT-a064"
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 FunctionPointer-PT-a064, 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 r100-smll-174867007300043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a064.tgz
mv FunctionPointer-PT-a064 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 ;