fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640602800179
Last Updated
July 7, 2024

About the Execution of ITS-Tools for FunctionPointer-PT-a008

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14628.623 3600000.00 3960550.00 10229.60 TFFTF?TFFFFFTTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640602800179.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is FunctionPointer-PT-a008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602800179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 11 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 34K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-a008-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716441036178

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-a008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 05:10:37] [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]
[2024-05-23 05:10:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 05:10:37] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-23 05:10:37] [INFO ] Transformed 40 places.
[2024-05-23 05:10:37] [INFO ] Transformed 70 transitions.
[2024-05-23 05:10:37] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 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-a008-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a008-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a008-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a008-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a008-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 32 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 32 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 5 place count 32 transition count 62
Applied a total of 5 rules in 21 ms. Remains 32 /34 variables (removed 2) and now considering 62/66 (removed 4) transitions.
[2024-05-23 05:10:37] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 32 cols
[2024-05-23 05:10:37] [INFO ] Computed 3 invariants in 10 ms
[2024-05-23 05:10:37] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-23 05:10:37] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:10:37] [INFO ] Invariant cache hit.
[2024-05-23 05:10:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:10:37] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-23 05:10:37] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:10:37] [INFO ] Invariant cache hit.
[2024-05-23 05:10:37] [INFO ] State equation strengthened by 8 read => feed constraints.
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, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/76 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 43 constraints, problems are : Problem set: 0 solved, 60 unsolved in 896 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/76 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 56/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/76 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 103 constraints, problems are : Problem set: 0 solved, 60 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1886ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1896ms
Starting structural reductions in LTL mode, iteration 1 : 32/34 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2182 ms. Remains : 32/34 places, 62/66 transitions.
Support contains 22 out of 32 places after structural reductions.
[2024-05-23 05:10:39] [INFO ] Flatten gal took : 20 ms
[2024-05-23 05:10:39] [INFO ] Flatten gal took : 8 ms
[2024-05-23 05:10:39] [INFO ] Input system was already deterministic with 62 transitions.
RANDOM walk for 40000 steps (150 resets) in 568 ms. (70 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40003 steps (54 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
[2024-05-23 05:10:40] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:10:40] [INFO ] Invariant cache hit.
[2024-05-23 05:10:40] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 11/76 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/32 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 145 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Graph (complete) has 145 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 60
Applied a total of 3 rules in 11 ms. Remains 31 /32 variables (removed 1) and now considering 60/62 (removed 2) transitions.
[2024-05-23 05:10:40] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2024-05-23 05:10:40] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 05:10:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-23 05:10:40] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:10:40] [INFO ] Invariant cache hit.
[2024-05-23 05:10:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:10:40] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-23 05:10:40] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-23 05:10:40] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:10:40] [INFO ] Invariant cache hit.
[2024-05-23 05:10:40] [INFO ] State equation strengthened by 8 read => feed constraints.
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, 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 516 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]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
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 618 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]
After SMT, in 1166ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/32 places, 60/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1271 ms. Remains : 31/32 places, 60/62 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-02
Stuttering criterion allowed to conclude after 1146 steps with 22 reset in 8 ms.
FORMULA FunctionPointer-PT-a008-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a008-LTLCardinality-02 finished in 1526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||G(!p1)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 62
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 62/62 (removed 0) transitions.
[2024-05-23 05:10:41] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 31 cols
[2024-05-23 05:10:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:10:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 05:10:42] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:10:42] [INFO ] Invariant cache hit.
[2024-05-23 05:10:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:10:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-23 05:10:42] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:10:42] [INFO ] Invariant cache hit.
[2024-05-23 05:10:42] [INFO ] State equation strengthened by 8 read => feed constraints.
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
At refinement iteration 6 (OVERLAPS) 1/75 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 41 constraints, problems are : Problem set: 0 solved, 60 unsolved in 620 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: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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, 4/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/75 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 56/101 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/75 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 101 constraints, problems are : Problem set: 0 solved, 60 unsolved in 634 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: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1272ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1273ms
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 62/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1351 ms. Remains : 31/32 places, 62/62 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), false, false, p1]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 143 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 : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-a008-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-a008-LTLCardinality-03 finished in 1878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&G(p1))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 62
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 62/62 (removed 0) transitions.
[2024-05-23 05:10:43] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2024-05-23 05:10:43] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 05:10:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 05:10:43] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:10:43] [INFO ] Invariant cache hit.
[2024-05-23 05:10:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:10:43] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-23 05:10:43] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:10:43] [INFO ] Invariant cache hit.
[2024-05-23 05:10:43] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 504 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]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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 600 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]
After SMT, in 1129ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1131ms
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 62/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1227 ms. Remains : 30/32 places, 62/62 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-04
Stuttering criterion allowed to conclude after 85 steps with 1 reset in 3 ms.
FORMULA FunctionPointer-PT-a008-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a008-LTLCardinality-04 finished in 1387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(G(p0) U p1)))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Graph (complete) has 145 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 60
Applied a total of 3 rules in 10 ms. Remains 31 /32 variables (removed 1) and now considering 60/62 (removed 2) transitions.
[2024-05-23 05:10:45] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2024-05-23 05:10:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:10:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 05:10:45] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:10:45] [INFO ] Invariant cache hit.
[2024-05-23 05:10:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:10:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-23 05:10:45] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-23 05:10:45] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:10:45] [INFO ] Invariant cache hit.
[2024-05-23 05:10:45] [INFO ] State equation strengthened by 8 read => feed constraints.
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
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 41 constraints, problems are : Problem set: 0 solved, 58 unsolved in 581 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: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
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, 4/44 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 54/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 99 constraints, problems are : Problem set: 0 solved, 58 unsolved in 704 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: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1304ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1305ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/32 places, 60/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1405 ms. Remains : 31/32 places, 60/62 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-05
Product exploration explored 100000 steps with 922 reset in 225 ms.
Product exploration explored 100000 steps with 958 reset in 176 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 142 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 : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4177 steps (11 resets) in 33 ms. (122 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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.
[2024-05-23 05:10:47] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:10:47] [INFO ] Invariant cache hit.
[2024-05-23 05:10:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 05:10:47] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:10:47] [INFO ] Invariant cache hit.
[2024-05-23 05:10:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:10:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-23 05:10:47] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-23 05:10:47] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:10:47] [INFO ] Invariant cache hit.
[2024-05-23 05:10:47] [INFO ] State equation strengthened by 8 read => feed constraints.
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
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 41 constraints, problems are : Problem set: 0 solved, 58 unsolved in 605 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: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
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, 4/44 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 54/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 99 constraints, problems are : Problem set: 0 solved, 58 unsolved in 707 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: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1334ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1336ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1430 ms. Remains : 31/31 places, 60/60 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 142 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 : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1406 steps (4 resets) in 15 ms. (87 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 956 reset in 133 ms.
Product exploration explored 100000 steps with 971 reset in 142 ms.
Built C files in :
/tmp/ltsmin2366229021358711341
[2024-05-23 05:10:50] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-23 05:10:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:10:50] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-23 05:10:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:10:50] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-23 05:10:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:10:50] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2366229021358711341
Running compilation step : cd /tmp/ltsmin2366229021358711341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin2366229021358711341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2366229021358711341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15710066243700403573.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 3 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-23 05:11:05] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:11:05] [INFO ] Invariant cache hit.
[2024-05-23 05:11:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 05:11:05] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:11:05] [INFO ] Invariant cache hit.
[2024-05-23 05:11:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:11:05] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-23 05:11:05] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-23 05:11:05] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:11:05] [INFO ] Invariant cache hit.
[2024-05-23 05:11:05] [INFO ] State equation strengthened by 8 read => feed constraints.
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
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 41 constraints, problems are : Problem set: 0 solved, 58 unsolved in 610 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: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
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, 4/44 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 54/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 99 constraints, problems are : Problem set: 0 solved, 58 unsolved in 684 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: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1314ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1314ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1392 ms. Remains : 31/31 places, 60/60 transitions.
Built C files in :
/tmp/ltsmin11200737018174027473
[2024-05-23 05:11:06] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-23 05:11:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:11:06] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-23 05:11:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:11:06] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-23 05:11:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:11:06] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11200737018174027473
Running compilation step : cd /tmp/ltsmin11200737018174027473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 167 ms.
Running link step : cd /tmp/ltsmin11200737018174027473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11200737018174027473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16635249305998091094.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 05:11:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 05:11:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 05:11:21] [INFO ] Time to serialize gal into /tmp/LTL18121641242599763637.gal : 2 ms
[2024-05-23 05:11:21] [INFO ] Time to serialize properties into /tmp/LTL10032284677731862405.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18121641242599763637.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15588808437318259926.hoa' '-atoms' '/tmp/LTL10032284677731862405.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10032284677731862405.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15588808437318259926.hoa
Detected timeout of ITS tools.
[2024-05-23 05:11:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 05:11:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 05:11:36] [INFO ] Time to serialize gal into /tmp/LTL17705651656729119345.gal : 4 ms
[2024-05-23 05:11:36] [INFO ] Time to serialize properties into /tmp/LTL7589468726623893889.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17705651656729119345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7589468726623893889.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(l22>l3)"))||((G("(l22>l3)"))U("(s2<=l26)"))))))
Formula 0 simplified : G(F(F!"(l22>l3)" R !"(s2<=l26)") & FG!"(l22>l3)")
Detected timeout of ITS tools.
[2024-05-23 05:11:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 05:11:51] [INFO ] Applying decomposition
[2024-05-23 05:11:51] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9538028126744587629.txt' '-o' '/tmp/graph9538028126744587629.bin' '-w' '/tmp/graph9538028126744587629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9538028126744587629.bin' '-l' '-1' '-v' '-w' '/tmp/graph9538028126744587629.weights' '-q' '0' '-e' '0.001'
[2024-05-23 05:11:52] [INFO ] Decomposing Gal with order
[2024-05-23 05:11:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 05:11:52] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-23 05:11:52] [INFO ] Flatten gal took : 50 ms
[2024-05-23 05:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 7 ms.
[2024-05-23 05:11:52] [INFO ] Time to serialize gal into /tmp/LTL14228848532364421762.gal : 2 ms
[2024-05-23 05:11:52] [INFO ] Time to serialize properties into /tmp/LTL2976356682530528219.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14228848532364421762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2976356682530528219.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(gu3.l22>gu3.l3)"))||((G("(gu3.l22>gu3.l3)"))U("(gu1.s2<=gu1.l26)"))))))
Formula 0 simplified : G(F(F!"(gu3.l22>gu3.l3)" R !"(gu1.s2<=gu1.l26)") & FG!"(gu3.l22>gu3.l3)")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-a008-LTLCardinality-05 finished in 81949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Graph (complete) has 145 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 60
Applied a total of 3 rules in 9 ms. Remains 30 /32 variables (removed 2) and now considering 60/62 (removed 2) transitions.
[2024-05-23 05:12:07] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2024-05-23 05:12:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:12:07] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 05:12:07] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:12:07] [INFO ] Invariant cache hit.
[2024-05-23 05:12:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:12:07] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-23 05:12:07] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-23 05:12:07] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:12:07] [INFO ] Invariant cache hit.
[2024-05-23 05:12:07] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 458 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]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
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 612 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]
After SMT, in 1085ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/32 places, 60/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1178 ms. Remains : 30/32 places, 60/62 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-07
Product exploration explored 100000 steps with 1004 reset in 137 ms.
Product exploration explored 100000 steps with 1045 reset in 128 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2285 steps (5 resets) in 14 ms. (152 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-23 05:12:09] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:12:09] [INFO ] Invariant cache hit.
[2024-05-23 05:12:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 05:12:09] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:12:09] [INFO ] Invariant cache hit.
[2024-05-23 05:12:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:12:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-23 05:12:09] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-23 05:12:09] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:12:09] [INFO ] Invariant cache hit.
[2024-05-23 05:12:09] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 496 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]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
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 625 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]
After SMT, in 1136ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1219 ms. Remains : 30/30 places, 60/60 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1486 steps (3 resets) in 14 ms. (99 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 980 reset in 118 ms.
Product exploration explored 100000 steps with 1032 reset in 127 ms.
Built C files in :
/tmp/ltsmin8786336290785599974
[2024-05-23 05:12:11] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-23 05:12:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:12:11] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-23 05:12:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:12:11] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-23 05:12:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:12:11] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8786336290785599974
Running compilation step : cd /tmp/ltsmin8786336290785599974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 159 ms.
Running link step : cd /tmp/ltsmin8786336290785599974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8786336290785599974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5294639030663437815.hoa' '--buchi-type=spotba'
LTSmin run took 181 ms.
FORMULA FunctionPointer-PT-a008-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-a008-LTLCardinality-07 finished in 4713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Graph (complete) has 145 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 60
Applied a total of 3 rules in 5 ms. Remains 31 /32 variables (removed 1) and now considering 60/62 (removed 2) transitions.
[2024-05-23 05:12:11] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2024-05-23 05:12:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:12:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 05:12:11] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:12:11] [INFO ] Invariant cache hit.
[2024-05-23 05:12:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:12:11] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-23 05:12:11] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-23 05:12:11] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:12:11] [INFO ] Invariant cache hit.
[2024-05-23 05:12:11] [INFO ] State equation strengthened by 8 read => feed constraints.
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
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 41 constraints, problems are : Problem set: 0 solved, 58 unsolved in 543 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: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
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, 4/44 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 54/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 99 constraints, problems are : Problem set: 0 solved, 58 unsolved in 678 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: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1237ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1238ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/32 places, 60/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1330 ms. Remains : 31/32 places, 60/62 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-08
Stuttering criterion allowed to conclude after 421 steps with 3 reset in 3 ms.
FORMULA FunctionPointer-PT-a008-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a008-LTLCardinality-08 finished in 1458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 62
Applied a total of 2 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 62/62 (removed 0) transitions.
[2024-05-23 05:12:13] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2024-05-23 05:12:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:12:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 05:12:13] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:13] [INFO ] Invariant cache hit.
[2024-05-23 05:12:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:12:13] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-23 05:12:13] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:13] [INFO ] Invariant cache hit.
[2024-05-23 05:12:13] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 492 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]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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 587 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]
After SMT, in 1094ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1094ms
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 62/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 30/32 places, 62/62 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-a008-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a008-LTLCardinality-10 finished in 1327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Graph (complete) has 145 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 60
Applied a total of 3 rules in 7 ms. Remains 30 /32 variables (removed 2) and now considering 60/62 (removed 2) transitions.
[2024-05-23 05:12:14] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2024-05-23 05:12:14] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 05:12:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 05:12:14] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:12:14] [INFO ] Invariant cache hit.
[2024-05-23 05:12:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:12:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-23 05:12:14] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-23 05:12:14] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 05:12:14] [INFO ] Invariant cache hit.
[2024-05-23 05:12:14] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 473 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]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
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 668 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]
After SMT, in 1156ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/32 places, 60/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1241 ms. Remains : 30/32 places, 60/62 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-11
Stuttering criterion allowed to conclude after 471 steps with 13 reset in 3 ms.
FORMULA FunctionPointer-PT-a008-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a008-LTLCardinality-11 finished in 1332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 62
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 62/62 (removed 0) transitions.
[2024-05-23 05:12:16] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2024-05-23 05:12:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:12:16] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-23 05:12:16] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:16] [INFO ] Invariant cache hit.
[2024-05-23 05:12:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:12:16] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-23 05:12:16] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:16] [INFO ] Invariant cache hit.
[2024-05-23 05:12:16] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 495 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]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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 578 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]
After SMT, in 1087ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1088ms
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 62/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1161 ms. Remains : 30/32 places, 62/62 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-13
Product exploration explored 100000 steps with 25000 reset in 110 ms.
Product exploration explored 100000 steps with 25000 reset in 104 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 147 steps (0 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-23 05:12:18] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:18] [INFO ] Invariant cache hit.
[2024-05-23 05:12:18] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 05:12:18] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:18] [INFO ] Invariant cache hit.
[2024-05-23 05:12:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:12:18] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-23 05:12:18] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:18] [INFO ] Invariant cache hit.
[2024-05-23 05:12:18] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 481 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]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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 573 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]
After SMT, in 1072ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1072ms
Finished structural reductions in LTL mode , in 1 iterations and 1156 ms. Remains : 30/30 places, 62/62 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 147 steps (0 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 70 ms.
Product exploration explored 100000 steps with 25000 reset in 76 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 62/62 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 60
Applied a total of 2 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 60/62 (removed 2) transitions.
[2024-05-23 05:12:20] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-23 05:12:20] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2024-05-23 05:12:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:12:20] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 480 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]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
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 650 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]
After SMT, in 1146ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 60/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1159 ms. Remains : 30/30 places, 60/62 transitions.
Built C files in :
/tmp/ltsmin14129868958263107134
[2024-05-23 05:12:21] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14129868958263107134
Running compilation step : cd /tmp/ltsmin14129868958263107134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin14129868958263107134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14129868958263107134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7498170336903624458.hoa' '--buchi-type=spotba'
LTSmin run took 635 ms.
FORMULA FunctionPointer-PT-a008-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-a008-LTLCardinality-13 finished in 6499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(!p0))||(p1&&F(p2)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 62
Applied a total of 2 rules in 0 ms. Remains 30 /32 variables (removed 2) and now considering 62/62 (removed 0) transitions.
[2024-05-23 05:12:22] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2024-05-23 05:12:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:12:22] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-23 05:12:22] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:22] [INFO ] Invariant cache hit.
[2024-05-23 05:12:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:12:22] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-23 05:12:22] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:22] [INFO ] Invariant cache hit.
[2024-05-23 05:12:22] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 502 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]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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 579 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]
After SMT, in 1099ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1100ms
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 62/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1172 ms. Remains : 30/32 places, 62/62 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 71 ms.
Product exploration explored 100000 steps with 33333 reset in 74 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND p1 (NOT p2))), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-a008-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-a008-LTLCardinality-14 finished in 1531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 62/62 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 62
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 62/62 (removed 0) transitions.
[2024-05-23 05:12:24] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:24] [INFO ] Invariant cache hit.
[2024-05-23 05:12:24] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 05:12:24] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:24] [INFO ] Invariant cache hit.
[2024-05-23 05:12:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 05:12:24] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-23 05:12:24] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2024-05-23 05:12:24] [INFO ] Invariant cache hit.
[2024-05-23 05:12:24] [INFO ] State equation strengthened by 8 read => feed constraints.
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
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 494 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]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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 563 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]
After SMT, in 1074ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1076ms
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 62/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1170 ms. Remains : 30/32 places, 62/62 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-a008-LTLCardinality-15
Stuttering criterion allowed to conclude after 9308 steps with 582 reset in 11 ms.
FORMULA FunctionPointer-PT-a008-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a008-LTLCardinality-15 finished in 1348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(G(p0) U p1)))))'
[2024-05-23 05:12:25] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16921635755082538121
[2024-05-23 05:12:25] [INFO ] Applying decomposition
[2024-05-23 05:12:25] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2024-05-23 05:12:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:12:25] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2024-05-23 05:12:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:12:25] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2024-05-23 05:12:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:12:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16921635755082538121
Running compilation step : cd /tmp/ltsmin16921635755082538121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 05:12:25] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17056187916890524835.txt' '-o' '/tmp/graph17056187916890524835.bin' '-w' '/tmp/graph17056187916890524835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17056187916890524835.bin' '-l' '-1' '-v' '-w' '/tmp/graph17056187916890524835.weights' '-q' '0' '-e' '0.001'
[2024-05-23 05:12:25] [INFO ] Decomposing Gal with order
[2024-05-23 05:12:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 05:12:25] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-23 05:12:25] [INFO ] Flatten gal took : 5 ms
[2024-05-23 05:12:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 18 ms.
[2024-05-23 05:12:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality8863183790925941863.gal : 1 ms
[2024-05-23 05:12:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality1590560100621175367.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8863183790925941863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1590560100621175367.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(gu3.l22>gu3.l3)"))||((G("(gu3.l22>gu3.l3)"))U("(gu1.s2<=gu1.l26)"))))))
Formula 0 simplified : G(F(F!"(gu3.l22>gu3.l3)" R !"(gu1.s2<=gu1.l26)") & FG!"(gu3.l22>gu3.l3)")
Compilation finished in 305 ms.
Running link step : cd /tmp/ltsmin16921635755082538121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16921635755082538121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||([]((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: LTL layer: formula: <>([]((<>((LTLAPp0==true))||([]((LTLAPp0==true)) U (LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.006: "<>([]((<>((LTLAPp0==true))||([]((LTLAPp0==true)) U (LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: 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.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: Initializing POR dependencies: labels 64, guards 62
pins2lts-mc-linux64( 0/ 8), 0.292: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.370: There are 65 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.370: State length is 33, there are 68 groups
pins2lts-mc-linux64( 0/ 8), 0.370: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.370: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.370: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.371: Visible groups: 0 / 68, labels: 2 / 65
pins2lts-mc-linux64( 0/ 8), 0.371: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.371: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.418: [Blue] ~120 levels ~960 states ~2808 transitions
pins2lts-mc-linux64( 1/ 8), 0.467: [Blue] ~203 levels ~1920 states ~6192 transitions
pins2lts-mc-linux64( 1/ 8), 0.517: [Blue] ~350 levels ~3840 states ~10296 transitions
pins2lts-mc-linux64( 1/ 8), 0.604: [Blue] ~646 levels ~7680 states ~17976 transitions
pins2lts-mc-linux64( 1/ 8), 0.784: [Blue] ~1237 levels ~15360 states ~33336 transitions
pins2lts-mc-linux64( 1/ 8), 1.121: [Blue] ~2418 levels ~30720 states ~64064 transitions
pins2lts-mc-linux64( 1/ 8), 2.200: [Blue] ~4781 levels ~61440 states ~125488 transitions
pins2lts-mc-linux64( 1/ 8), 3.643: [Blue] ~9507 levels ~122880 states ~248368 transitions
pins2lts-mc-linux64( 1/ 8), 6.028: [Blue] ~18959 levels ~245760 states ~494144 transitions
pins2lts-mc-linux64( 1/ 8), 7.835: [Blue] ~37864 levels ~491520 states ~985664 transitions
pins2lts-mc-linux64( 1/ 8), 9.517: [Blue] ~75673 levels ~983040 states ~1968704 transitions
pins2lts-mc-linux64( 1/ 8), 11.213: [Blue] ~151292 levels ~1966080 states ~3934760 transitions
pins2lts-mc-linux64( 1/ 8), 14.629: [Blue] ~302529 levels ~3932160 states ~7866944 transitions
pins2lts-mc-linux64( 1/ 8), 20.834: [Blue] ~605002 levels ~7864320 states ~15731248 transitions
pins2lts-mc-linux64( 1/ 8), 33.577: [Blue] ~1209950 levels ~15728640 states ~31459896 transitions
pins2lts-mc-linux64( 1/ 8), 59.695: [Blue] ~2419846 levels ~31457280 states ~62917176 transitions
pins2lts-mc-linux64( 1/ 8), 68.866: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 68.940:
pins2lts-mc-linux64( 0/ 8), 68.940: Explored 23750407 states 70080682 transitions, fanout: 2.951
pins2lts-mc-linux64( 0/ 8), 68.940: Total exploration time 68.520 sec (68.460 sec minimum, 68.493 sec on average)
pins2lts-mc-linux64( 0/ 8), 68.940: States per second: 346620, Transitions per second: 1022777
pins2lts-mc-linux64( 0/ 8), 68.940:
pins2lts-mc-linux64( 0/ 8), 68.940: State space has 65488914 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 68.940: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 68.941: blue states: 23750407 (36.27%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 68.941: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 68.941: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 68.941:
pins2lts-mc-linux64( 0/ 8), 68.941: Total memory used for local state coloring: 298.3MB
pins2lts-mc-linux64( 0/ 8), 68.941:
pins2lts-mc-linux64( 0/ 8), 68.941: Queue width: 8B, total height: 19550730, memory: 149.16MB
pins2lts-mc-linux64( 0/ 8), 68.941: Tree memory: 755.6MB, 12.1 B/state, compr.: 9.0%
pins2lts-mc-linux64( 0/ 8), 68.941: Tree fill ratio (roots/leafs): 48.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 68.941: Stored 62 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 68.941: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 68.941: Est. total memory use: 904.8MB (~1173.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16921635755082538121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||([]((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16921635755082538121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||([]((LTLAPp0==true)) U (LTLAPp1==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:840)
Detected timeout of ITS tools.
[2024-05-23 05:33:02] [INFO ] Flatten gal took : 4 ms
[2024-05-23 05:33:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality6156881059074781710.gal : 1 ms
[2024-05-23 05:33:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality1099785407721961316.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6156881059074781710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1099785407721961316.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(l22>l3)"))||((G("(l22>l3)"))U("(s2<=l26)"))))))
Formula 0 simplified : G(F(F!"(l22>l3)" R !"(s2<=l26)") & FG!"(l22>l3)")
Detected timeout of ITS tools.
[2024-05-23 05:53:38] [INFO ] Flatten gal took : 11 ms
[2024-05-23 05:53:38] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-23 05:53:38] [INFO ] Transformed 32 places.
[2024-05-23 05:53:38] [INFO ] Transformed 62 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
[2024-05-23 05:53:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality14809794144817946008.gal : 1 ms
[2024-05-23 05:53:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality2761049841464209565.ltl : 3 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14809794144817946008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2761049841464209565.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((F("(l22>l3)"))||((G("(l22>l3)"))U("(s2<=l26)"))))))
Formula 0 simplified : G(F(F!"(l22>l3)" R !"(s2<=l26)") & FG!"(l22>l3)")

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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-a008"
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-5568"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-a008, 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 r180-tall-171640602800179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a008.tgz
mv FunctionPointer-PT-a008 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;