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-171640602900219.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-b002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602900219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 23K 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 18K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 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 391K 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-b002-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716453386220

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-b002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 08:36:27] [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 08:36:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 08:36:27] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-23 08:36:27] [INFO ] Transformed 306 places.
[2024-05-23 08:36:27] [INFO ] Transformed 840 transitions.
[2024-05-23 08:36:27] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 35 place count 187 transition count 510
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 510
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 96 place count 187 transition count 474
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 175 transition count 450
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 175 transition count 450
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 175 transition count 442
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 133 place count 170 transition count 432
Iterating global reduction 3 with 5 rules applied. Total rules applied 138 place count 170 transition count 432
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 143 place count 165 transition count 412
Iterating global reduction 3 with 5 rules applied. Total rules applied 148 place count 165 transition count 412
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 153 place count 160 transition count 402
Iterating global reduction 3 with 5 rules applied. Total rules applied 158 place count 160 transition count 402
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 159 transition count 398
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 159 transition count 398
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 158 transition count 394
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 158 transition count 394
Applied a total of 162 rules in 85 ms. Remains 158 /222 variables (removed 64) and now considering 394/648 (removed 254) transitions.
[2024-05-23 08:36:27] [INFO ] Flow matrix only has 271 transitions (discarded 123 similar events)
// Phase 1: matrix 271 rows 158 cols
[2024-05-23 08:36:27] [INFO ] Computed 2 invariants in 21 ms
[2024-05-23 08:36:28] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 08:36:28] [INFO ] Flow matrix only has 271 transitions (discarded 123 similar events)
[2024-05-23 08:36:28] [INFO ] Invariant cache hit.
[2024-05-23 08:36:28] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-23 08:36:28] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-23 08:36:28] [INFO ] Flow matrix only has 271 transitions (discarded 123 similar events)
[2024-05-23 08:36:28] [INFO ] Invariant cache hit.
[2024-05-23 08:36:28] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 271/429 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 60/220 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 392 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 220 constraints, problems are : Problem set: 0 solved, 392 unsolved in 13747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 271/429 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 60/220 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 392/612 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 0/429 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 612 constraints, problems are : Problem set: 0 solved, 392 unsolved in 15975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints]
After SMT, in 30329ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 30345ms
Starting structural reductions in LTL mode, iteration 1 : 158/222 places, 394/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31059 ms. Remains : 158/222 places, 394/648 transitions.
Support contains 26 out of 158 places after structural reductions.
[2024-05-23 08:36:59] [INFO ] Flatten gal took : 50 ms
[2024-05-23 08:36:59] [INFO ] Flatten gal took : 25 ms
[2024-05-23 08:36:59] [INFO ] Input system was already deterministic with 394 transitions.
RANDOM walk for 36914 steps (79 resets) in 1763 ms. (20 steps per ms) remains 0/18 properties
FORMULA FunctionPointer-PT-b002-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
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((F((X(G(p0))&&G(p1)))||G(p2))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 149 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 149 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 142 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 142 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 136 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 136 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 130 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 130 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 124 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 124 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 105 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 104 transition count 254
Applied a total of 112 rules in 25 ms. Remains 104 /158 variables (removed 54) and now considering 254/394 (removed 140) transitions.
[2024-05-23 08:36:59] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2024-05-23 08:36:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:37:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 08:37:00] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 08:37:00] [INFO ] Invariant cache hit.
[2024-05-23 08:37:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 08:37:00] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-23 08:37:00] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 08:37:00] [INFO ] Invariant cache hit.
[2024-05-23 08:37:00] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5725 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 252/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 398 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6577 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 12525ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 12529ms
Starting structural reductions in LTL mode, iteration 1 : 104/158 places, 254/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12796 ms. Remains : 104/158 places, 254/394 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-01
Product exploration explored 100000 steps with 294 reset in 283 ms.
Product exploration explored 100000 steps with 314 reset in 228 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 365 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
RANDOM walk for 40000 steps (79 resets) in 268 ms. (148 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (21 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2024-05-23 08:37:14] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 08:37:14] [INFO ] Invariant cache hit.
[2024-05-23 08:37:14] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 48/276 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/104 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 15 factoid took 443 ms. Reduced automaton from 6 states, 19 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 254/254 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 104 transition count 252
Applied a total of 2 rules in 36 ms. Remains 104 /104 variables (removed 0) and now considering 252/254 (removed 2) transitions.
[2024-05-23 08:37:15] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2024-05-23 08:37:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 08:37:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 08:37:15] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 08:37:15] [INFO ] Invariant cache hit.
[2024-05-23 08:37:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 08:37:15] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-23 08:37:15] [INFO ] Redundant transitions in 12 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-23 08:37:15] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 08:37:15] [INFO ] Invariant cache hit.
[2024-05-23 08:37:15] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 146 constraints, problems are : Problem set: 0 solved, 250 unsolved in 5693 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 250/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 396 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 12361ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 12364ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 252/254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12648 ms. Remains : 104/104 places, 252/254 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/252 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 301 ms. Reduced automaton from 8 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
RANDOM walk for 40000 steps (110 resets) in 125 ms. (317 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (46 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-05-23 08:37:28] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 08:37:28] [INFO ] Invariant cache hit.
[2024-05-23 08:37:28] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 48/275 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/104 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 558 ms. Reduced automaton from 8 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Product exploration explored 100000 steps with 504 reset in 173 ms.
Product exploration explored 100000 steps with 506 reset in 173 ms.
Built C files in :
/tmp/ltsmin10474755855590162236
[2024-05-23 08:37:31] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-23 08:37:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:37:31] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-23 08:37:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:37:31] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-23 08:37:31] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:37:31] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10474755855590162236
Running compilation step : cd /tmp/ltsmin10474755855590162236;'/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 708 ms.
Running link step : cd /tmp/ltsmin10474755855590162236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin10474755855590162236;'/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/stateBased2599536116603757790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 252/252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 248
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 4 place count 103 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 234
Applied a total of 16 rules in 64 ms. Remains 97 /104 variables (removed 7) and now considering 234/252 (removed 18) transitions.
[2024-05-23 08:37:46] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-23 08:37:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:37:46] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 08:37:46] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 08:37:46] [INFO ] Invariant cache hit.
[2024-05-23 08:37:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 08:37:46] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-23 08:37:46] [INFO ] Redundant transitions in 3 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-23 08:37:46] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 08:37:46] [INFO ] Invariant cache hit.
[2024-05-23 08:37:46] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 4968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 368 constraints, problems are : Problem set: 0 solved, 232 unsolved in 5640 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 10774ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 10779ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/104 places, 234/252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11202 ms. Remains : 97/104 places, 234/252 transitions.
Built C files in :
/tmp/ltsmin2586280218886214986
[2024-05-23 08:37:57] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2024-05-23 08:37:57] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:37:57] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2024-05-23 08:37:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:37:57] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2024-05-23 08:37:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:37:57] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2586280218886214986
Running compilation step : cd /tmp/ltsmin2586280218886214986;'/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 505 ms.
Running link step : cd /tmp/ltsmin2586280218886214986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2586280218886214986;'/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/stateBased2592168561419186452.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 08:38:12] [INFO ] Flatten gal took : 11 ms
[2024-05-23 08:38:12] [INFO ] Flatten gal took : 11 ms
[2024-05-23 08:38:12] [INFO ] Time to serialize gal into /tmp/LTL1906378975725119474.gal : 3 ms
[2024-05-23 08:38:12] [INFO ] Time to serialize properties into /tmp/LTL2202605536360882169.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1906378975725119474.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15518766348130297874.hoa' '-atoms' '/tmp/LTL2202605536360882169.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...318
Loading property file /tmp/LTL2202605536360882169.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15518766348130297874.hoa
Detected timeout of ITS tools.
[2024-05-23 08:38:27] [INFO ] Flatten gal took : 11 ms
[2024-05-23 08:38:27] [INFO ] Flatten gal took : 14 ms
[2024-05-23 08:38:27] [INFO ] Time to serialize gal into /tmp/LTL6679076486230355220.gal : 2 ms
[2024-05-23 08:38:27] [INFO ] Time to serialize properties into /tmp/LTL12184867118717014882.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/LTL6679076486230355220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12184867118717014882.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 : !((X((F((X(G("(l30<2)")))&&(G("(l36<2)"))))||(G("((l41>0)&&(l164<3))")))))
Formula 0 simplified : X(G(XF!"(l30<2)" | F!"(l36<2)") & F!"((l41>0)&&(l164<3))")
Detected timeout of ITS tools.
[2024-05-23 08:38:42] [INFO ] Flatten gal took : 11 ms
[2024-05-23 08:38:42] [INFO ] Applying decomposition
[2024-05-23 08:38:42] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18378036201153152934.txt' '-o' '/tmp/graph18378036201153152934.bin' '-w' '/tmp/graph18378036201153152934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18378036201153152934.bin' '-l' '-1' '-v' '-w' '/tmp/graph18378036201153152934.weights' '-q' '0' '-e' '0.001'
[2024-05-23 08:38:42] [INFO ] Decomposing Gal with order
[2024-05-23 08:38:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 08:38:42] [INFO ] Removed a total of 416 redundant transitions.
[2024-05-23 08:38:42] [INFO ] Flatten gal took : 110 ms
[2024-05-23 08:38:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 15 ms.
[2024-05-23 08:38:42] [INFO ] Time to serialize gal into /tmp/LTL16145694682931410361.gal : 4 ms
[2024-05-23 08:38:42] [INFO ] Time to serialize properties into /tmp/LTL14147431555051206554.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/LTL16145694682931410361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14147431555051206554.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((X((F((X(G("(i1.u6.l30<2)")))&&(G("(i3.u4.l36<2)"))))||(G("((i2.u3.l41>0)&&(i11.i0.u25.l164<3))")))))
Formula 0 simplified : X(G(XF!"(i1.u6.l30<2)" | F!"(i3.u4.l36<2)") & F!"((i2.u3.l41>0)&&(i11.i0.u25.l164<3))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-01 finished in 118097 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)))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 149 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 149 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 142 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 142 transition count 344
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 135 transition count 324
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 135 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 129 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 129 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 123 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 123 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 113 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 113 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 110 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 108 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 106 transition count 256
Applied a total of 112 rules in 57 ms. Remains 106 /158 variables (removed 52) and now considering 256/394 (removed 138) transitions.
[2024-05-23 08:38:58] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-23 08:38:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:38:58] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-23 08:38:58] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-23 08:38:58] [INFO ] Invariant cache hit.
[2024-05-23 08:38:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 08:38:58] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-23 08:38:58] [INFO ] Redundant transitions in 3 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-23 08:38:58] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-23 08:38:58] [INFO ] Invariant cache hit.
[2024-05-23 08:38:58] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 5703 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 402 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 12847ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 12850ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/158 places, 256/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13140 ms. Remains : 106/158 places, 256/394 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-02
Product exploration explored 100000 steps with 575 reset in 166 ms.
Stack based approach found an accepted trace after 59200 steps with 333 reset with depth 15 and stack size 15 in 104 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-02 finished in 13488 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))||G(p1))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 139 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 139 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 134 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 134 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 129 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 125 transition count 302
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 125 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 121 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 121 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 119 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 119 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 117 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 116 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 115 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 114 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 114 transition count 278
Applied a total of 92 rules in 20 ms. Remains 114 /158 variables (removed 44) and now considering 278/394 (removed 116) transitions.
[2024-05-23 08:39:11] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
// Phase 1: matrix 190 rows 114 cols
[2024-05-23 08:39:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 08:39:11] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 08:39:11] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-23 08:39:11] [INFO ] Invariant cache hit.
[2024-05-23 08:39:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-23 08:39:11] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-23 08:39:11] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-23 08:39:11] [INFO ] Invariant cache hit.
[2024-05-23 08:39:11] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/304 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 276 unsolved in 6879 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/304 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 276/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 436 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 15061ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 15064ms
Starting structural reductions in LTL mode, iteration 1 : 114/158 places, 278/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15368 ms. Remains : 114/158 places, 278/394 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-03
Product exploration explored 100000 steps with 343 reset in 212 ms.
Product exploration explored 100000 steps with 320 reset in 239 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40002 steps (88 resets) in 294 ms. (135 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (14 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
[2024-05-23 08:39:27] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-23 08:39:27] [INFO ] Invariant cache hit.
[2024-05-23 08:39:27] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/166 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/228 variables, 13/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 30/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/290 variables, 29/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/303 variables, 11/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/304 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/166 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/228 variables, 13/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 30/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/290 variables, 29/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/303 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/304 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/304 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/304 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 278/278 transitions.
Graph (complete) has 464 edges and 114 vertex of which 90 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 90 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 90 transition count 224
Applied a total of 55 rules in 14 ms. Remains 90 /114 variables (removed 24) and now considering 224/278 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 90/114 places, 224/278 transitions.
RANDOM walk for 40000 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1844730 steps, run timeout after 3001 ms. (steps per millisecond=614 ) properties seen :0 out of 1
Probabilistic random walk after 1844730 steps, saw 1148248 distinct states, run finished after 3004 ms. (steps per millisecond=614 ) properties seen :0
[2024-05-23 08:39:31] [INFO ] Flow matrix only has 141 transitions (discarded 83 similar events)
// Phase 1: matrix 141 rows 90 cols
[2024-05-23 08:39:31] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 08:39:31] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/182 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/214 variables, 15/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/226 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/230 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/231 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/231 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/182 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/214 variables, 15/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/226 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/230 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/231 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/231 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/231 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 216ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/90 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-23 08:39:31] [INFO ] Flow matrix only has 141 transitions (discarded 83 similar events)
[2024-05-23 08:39:31] [INFO ] Invariant cache hit.
[2024-05-23 08:39:31] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 08:39:31] [INFO ] Flow matrix only has 141 transitions (discarded 83 similar events)
[2024-05-23 08:39:31] [INFO ] Invariant cache hit.
[2024-05-23 08:39:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-23 08:39:31] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-23 08:39:31] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-23 08:39:31] [INFO ] Flow matrix only has 141 transitions (discarded 83 similar events)
[2024-05-23 08:39:31] [INFO ] Invariant cache hit.
[2024-05-23 08:39:31] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 141/231 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 222 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 0/231 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 115 constraints, problems are : Problem set: 0 solved, 222 unsolved in 3492 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 141/231 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 222/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 337 constraints, problems are : Problem set: 0 solved, 222 unsolved in 5407 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 9025ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 9028ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9230 ms. Remains : 90/90 places, 224/224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 90 transition count 132
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 101 place count 81 transition count 132
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 101 place count 81 transition count 117
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 131 place count 66 transition count 117
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 165 place count 49 transition count 100
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 43 transition count 88
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 place count 43 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 183 place count 37 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 189 place count 37 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 195 place count 31 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 31 transition count 64
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 207 place count 31 transition count 58
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 213 place count 28 transition count 60
Applied a total of 213 rules in 23 ms. Remains 28 /90 variables (removed 62) and now considering 60/224 (removed 164) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 28 cols
[2024-05-23 08:39:40] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 08:39:40] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:39:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 08:39:40] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 08:39:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 08:39:40] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 08:39:40] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 08:39:40] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 109 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 177 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 278/278 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2024-05-23 08:39:41] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
// Phase 1: matrix 190 rows 114 cols
[2024-05-23 08:39:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 08:39:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 08:39:41] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-23 08:39:41] [INFO ] Invariant cache hit.
[2024-05-23 08:39:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-23 08:39:41] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-23 08:39:41] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-23 08:39:41] [INFO ] Invariant cache hit.
[2024-05-23 08:39:41] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/304 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 276 unsolved in 6887 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/304 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 276/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 436 constraints, problems are : Problem set: 0 solved, 276 unsolved in 8145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 15218ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 15220ms
Finished structural reductions in LTL mode , in 1 iterations and 15478 ms. Remains : 114/114 places, 278/278 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40002 steps (47 resets) in 204 ms. (195 steps per ms) remains 1/3 properties
BEST_FIRST walk for 29159 steps (12 resets) in 33 ms. (857 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 328 reset in 179 ms.
Product exploration explored 100000 steps with 298 reset in 189 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 278/278 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 114 transition count 272
Applied a total of 6 rules in 16 ms. Remains 114 /114 variables (removed 0) and now considering 272/278 (removed 6) transitions.
[2024-05-23 08:39:58] [INFO ] Redundant transitions in 2 ms returned []
Running 270 sub problems to find dead transitions.
[2024-05-23 08:39:58] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
// Phase 1: matrix 187 rows 114 cols
[2024-05-23 08:39:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:39:58] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 187/301 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 160 constraints, problems are : Problem set: 0 solved, 270 unsolved in 6530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 187/301 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 270/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 430 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7468 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 14197ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 14200ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/114 places, 272/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14228 ms. Remains : 114/114 places, 272/278 transitions.
Built C files in :
/tmp/ltsmin7747637257641407780
[2024-05-23 08:40:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7747637257641407780
Running compilation step : cd /tmp/ltsmin7747637257641407780;'/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 465 ms.
Running link step : cd /tmp/ltsmin7747637257641407780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7747637257641407780;'/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/stateBased15618491482645187277.hoa' '--buchi-type=spotba'
LTSmin run took 8353 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b002-LTLCardinality-03 finished in 70050 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(F((X((p0||G(p1)))||G(p2)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 151 transition count 376
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 151 transition count 376
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 22 place count 151 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 146 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 146 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 141 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 141 transition count 342
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 136 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 136 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 132 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 132 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 129 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 129 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 126 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 126 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 125 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 125 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 124 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 124 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 123 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 123 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 122 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 122 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 121 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 121 transition count 296
Applied a total of 82 rules in 31 ms. Remains 121 /158 variables (removed 37) and now considering 296/394 (removed 98) transitions.
[2024-05-23 08:40:21] [INFO ] Flow matrix only has 201 transitions (discarded 95 similar events)
// Phase 1: matrix 201 rows 121 cols
[2024-05-23 08:40:21] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 08:40:21] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 08:40:21] [INFO ] Flow matrix only has 201 transitions (discarded 95 similar events)
[2024-05-23 08:40:21] [INFO ] Invariant cache hit.
[2024-05-23 08:40:21] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-23 08:40:21] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-23 08:40:21] [INFO ] Flow matrix only has 201 transitions (discarded 95 similar events)
[2024-05-23 08:40:21] [INFO ] Invariant cache hit.
[2024-05-23 08:40:21] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 201/322 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 46/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 169 constraints, problems are : Problem set: 0 solved, 294 unsolved in 7603 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 201/322 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 46/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 294/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 463 constraints, problems are : Problem set: 0 solved, 294 unsolved in 9195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 17000ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 17004ms
Starting structural reductions in LTL mode, iteration 1 : 121/158 places, 296/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17296 ms. Remains : 121/158 places, 296/394 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Product exploration explored 100000 steps with 33333 reset in 143 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b002-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b002-LTLCardinality-05 finished in 17787 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(p0))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 138 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 133 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 133 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 128 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 123 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 118 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 115 transition count 278
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 115 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 113 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 113 transition count 274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 112 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 111 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 111 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 111 transition count 266
Applied a total of 102 rules in 43 ms. Remains 111 /158 variables (removed 47) and now considering 266/394 (removed 128) transitions.
[2024-05-23 08:40:39] [INFO ] Flow matrix only has 183 transitions (discarded 83 similar events)
// Phase 1: matrix 183 rows 111 cols
[2024-05-23 08:40:39] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 08:40:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 08:40:39] [INFO ] Flow matrix only has 183 transitions (discarded 83 similar events)
[2024-05-23 08:40:39] [INFO ] Invariant cache hit.
[2024-05-23 08:40:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 08:40:39] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-23 08:40:39] [INFO ] Redundant transitions in 2 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-23 08:40:39] [INFO ] Flow matrix only has 183 transitions (discarded 83 similar events)
[2024-05-23 08:40:39] [INFO ] Invariant cache hit.
[2024-05-23 08:40:39] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 183/294 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 156 constraints, problems are : Problem set: 0 solved, 264 unsolved in 6304 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 183/294 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 264/420 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 420 constraints, problems are : Problem set: 0 solved, 264 unsolved in 7583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
After SMT, in 14076ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 14079ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/158 places, 266/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14364 ms. Remains : 111/158 places, 266/394 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-06
Stuttering criterion allowed to conclude after 195 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-06 finished in 14421 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 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 132 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 132 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 126 transition count 302
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 113 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 113 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 111 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 111 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 110 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 110 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 109 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 109 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 109 transition count 262
Applied a total of 106 rules in 38 ms. Remains 109 /158 variables (removed 49) and now considering 262/394 (removed 132) transitions.
[2024-05-23 08:40:53] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 109 cols
[2024-05-23 08:40:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 08:40:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 08:40:53] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-23 08:40:53] [INFO ] Invariant cache hit.
[2024-05-23 08:40:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-23 08:40:54] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-23 08:40:54] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-23 08:40:54] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-23 08:40:54] [INFO ] Invariant cache hit.
[2024-05-23 08:40:54] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 260/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 13479ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 13482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/158 places, 262/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13757 ms. Remains : 109/158 places, 262/394 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-11
Product exploration explored 100000 steps with 586 reset in 149 ms.
Product exploration explored 100000 steps with 601 reset in 155 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19029 steps (52 resets) in 29 ms. (634 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 109 /109 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-23 08:41:08] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-23 08:41:08] [INFO ] Invariant cache hit.
[2024-05-23 08:41:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 08:41:08] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-23 08:41:08] [INFO ] Invariant cache hit.
[2024-05-23 08:41:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-23 08:41:08] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-23 08:41:08] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-23 08:41:08] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-23 08:41:08] [INFO ] Invariant cache hit.
[2024-05-23 08:41:08] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 260/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7352 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 13676ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 13679ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13937 ms. Remains : 109/109 places, 262/262 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20294 steps (56 resets) in 49 ms. (405 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 604 reset in 154 ms.
Product exploration explored 100000 steps with 588 reset in 158 ms.
Built C files in :
/tmp/ltsmin8082944061519547444
[2024-05-23 08:41:23] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-23 08:41:23] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:41:23] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-23 08:41:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:41:23] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-23 08:41:23] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:41:23] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8082944061519547444
Running compilation step : cd /tmp/ltsmin8082944061519547444;'/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 592 ms.
Running link step : cd /tmp/ltsmin8082944061519547444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8082944061519547444;'/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/stateBased9013380588499941769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-23 08:41:38] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-23 08:41:38] [INFO ] Invariant cache hit.
[2024-05-23 08:41:38] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 08:41:38] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-23 08:41:38] [INFO ] Invariant cache hit.
[2024-05-23 08:41:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-23 08:41:38] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-23 08:41:38] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-23 08:41:38] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-23 08:41:38] [INFO ] Invariant cache hit.
[2024-05-23 08:41:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 260/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6943 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 13138ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 13141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13395 ms. Remains : 109/109 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin11358830060479087484
[2024-05-23 08:41:51] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-23 08:41:51] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:41:51] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-23 08:41:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:41:51] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-23 08:41:51] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:41:51] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11358830060479087484
Running compilation step : cd /tmp/ltsmin11358830060479087484;'/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 556 ms.
Running link step : cd /tmp/ltsmin11358830060479087484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11358830060479087484;'/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/stateBased1330785170867489345.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 08:42:06] [INFO ] Flatten gal took : 11 ms
[2024-05-23 08:42:06] [INFO ] Flatten gal took : 10 ms
[2024-05-23 08:42:06] [INFO ] Time to serialize gal into /tmp/LTL17656223230318989724.gal : 2 ms
[2024-05-23 08:42:06] [INFO ] Time to serialize properties into /tmp/LTL5350019276339151445.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17656223230318989724.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11617423162330136103.hoa' '-atoms' '/tmp/LTL5350019276339151445.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...319
Loading property file /tmp/LTL5350019276339151445.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11617423162330136103.hoa
Detected timeout of ITS tools.
[2024-05-23 08:42:21] [INFO ] Flatten gal took : 10 ms
[2024-05-23 08:42:21] [INFO ] Flatten gal took : 9 ms
[2024-05-23 08:42:21] [INFO ] Time to serialize gal into /tmp/LTL15450262280793814456.gal : 1 ms
[2024-05-23 08:42:21] [INFO ] Time to serialize properties into /tmp/LTL16307074069931543289.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/LTL15450262280793814456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16307074069931543289.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(l256<=s3)"))))
Formula 0 simplified : FG!"(l256<=s3)"
Detected timeout of ITS tools.
[2024-05-23 08:42:36] [INFO ] Flatten gal took : 12 ms
[2024-05-23 08:42:36] [INFO ] Applying decomposition
[2024-05-23 08:42:36] [INFO ] Flatten gal took : 10 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/graph9621964236682453979.txt' '-o' '/tmp/graph9621964236682453979.bin' '-w' '/tmp/graph9621964236682453979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9621964236682453979.bin' '-l' '-1' '-v' '-w' '/tmp/graph9621964236682453979.weights' '-q' '0' '-e' '0.001'
[2024-05-23 08:42:36] [INFO ] Decomposing Gal with order
[2024-05-23 08:42:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 08:42:37] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-23 08:42:37] [INFO ] Flatten gal took : 14 ms
[2024-05-23 08:42:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 2 ms.
[2024-05-23 08:42:37] [INFO ] Time to serialize gal into /tmp/LTL9869462695801576027.gal : 2 ms
[2024-05-23 08:42:37] [INFO ] Time to serialize properties into /tmp/LTL18286717257269540964.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/LTL9869462695801576027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18286717257269540964.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 : !((G(F("(gu3.l256<=gu3.s3)"))))
Formula 0 simplified : FG!"(gu3.l256<=gu3.s3)"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-11 finished in 118332 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(X(F((p0 U (p1||G(p0)))))))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 150 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 143 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 143 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 136 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 136 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 129 transition count 310
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 129 transition count 310
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 122 transition count 294
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 122 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 116 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 116 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 110 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 110 transition count 264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 106 transition count 256
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 106 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 103 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 103 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 101 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 101 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 99 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 98 transition count 240
Applied a total of 122 rules in 19 ms. Remains 98 /158 variables (removed 60) and now considering 240/394 (removed 154) transitions.
[2024-05-23 08:42:52] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-23 08:42:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:42:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 08:42:52] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-23 08:42:52] [INFO ] Invariant cache hit.
[2024-05-23 08:42:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 08:42:52] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-23 08:42:52] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-23 08:42:52] [INFO ] Invariant cache hit.
[2024-05-23 08:42:52] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 4967 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 11514ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 11517ms
Starting structural reductions in LTL mode, iteration 1 : 98/158 places, 240/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11755 ms. Remains : 98/158 places, 240/394 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-12
Product exploration explored 100000 steps with 20000 reset in 111 ms.
Product exploration explored 100000 steps with 20000 reset in 111 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40001 steps (71 resets) in 104 ms. (380 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
[2024-05-23 08:43:04] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-23 08:43:04] [INFO ] Invariant cache hit.
[2024-05-23 08:43:04] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 49/259 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/98 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-23 08:43:05] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-23 08:43:05] [INFO ] Invariant cache hit.
[2024-05-23 08:43:05] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 08:43:05] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-23 08:43:05] [INFO ] Invariant cache hit.
[2024-05-23 08:43:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 08:43:05] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-23 08:43:05] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-23 08:43:05] [INFO ] Invariant cache hit.
[2024-05-23 08:43:05] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6301 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 11530ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 11534ms
Finished structural reductions in LTL mode , in 1 iterations and 11761 ms. Remains : 98/98 places, 240/240 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 576 steps (2 resets) in 7 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 184 ms.
Product exploration explored 100000 steps with 20000 reset in 224 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 240/240 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 98 transition count 238
Applied a total of 2 rules in 11 ms. Remains 98 /98 variables (removed 0) and now considering 238/240 (removed 2) transitions.
[2024-05-23 08:43:18] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-23 08:43:18] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
// Phase 1: matrix 160 rows 98 cols
[2024-05-23 08:43:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:43:18] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 373 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 11279ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 11281ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/98 places, 238/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11297 ms. Remains : 98/98 places, 238/240 transitions.
Built C files in :
/tmp/ltsmin5617249096276452584
[2024-05-23 08:43:29] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5617249096276452584
Running compilation step : cd /tmp/ltsmin5617249096276452584;'/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 402 ms.
Running link step : cd /tmp/ltsmin5617249096276452584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5617249096276452584;'/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/stateBased15510637819964241414.hoa' '--buchi-type=spotba'
LTSmin run took 164 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b002-LTLCardinality-12 finished in 38424 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 G(!p0))))'
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 372
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 138 transition count 334
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 138 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 132 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 132 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 126 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 116 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 112 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 105 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 104 transition count 254
Applied a total of 112 rules in 17 ms. Remains 104 /158 variables (removed 54) and now considering 254/394 (removed 140) transitions.
[2024-05-23 08:43:30] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2024-05-23 08:43:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:43:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-23 08:43:30] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 08:43:30] [INFO ] Invariant cache hit.
[2024-05-23 08:43:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 08:43:30] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-23 08:43:30] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 08:43:30] [INFO ] Invariant cache hit.
[2024-05-23 08:43:30] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5700 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 252/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 398 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 12549ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 12551ms
Starting structural reductions in LTL mode, iteration 1 : 104/158 places, 254/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12804 ms. Remains : 104/158 places, 254/394 transitions.
Stuttering acceptance computed with spot in 151 ms :[p0, p0, p0, true]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 39965 steps with 152 reset in 96 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-13 finished in 13063 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(G(p0)))))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 372
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 139 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 139 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 134 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 134 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 129 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 115 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 110 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 108 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 107 transition count 260
Applied a total of 106 rules in 11 ms. Remains 107 /158 variables (removed 51) and now considering 260/394 (removed 134) transitions.
[2024-05-23 08:43:43] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 107 cols
[2024-05-23 08:43:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:43:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-23 08:43:43] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 08:43:43] [INFO ] Invariant cache hit.
[2024-05-23 08:43:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 08:43:43] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-23 08:43:43] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 08:43:43] [INFO ] Invariant cache hit.
[2024-05-23 08:43:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 258/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 13477ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 13479ms
Starting structural reductions in LTL mode, iteration 1 : 107/158 places, 260/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13714 ms. Remains : 107/158 places, 260/394 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 5455 steps with 12 reset in 10 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-14 finished in 13898 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||F(G(p1)))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 150 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 144 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 138 transition count 334
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 138 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 132 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 132 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 126 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 116 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 113 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 110 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 108 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 108 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 106 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 105 transition count 256
Applied a total of 108 rules in 10 ms. Remains 105 /158 variables (removed 53) and now considering 256/394 (removed 138) transitions.
[2024-05-23 08:43:57] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
// Phase 1: matrix 175 rows 105 cols
[2024-05-23 08:43:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:43:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 08:43:57] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
[2024-05-23 08:43:57] [INFO ] Invariant cache hit.
[2024-05-23 08:43:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 08:43:57] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-23 08:43:57] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
[2024-05-23 08:43:57] [INFO ] Invariant cache hit.
[2024-05-23 08:43:57] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 175/280 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 42/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 149 constraints, problems are : Problem set: 0 solved, 254 unsolved in 5702 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 175/280 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 42/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 403 constraints, problems are : Problem set: 0 solved, 254 unsolved in 7020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 12881ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 12885ms
Starting structural reductions in LTL mode, iteration 1 : 105/158 places, 256/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13107 ms. Remains : 105/158 places, 256/394 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b002-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b002-LTLCardinality-15 finished in 13555 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((F((X(G(p0))&&G(p1)))||G(p2))))'
Found a Lengthening insensitive property : FunctionPointer-PT-b002-LTLCardinality-01
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 149 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 149 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 142 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 142 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 136 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 136 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 130 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 130 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 124 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 124 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 105 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 104 transition count 254
Applied a total of 112 rules in 25 ms. Remains 104 /158 variables (removed 54) and now considering 254/394 (removed 140) transitions.
[2024-05-23 08:44:11] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2024-05-23 08:44:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:44:11] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-23 08:44:11] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 08:44:11] [INFO ] Invariant cache hit.
[2024-05-23 08:44:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 08:44:11] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-23 08:44:11] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 08:44:11] [INFO ] Invariant cache hit.
[2024-05-23 08:44:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5715 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 252/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 398 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6501 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 12375ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 12380ms
Starting structural reductions in LI_LTL mode, iteration 1 : 104/158 places, 254/394 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12681 ms. Remains : 104/158 places, 254/394 transitions.
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-01
Product exploration explored 100000 steps with 313 reset in 178 ms.
Product exploration explored 100000 steps with 313 reset in 176 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 349 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
RANDOM walk for 40000 steps (66 resets) in 76 ms. (519 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2024-05-23 08:44:24] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 08:44:24] [INFO ] Invariant cache hit.
[2024-05-23 08:44:24] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 48/276 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/104 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 15 factoid took 450 ms. Reduced automaton from 6 states, 19 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 254/254 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 104 transition count 252
Applied a total of 2 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 252/254 (removed 2) transitions.
[2024-05-23 08:44:26] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2024-05-23 08:44:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:44:26] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 08:44:26] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 08:44:26] [INFO ] Invariant cache hit.
[2024-05-23 08:44:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 08:44:26] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-23 08:44:26] [INFO ] Redundant transitions in 0 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-23 08:44:26] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 08:44:26] [INFO ] Invariant cache hit.
[2024-05-23 08:44:26] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 146 constraints, problems are : Problem set: 0 solved, 250 unsolved in 5735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 250/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 396 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 12425ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 12428ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 252/254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12692 ms. Remains : 104/104 places, 252/254 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/252 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 296 ms. Reduced automaton from 8 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
RANDOM walk for 40000 steps (107 resets) in 111 ms. (357 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
[2024-05-23 08:44:39] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 08:44:39] [INFO ] Invariant cache hit.
[2024-05-23 08:44:39] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 48/275 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/104 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 432 ms. Reduced automaton from 8 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Product exploration explored 100000 steps with 511 reset in 157 ms.
Product exploration explored 100000 steps with 494 reset in 169 ms.
Built C files in :
/tmp/ltsmin8136683519240085292
[2024-05-23 08:44:41] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-23 08:44:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:44:41] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-23 08:44:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:44:41] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-23 08:44:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:44:41] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8136683519240085292
Running compilation step : cd /tmp/ltsmin8136683519240085292;'/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 553 ms.
Running link step : cd /tmp/ltsmin8136683519240085292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8136683519240085292;'/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/stateBased1517493841535841431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 252/252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 248
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 4 place count 103 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 234
Applied a total of 16 rules in 26 ms. Remains 97 /104 variables (removed 7) and now considering 234/252 (removed 18) transitions.
[2024-05-23 08:44:56] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-23 08:44:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 08:44:56] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-23 08:44:56] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 08:44:56] [INFO ] Invariant cache hit.
[2024-05-23 08:44:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 08:44:56] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-23 08:44:56] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-23 08:44:56] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 08:44:56] [INFO ] Invariant cache hit.
[2024-05-23 08:44:56] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 4792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 368 constraints, problems are : Problem set: 0 solved, 232 unsolved in 5901 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 10829ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 10831ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/104 places, 234/252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11076 ms. Remains : 97/104 places, 234/252 transitions.
Built C files in :
/tmp/ltsmin8724005643782224064
[2024-05-23 08:45:07] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2024-05-23 08:45:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:45:07] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2024-05-23 08:45:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:45:07] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2024-05-23 08:45:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:45:07] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8724005643782224064
Running compilation step : cd /tmp/ltsmin8724005643782224064;'/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 491 ms.
Running link step : cd /tmp/ltsmin8724005643782224064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8724005643782224064;'/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/stateBased653229563130341993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 08:45:22] [INFO ] Flatten gal took : 10 ms
[2024-05-23 08:45:22] [INFO ] Flatten gal took : 9 ms
[2024-05-23 08:45:22] [INFO ] Time to serialize gal into /tmp/LTL3211045335626884522.gal : 2 ms
[2024-05-23 08:45:22] [INFO ] Time to serialize properties into /tmp/LTL13164595904186939656.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3211045335626884522.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6242628706346956215.hoa' '-atoms' '/tmp/LTL13164595904186939656.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...318
Loading property file /tmp/LTL13164595904186939656.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6242628706346956215.hoa
Detected timeout of ITS tools.
[2024-05-23 08:45:37] [INFO ] Flatten gal took : 9 ms
[2024-05-23 08:45:37] [INFO ] Flatten gal took : 8 ms
[2024-05-23 08:45:37] [INFO ] Time to serialize gal into /tmp/LTL17232981857753203056.gal : 2 ms
[2024-05-23 08:45:37] [INFO ] Time to serialize properties into /tmp/LTL12007693520860111777.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/LTL17232981857753203056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12007693520860111777.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...277
Read 1 LTL properties
Checking formula 0 : !((X((F((X(G("(l30<2)")))&&(G("(l36<2)"))))||(G("((l41>0)&&(l164<3))")))))
Formula 0 simplified : X(G(XF!"(l30<2)" | F!"(l36<2)") & F!"((l41>0)&&(l164<3))")
Detected timeout of ITS tools.
[2024-05-23 08:45:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 08:45:52] [INFO ] Applying decomposition
[2024-05-23 08:45:52] [INFO ] Flatten gal took : 9 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/graph10643745618262950858.txt' '-o' '/tmp/graph10643745618262950858.bin' '-w' '/tmp/graph10643745618262950858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10643745618262950858.bin' '-l' '-1' '-v' '-w' '/tmp/graph10643745618262950858.weights' '-q' '0' '-e' '0.001'
[2024-05-23 08:45:52] [INFO ] Decomposing Gal with order
[2024-05-23 08:45:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 08:45:52] [INFO ] Removed a total of 416 redundant transitions.
[2024-05-23 08:45:52] [INFO ] Flatten gal took : 24 ms
[2024-05-23 08:45:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 6 ms.
[2024-05-23 08:45:52] [INFO ] Time to serialize gal into /tmp/LTL2943137226081119420.gal : 2 ms
[2024-05-23 08:45:52] [INFO ] Time to serialize properties into /tmp/LTL8706172256235424519.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/LTL2943137226081119420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8706172256235424519.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((X((F((X(G("(i5.u6.l30<2)")))&&(G("(i4.u5.l36<2)"))))||(G("((i2.u3.l41>0)&&(i10.i0.u23.l164<3))")))))
Formula 0 simplified : X(G(XF!"(i5.u6.l30<2)" | F!"(i4.u5.l36<2)") & F!"((i2.u3.l41>0)&&(i10.i0.u23.l164<3))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-01 finished in 116783 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)))'
[2024-05-23 08:46:07] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13798180457510189485
[2024-05-23 08:46:07] [INFO ] Applying decomposition
[2024-05-23 08:46:07] [INFO ] Computing symmetric may disable matrix : 394 transitions.
[2024-05-23 08:46:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:46:07] [INFO ] Computing symmetric may enable matrix : 394 transitions.
[2024-05-23 08:46:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:46:07] [INFO ] Flatten gal took : 10 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/graph12603582908455102175.txt' '-o' '/tmp/graph12603582908455102175.bin' '-w' '/tmp/graph12603582908455102175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12603582908455102175.bin' '-l' '-1' '-v' '-w' '/tmp/graph12603582908455102175.weights' '-q' '0' '-e' '0.001'
[2024-05-23 08:46:07] [INFO ] Decomposing Gal with order
[2024-05-23 08:46:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 08:46:07] [INFO ] Computing Do-Not-Accords matrix : 394 transitions.
[2024-05-23 08:46:07] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 08:46:07] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13798180457510189485
Running compilation step : cd /tmp/ltsmin13798180457510189485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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 08:46:07] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-23 08:46:07] [INFO ] Flatten gal took : 18 ms
[2024-05-23 08:46:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 2 ms.
[2024-05-23 08:46:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality15887433590064684331.gal : 7 ms
[2024-05-23 08:46:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality6320177959076106267.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/LTLCardinality15887433590064684331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6320177959076106267.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...298
Read 2 LTL properties
Checking formula 0 : !((X((F((X(G("(gi0.gu0.l30<2)")))&&(G("(gi0.gu0.l36<2)"))))||(G("((gi0.gu0.l41>0)&&(gi0.gu0.l164<3))")))))
Formula 0 simplified : X(G(XF!"(gi0.gu0.l30<2)" | F!"(gi0.gu0.l36<2)") & F!"((gi0.gu0.l41>0)&&(gi0.gu0.l164<3))")
Compilation finished in 922 ms.
Running link step : cd /tmp/ltsmin13798180457510189485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13798180457510189485;'/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' '--ltl' 'X((<>((X([]((LTLAPp0==true)))&&[]((LTLAPp1==true))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.041: LTL layer: formula: X((<>((X([]((LTLAPp0==true)))&&[]((LTLAPp1==true))))||[]((LTLAPp2==true))))
pins2lts-mc-linux64( 6/ 8), 0.041: "X((<>((X([]((LTLAPp0==true)))&&[]((LTLAPp1==true))))||[]((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.041: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.130: There are 399 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.130: State length is 159, there are 412 groups
pins2lts-mc-linux64( 0/ 8), 0.130: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.130: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.130: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.130: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.186: [Blue] ~120 levels ~960 states ~3648 transitions
pins2lts-mc-linux64( 5/ 8), 0.271: [Blue] ~240 levels ~1920 states ~8368 transitions
pins2lts-mc-linux64( 1/ 8), 0.443: [Blue] ~480 levels ~3840 states ~16032 transitions
pins2lts-mc-linux64( 1/ 8), 0.654: [Blue] ~960 levels ~7680 states ~33160 transitions
pins2lts-mc-linux64( 2/ 8), 1.422: [Blue] ~1920 levels ~15360 states ~57512 transitions
pins2lts-mc-linux64( 2/ 8), 2.311: [Blue] ~3840 levels ~30720 states ~115112 transitions
pins2lts-mc-linux64( 2/ 8), 2.806: [Blue] ~7680 levels ~61440 states ~230312 transitions
pins2lts-mc-linux64( 2/ 8), 3.506: [Blue] ~15360 levels ~122880 states ~460712 transitions
pins2lts-mc-linux64( 2/ 8), 4.550: [Blue] ~30720 levels ~245760 states ~921512 transitions
pins2lts-mc-linux64( 2/ 8), 6.198: [Blue] ~61440 levels ~491520 states ~1843112 transitions
pins2lts-mc-linux64( 6/ 8), 9.259: [Blue] ~122880 levels ~983040 states ~3194864 transitions
pins2lts-mc-linux64( 6/ 8), 15.315: [Blue] ~245760 levels ~1966080 states ~6389744 transitions
pins2lts-mc-linux64( 6/ 8), 27.401: [Blue] ~491520 levels ~3932160 states ~12779504 transitions
pins2lts-mc-linux64( 6/ 8), 51.873: [Blue] ~983040 levels ~7864320 states ~25559024 transitions
pins2lts-mc-linux64( 4/ 8), 58.315: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 58.403:
pins2lts-mc-linux64( 0/ 8), 58.403: Explored 8113535 states 33499703 transitions, fanout: 4.129
pins2lts-mc-linux64( 0/ 8), 58.403: Total exploration time 58.240 sec (58.170 sec minimum, 58.201 sec on average)
pins2lts-mc-linux64( 0/ 8), 58.403: States per second: 139312, Transitions per second: 575201
pins2lts-mc-linux64( 0/ 8), 58.403:
pins2lts-mc-linux64( 0/ 8), 58.403: State space has 28808218 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 58.403: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 58.403: blue states: 8113535 (28.16%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 58.403: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 58.403: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 58.403:
pins2lts-mc-linux64( 0/ 8), 58.403: Total memory used for local state coloring: 120.0MB
pins2lts-mc-linux64( 0/ 8), 58.403:
pins2lts-mc-linux64( 0/ 8), 58.403: Queue width: 8B, total height: 7861085, memory: 59.98MB
pins2lts-mc-linux64( 0/ 8), 58.403: Tree memory: 475.8MB, 17.3 B/state, compr.: 2.7%
pins2lts-mc-linux64( 0/ 8), 58.404: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 58.404: Stored 396 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 58.404: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 58.404: Est. total memory use: 535.8MB (~1084.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13798180457510189485;'/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' '--ltl' 'X((<>((X([]((LTLAPp0==true)))&&[]((LTLAPp1==true))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13798180457510189485;'/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' '--ltl' 'X((<>((X([]((LTLAPp0==true)))&&[]((LTLAPp1==true))))||[]((LTLAPp2==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)
ITS-tools command line returned an error code 137
[2024-05-23 09:01:40] [INFO ] Flatten gal took : 13 ms
[2024-05-23 09:01:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality6413355300123397073.gal : 3 ms
[2024-05-23 09:01:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality7149850466899738999.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/LTLCardinality6413355300123397073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7149850466899738999.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 2 LTL properties
Checking formula 0 : !((X((F((X(G("(l30<2)")))&&(G("(l36<2)"))))||(G("((l41>0)&&(l164<3))")))))
Formula 0 simplified : X(G(XF!"(l30<2)" | F!"(l36<2)") & F!"((l41>0)&&(l164<3))")
ITS-tools command line returned an error code 137
[2024-05-23 09:21:13] [INFO ] Flatten gal took : 24 ms
[2024-05-23 09:21:13] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 09:21:13] [INFO ] Transformed 158 places.
[2024-05-23 09:21:13] [INFO ] Transformed 394 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 09:21:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality14933124589511831162.gal : 2 ms
[2024-05-23 09:21:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality15695803744562195718.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/LTLCardinality14933124589511831162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15695803744562195718.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...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F((X(G("(l30<2)")))&&(G("(l36<2)"))))||(G("((l41>0)&&(l164<3))")))))
Formula 0 simplified : X(G(XF!"(l30<2)" | F!"(l36<2)") & F!"((l41>0)&&(l164<3))")

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-b002"
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-b002, 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-171640602900219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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