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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:04 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-b032-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716467651160

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 12:34:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 12:34:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:34:12] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-05-23 12:34:12] [INFO ] Transformed 306 places.
[2024-05-23 12:34:12] [INFO ] Transformed 840 transitions.
[2024-05-23 12:34:12] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b032-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 33 place count 189 transition count 540
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 189 transition count 540
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 106 place count 189 transition count 490
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 118 place count 177 transition count 466
Iterating global reduction 2 with 12 rules applied. Total rules applied 130 place count 177 transition count 466
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 146 place count 177 transition count 450
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 171 transition count 438
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 171 transition count 438
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 163 place count 166 transition count 418
Iterating global reduction 3 with 5 rules applied. Total rules applied 168 place count 166 transition count 418
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 162 transition count 410
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 162 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 161 transition count 406
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 161 transition count 406
Applied a total of 178 rules in 136 ms. Remains 161 /222 variables (removed 61) and now considering 406/648 (removed 242) transitions.
[2024-05-23 12:34:13] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
// Phase 1: matrix 275 rows 161 cols
[2024-05-23 12:34:13] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 12:34:13] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-23 12:34:13] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-23 12:34:13] [INFO ] Invariant cache hit.
[2024-05-23 12:34:13] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-23 12:34:13] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-23 12:34:13] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-23 12:34:13] [INFO ] Invariant cache hit.
[2024-05-23 12:34:13] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 275/436 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 58/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 221 constraints, problems are : Problem set: 0 solved, 404 unsolved in 14883 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 275/436 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 58/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 404/625 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 625 constraints, problems are : Problem set: 0 solved, 404 unsolved in 17020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
After SMT, in 32556ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 32581ms
Starting structural reductions in LTL mode, iteration 1 : 161/222 places, 406/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33543 ms. Remains : 161/222 places, 406/648 transitions.
Support contains 23 out of 161 places after structural reductions.
[2024-05-23 12:34:46] [INFO ] Flatten gal took : 53 ms
[2024-05-23 12:34:46] [INFO ] Flatten gal took : 25 ms
[2024-05-23 12:34:46] [INFO ] Input system was already deterministic with 406 transitions.
RANDOM walk for 40040 steps (36 resets) in 1607 ms. (24 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
[2024-05-23 12:34:47] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-23 12:34:47] [INFO ] Invariant cache hit.
[2024-05-23 12:34:47] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem AtomicPropp2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/175 variables, 50/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 24/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 174/349 variables, 62/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 26/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 70/419 variables, 42/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 8/214 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/434 variables, 5/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/436 variables, 2/221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/436 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/436 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 221 constraints, problems are : Problem set: 1 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 266/338 variables, 103/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 50/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/344 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/419 variables, 49/207 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 8/215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/434 variables, 5/220 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/436 variables, 2/222 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/436 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/436 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 222 constraints, problems are : Problem set: 1 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 366ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 759 steps, including 6 resets, run visited all 1 properties in 5 ms. (steps per millisecond=151 )
Parikh walk visited 1 properties in 18 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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((G(!p0)||(!p0&&G(F(!p1)))))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 380
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 152 transition count 374
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 146 transition count 358
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 146 transition count 358
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 141 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 141 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 136 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 136 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 131 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 131 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 126 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 126 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 111 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 111 transition count 270
Applied a total of 106 rules in 27 ms. Remains 111 /161 variables (removed 50) and now considering 270/406 (removed 136) transitions.
[2024-05-23 12:34:48] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
// Phase 1: matrix 184 rows 111 cols
[2024-05-23 12:34:48] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 12:34:48] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 12:34:48] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-23 12:34:48] [INFO ] Invariant cache hit.
[2024-05-23 12:34:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 12:34:48] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-23 12:34:48] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-23 12:34:48] [INFO ] Invariant cache hit.
[2024-05-23 12:34:48] [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, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 184/295 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 156 constraints, problems are : Problem set: 0 solved, 268 unsolved in 7183 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: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 184/295 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 268/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 424 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8841 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: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 16293ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 16298ms
Starting structural reductions in LTL mode, iteration 1 : 111/161 places, 270/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16559 ms. Remains : 111/161 places, 270/406 transitions.
Stuttering acceptance computed with spot in 345 ms :[p0, (AND p1 p0), (AND p1 p0), p0, p0]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-00
Product exploration explored 100000 steps with 915 reset in 382 ms.
Product exploration explored 100000 steps with 937 reset in 326 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 p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 102 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40036 steps (32 resets) in 194 ms. (205 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
[2024-05-23 12:35:05] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-23 12:35:05] [INFO ] Invariant cache hit.
[2024-05-23 12:35:05] [INFO ] State equation strengthened by 43 read => feed constraints.
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) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 193/249 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 35/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/255 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/292 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/295 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 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: 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) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 193/249 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 35/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/292 variables, 29/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/295 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/295 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8041 steps, including 67 resets, run visited all 1 properties in 31 ms. (steps per millisecond=259 )
Parikh walk visited 1 properties in 30 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 270/270 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 111 transition count 264
Applied a total of 6 rules in 44 ms. Remains 111 /111 variables (removed 0) and now considering 264/270 (removed 6) transitions.
[2024-05-23 12:35:06] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 111 cols
[2024-05-23 12:35:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 12:35:06] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 12:35:06] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:35:06] [INFO ] Invariant cache hit.
[2024-05-23 12:35:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 12:35:06] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-23 12:35:06] [INFO ] Redundant transitions in 12 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-23 12:35:06] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:35:06] [INFO ] Invariant cache hit.
[2024-05-23 12:35:06] [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, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6999 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: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8647 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: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 15860ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 15863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 264/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16149 ms. Remains : 111/111 places, 264/270 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) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 31082 steps (30 resets) in 95 ms. (323 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 329 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 919 reset in 253 ms.
Product exploration explored 100000 steps with 948 reset in 300 ms.
Built C files in :
/tmp/ltsmin13757036028568215173
[2024-05-23 12:35:24] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-23 12:35:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:35:24] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-23 12:35:24] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:35:24] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-23 12:35:24] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:35:24] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13757036028568215173
Running compilation step : cd /tmp/ltsmin13757036028568215173;'/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 728 ms.
Running link step : cd /tmp/ltsmin13757036028568215173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13757036028568215173;'/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/stateBased1811680713407683378.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 264/264 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-23 12:35:39] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:35:39] [INFO ] Invariant cache hit.
[2024-05-23 12:35:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-23 12:35:39] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:35:39] [INFO ] Invariant cache hit.
[2024-05-23 12:35:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 12:35:39] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-23 12:35:39] [INFO ] Redundant transitions in 4 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-23 12:35:39] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:35:39] [INFO ] Invariant cache hit.
[2024-05-23 12:35: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, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7133 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: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8627 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: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 15988ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 15992ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16221 ms. Remains : 111/111 places, 264/264 transitions.
Built C files in :
/tmp/ltsmin3190000100084831106
[2024-05-23 12:35:55] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-23 12:35:55] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:35:55] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-23 12:35:55] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:35:55] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-23 12:35:55] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:35:55] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3190000100084831106
Running compilation step : cd /tmp/ltsmin3190000100084831106;'/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 728 ms.
Running link step : cd /tmp/ltsmin3190000100084831106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3190000100084831106;'/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/stateBased6917905278743494356.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 12:36:10] [INFO ] Flatten gal took : 13 ms
[2024-05-23 12:36:10] [INFO ] Flatten gal took : 13 ms
[2024-05-23 12:36:10] [INFO ] Time to serialize gal into /tmp/LTL11991824885650673351.gal : 4 ms
[2024-05-23 12:36:10] [INFO ] Time to serialize properties into /tmp/LTL8123863069126999126.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11991824885650673351.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14505163002335568827.hoa' '-atoms' '/tmp/LTL8123863069126999126.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/LTL8123863069126999126.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14505163002335568827.hoa
Detected timeout of ITS tools.
[2024-05-23 12:36:25] [INFO ] Flatten gal took : 12 ms
[2024-05-23 12:36:25] [INFO ] Flatten gal took : 13 ms
[2024-05-23 12:36:25] [INFO ] Time to serialize gal into /tmp/LTL6410871704568113631.gal : 5 ms
[2024-05-23 12:36:25] [INFO ] Time to serialize properties into /tmp/LTL4568045925370085419.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/LTL6410871704568113631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4568045925370085419.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...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((s1<1)||(l153<1))"))||((G(F("((s1<1)||(l231<1))")))&&("((s1<1)||(l153<1))"))))))
Formula 0 simplified : XG(F!"((s1<1)||(l153<1))" & (!"((s1<1)||(l153<1))" | FG!"((s1<1)||(l231<1))"))
Detected timeout of ITS tools.
[2024-05-23 12:36:40] [INFO ] Flatten gal took : 11 ms
[2024-05-23 12:36:40] [INFO ] Applying decomposition
[2024-05-23 12:36:40] [INFO ] Flatten gal took : 14 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/graph18246564684899050087.txt' '-o' '/tmp/graph18246564684899050087.bin' '-w' '/tmp/graph18246564684899050087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18246564684899050087.bin' '-l' '-1' '-v' '-w' '/tmp/graph18246564684899050087.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:36:41] [INFO ] Decomposing Gal with order
[2024-05-23 12:36:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:36:41] [INFO ] Removed a total of 438 redundant transitions.
[2024-05-23 12:36:41] [INFO ] Flatten gal took : 52 ms
[2024-05-23 12:36:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 14 ms.
[2024-05-23 12:36:41] [INFO ] Time to serialize gal into /tmp/LTL1796735036445362343.gal : 4 ms
[2024-05-23 12:36:41] [INFO ] Time to serialize properties into /tmp/LTL5598681991098498406.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/LTL1796735036445362343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5598681991098498406.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((G("((i1.u1.s1<1)||(i13.i0.u26.l153<1))"))||((G(F("((i1.u1.s1<1)||(i13.i0.u27.l231<1))")))&&("((i1.u1.s1<1)||(i13.i0.u26.l153<1...164
Formula 0 simplified : XG(F!"((i1.u1.s1<1)||(i13.i0.u26.l153<1))" & (!"((i1.u1.s1<1)||(i13.i0.u26.l153<1))" | FG!"((i1.u1.s1<1)||(i13.i0.u27.l231<1))"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b032-LTLFireability-00 finished in 128237 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 U p1))||F(X(X(X(X(p0))))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 144 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 120 transition count 288
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 115 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 115 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 110 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 110 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 107 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 107 transition count 262
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 118 place count 107 transition count 258
Applied a total of 118 rules in 46 ms. Remains 107 /161 variables (removed 54) and now considering 258/406 (removed 148) transitions.
[2024-05-23 12:36:56] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2024-05-23 12:36:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 12:36:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-23 12:36:56] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-23 12:36:56] [INFO ] Invariant cache hit.
[2024-05-23 12:36:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 12:36:56] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-23 12:36:56] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 12:36:56] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-23 12:36:56] [INFO ] Invariant cache hit.
[2024-05-23 12:36:56] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 405 constraints, problems are : Problem set: 0 solved, 256 unsolved in 8550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 15340ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 15343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/161 places, 258/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15630 ms. Remains : 107/161 places, 258/406 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-01
Product exploration explored 100000 steps with 1363 reset in 229 ms.
Product exploration explored 100000 steps with 1361 reset in 237 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) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 25979 steps (34 resets) in 71 ms. (360 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 14 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-23 12:37:13] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-23 12:37:13] [INFO ] Invariant cache hit.
[2024-05-23 12:37:13] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 12:37:13] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-23 12:37:13] [INFO ] Invariant cache hit.
[2024-05-23 12:37:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 12:37:13] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-23 12:37:13] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 12:37:13] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-23 12:37:13] [INFO ] Invariant cache hit.
[2024-05-23 12:37:13] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6689 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 405 constraints, problems are : Problem set: 0 solved, 256 unsolved in 8714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 15598ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 15601ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15842 ms. Remains : 107/107 places, 258/258 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) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 32509 steps (36 resets) in 87 ms. (369 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1363 reset in 225 ms.
Product exploration explored 100000 steps with 1402 reset in 230 ms.
Built C files in :
/tmp/ltsmin6667185176533614985
[2024-05-23 12:37:30] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2024-05-23 12:37:30] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:37:30] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2024-05-23 12:37:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:37:30] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2024-05-23 12:37:30] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:37:30] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6667185176533614985
Running compilation step : cd /tmp/ltsmin6667185176533614985;'/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 582 ms.
Running link step : cd /tmp/ltsmin6667185176533614985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6667185176533614985;'/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/stateBased6649801528304730790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 13 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-23 12:37:45] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-23 12:37:45] [INFO ] Invariant cache hit.
[2024-05-23 12:37:45] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 12:37:45] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-23 12:37:45] [INFO ] Invariant cache hit.
[2024-05-23 12:37:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 12:37:45] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-23 12:37:45] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 12:37:45] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-23 12:37:45] [INFO ] Invariant cache hit.
[2024-05-23 12:37:45] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 405 constraints, problems are : Problem set: 0 solved, 256 unsolved in 8348 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 15139ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 15142ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15388 ms. Remains : 107/107 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin10149525217866845876
[2024-05-23 12:38:00] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2024-05-23 12:38:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:38:00] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2024-05-23 12:38:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:38:00] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2024-05-23 12:38:00] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:38:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10149525217866845876
Running compilation step : cd /tmp/ltsmin10149525217866845876;'/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 594 ms.
Running link step : cd /tmp/ltsmin10149525217866845876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10149525217866845876;'/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/stateBased7208565141786034992.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 12:38:15] [INFO ] Flatten gal took : 11 ms
[2024-05-23 12:38:15] [INFO ] Flatten gal took : 10 ms
[2024-05-23 12:38:15] [INFO ] Time to serialize gal into /tmp/LTL9423671953098998728.gal : 3 ms
[2024-05-23 12:38:15] [INFO ] Time to serialize properties into /tmp/LTL11094833101410157138.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/LTL9423671953098998728.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4243472859673436007.hoa' '-atoms' '/tmp/LTL11094833101410157138.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/LTL11094833101410157138.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4243472859673436007.hoa
Detected timeout of ITS tools.
[2024-05-23 12:38:30] [INFO ] Flatten gal took : 11 ms
[2024-05-23 12:38:30] [INFO ] Flatten gal took : 9 ms
[2024-05-23 12:38:30] [INFO ] Time to serialize gal into /tmp/LTL7345204255337045813.gal : 5 ms
[2024-05-23 12:38:30] [INFO ] Time to serialize properties into /tmp/LTL4502934505144836521.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/LTL7345204255337045813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4502934505144836521.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...275
Read 1 LTL properties
Checking formula 0 : !((G((F(!(("((s0>=1)&&(l240>=1))")U("((s3>=1)&&(l45>=1))"))))||(F(X(X(X(X("((s0>=1)&&(l240>=1))")))))))))
Formula 0 simplified : F(G("((s0>=1)&&(l240>=1))" U "((s3>=1)&&(l45>=1))") & XXXXG!"((s0>=1)&&(l240>=1))")
Detected timeout of ITS tools.
[2024-05-23 12:38:45] [INFO ] Flatten gal took : 15 ms
[2024-05-23 12:38:45] [INFO ] Applying decomposition
[2024-05-23 12:38:45] [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/graph17517526605979074119.txt' '-o' '/tmp/graph17517526605979074119.bin' '-w' '/tmp/graph17517526605979074119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17517526605979074119.bin' '-l' '-1' '-v' '-w' '/tmp/graph17517526605979074119.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:38:46] [INFO ] Decomposing Gal with order
[2024-05-23 12:38:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:38:46] [INFO ] Removed a total of 432 redundant transitions.
[2024-05-23 12:38:46] [INFO ] Flatten gal took : 19 ms
[2024-05-23 12:38:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 7 ms.
[2024-05-23 12:38:46] [INFO ] Time to serialize gal into /tmp/LTL9938686264906661904.gal : 4 ms
[2024-05-23 12:38:46] [INFO ] Time to serialize properties into /tmp/LTL3396453593390605163.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/LTL9938686264906661904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3396453593390605163.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 : !((G((F(!(("((i9.u1.s0>=1)&&(i11.u28.l240>=1))")U("((i3.u0.s3>=1)&&(i3.u4.l45>=1))"))))||(F(X(X(X(X("((i9.u1.s0>=1)&&(i11.u28.l240>=1)...166
Formula 0 simplified : F(G("((i9.u1.s0>=1)&&(i11.u28.l240>=1))" U "((i3.u0.s3>=1)&&(i3.u4.l45>=1))") & XXXXG!"((i9.u1.s0>=1)&&(i11.u28.l240>=1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b032-LTLFireability-01 finished in 124869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 380
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 152 transition count 376
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 145 transition count 356
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 145 transition count 356
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 139 transition count 336
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 139 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 133 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 133 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 121 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 121 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 116 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 116 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 111 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 111 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 108 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 108 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 107 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 107 transition count 264
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 116 place count 107 transition count 260
Applied a total of 116 rules in 37 ms. Remains 107 /161 variables (removed 54) and now considering 260/406 (removed 146) transitions.
[2024-05-23 12:39:01] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 107 cols
[2024-05-23 12:39:01] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 12:39:01] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 12:39:01] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-23 12:39:01] [INFO ] Invariant cache hit.
[2024-05-23 12:39:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 12:39:01] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-23 12:39:01] [INFO ] Redundant transitions in 2 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 12:39:01] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-23 12:39:01] [INFO ] Invariant cache hit.
[2024-05-23 12:39:01] [INFO ] State equation strengthened by 40 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) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 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) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 258/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 407 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7870 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 14599ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14606ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/161 places, 260/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14883 ms. Remains : 107/161 places, 260/406 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-02
Product exploration explored 100000 steps with 979 reset in 248 ms.
Stack based approach found an accepted trace after 13782 steps with 141 reset with depth 274 and stack size 274 in 34 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-02 finished in 15272 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' '!((p0 U (F(p0)&&X(p1))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 380
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 152 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 146 transition count 356
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 146 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 141 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 141 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 136 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 136 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 131 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 131 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 126 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 126 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 122 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 122 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 118 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 116 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 116 transition count 284
Applied a total of 98 rules in 16 ms. Remains 116 /161 variables (removed 45) and now considering 284/406 (removed 122) transitions.
[2024-05-23 12:39:16] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
// Phase 1: matrix 193 rows 116 cols
[2024-05-23 12:39:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 12:39:16] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 12:39:16] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2024-05-23 12:39:16] [INFO ] Invariant cache hit.
[2024-05-23 12:39:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 12:39:16] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-23 12:39:16] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2024-05-23 12:39:16] [INFO ] Invariant cache hit.
[2024-05-23 12:39:16] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/309 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 161 constraints, problems are : Problem set: 0 solved, 282 unsolved in 7804 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/309 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 282/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 443 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9096 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints]
After SMT, in 17130ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 17133ms
Starting structural reductions in LTL mode, iteration 1 : 116/161 places, 284/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17402 ms. Remains : 116/161 places, 284/406 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-04 finished in 17614 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 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 144 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 138 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 138 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 110 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 110 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 106 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 105 transition count 256
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 122 place count 105 transition count 252
Applied a total of 122 rules in 36 ms. Remains 105 /161 variables (removed 56) and now considering 252/406 (removed 154) transitions.
[2024-05-23 12:39:34] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2024-05-23 12:39:34] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 12:39:34] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 12:39:34] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 12:39:34] [INFO ] Invariant cache hit.
[2024-05-23 12:39:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 12:39:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-23 12:39:34] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-23 12:39:34] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 12:39:34] [INFO ] Invariant cache hit.
[2024-05-23 12:39:34] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 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/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 397 constraints, problems are : Problem set: 0 solved, 250 unsolved in 7532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 13957ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 13961ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/161 places, 252/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14212 ms. Remains : 105/161 places, 252/406 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-05
Product exploration explored 100000 steps with 1023 reset in 276 ms.
Product exploration explored 100000 steps with 990 reset in 293 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 69 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11672 steps (11 resets) in 23 ms. (486 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 104 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 252/252 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-23 12:39:49] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 12:39:49] [INFO ] Invariant cache hit.
[2024-05-23 12:39:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 12:39:49] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 12:39:49] [INFO ] Invariant cache hit.
[2024-05-23 12:39:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 12:39:49] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-23 12:39:49] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-23 12:39:49] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 12:39:49] [INFO ] Invariant cache hit.
[2024-05-23 12:39:49] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6307 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 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/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 397 constraints, problems are : Problem set: 0 solved, 250 unsolved in 7669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 14137ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 14141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14369 ms. Remains : 105/105 places, 252/252 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 78 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18008 steps (20 resets) in 27 ms. (643 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1024 reset in 243 ms.
Product exploration explored 100000 steps with 972 reset in 250 ms.
Built C files in :
/tmp/ltsmin937685158860779713
[2024-05-23 12:40:04] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-23 12:40:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:40:04] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-23 12:40:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:40:04] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-23 12:40:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:40:04] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin937685158860779713
Running compilation step : cd /tmp/ltsmin937685158860779713;'/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 557 ms.
Running link step : cd /tmp/ltsmin937685158860779713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin937685158860779713;'/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/stateBased10692081695419009291.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 252/252 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-23 12:40:19] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 12:40:19] [INFO ] Invariant cache hit.
[2024-05-23 12:40:19] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 12:40:19] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 12:40:19] [INFO ] Invariant cache hit.
[2024-05-23 12:40:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 12:40:20] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-23 12:40:20] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-23 12:40:20] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-23 12:40:20] [INFO ] Invariant cache hit.
[2024-05-23 12:40:20] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 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/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 397 constraints, problems are : Problem set: 0 solved, 250 unsolved in 7664 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 14047ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 14051ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14293 ms. Remains : 105/105 places, 252/252 transitions.
Built C files in :
/tmp/ltsmin1314598331261437901
[2024-05-23 12:40:34] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-23 12:40:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:40:34] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-23 12:40:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:40:34] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-23 12:40:34] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:40:34] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1314598331261437901
Running compilation step : cd /tmp/ltsmin1314598331261437901;'/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 548 ms.
Running link step : cd /tmp/ltsmin1314598331261437901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1314598331261437901;'/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/stateBased7493412231076733317.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 12:40:49] [INFO ] Flatten gal took : 20 ms
[2024-05-23 12:40:49] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:40:49] [INFO ] Time to serialize gal into /tmp/LTL4490391057644446745.gal : 2 ms
[2024-05-23 12:40:49] [INFO ] Time to serialize properties into /tmp/LTL8493573114043915444.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4490391057644446745.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14269146922976706409.hoa' '-atoms' '/tmp/LTL8493573114043915444.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/LTL8493573114043915444.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14269146922976706409.hoa
Detected timeout of ITS tools.
[2024-05-23 12:41:04] [INFO ] Flatten gal took : 8 ms
[2024-05-23 12:41:04] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:41:04] [INFO ] Time to serialize gal into /tmp/LTL17479099871126717614.gal : 1 ms
[2024-05-23 12:41:04] [INFO ] Time to serialize properties into /tmp/LTL4792043361418667927.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/LTL17479099871126717614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4792043361418667927.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("((s1<1)||(l172<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l172<1))"
Detected timeout of ITS tools.
[2024-05-23 12:41:19] [INFO ] Flatten gal took : 25 ms
[2024-05-23 12:41:19] [INFO ] Applying decomposition
[2024-05-23 12:41:19] [INFO ] Flatten gal took : 7 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/graph13467366415857028739.txt' '-o' '/tmp/graph13467366415857028739.bin' '-w' '/tmp/graph13467366415857028739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13467366415857028739.bin' '-l' '-1' '-v' '-w' '/tmp/graph13467366415857028739.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:41:19] [INFO ] Decomposing Gal with order
[2024-05-23 12:41:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:41:19] [INFO ] Removed a total of 417 redundant transitions.
[2024-05-23 12:41:19] [INFO ] Flatten gal took : 26 ms
[2024-05-23 12:41:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 10 ms.
[2024-05-23 12:41:19] [INFO ] Time to serialize gal into /tmp/LTL14378489875972650435.gal : 3 ms
[2024-05-23 12:41:19] [INFO ] Time to serialize properties into /tmp/LTL3996363208089200508.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/LTL14378489875972650435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3996363208089200508.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i5.u1.s1<1)||(i11.i0.u24.l172<1))"))))
Formula 0 simplified : FG!"((i5.u1.s1<1)||(i11.i0.u24.l172<1))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b032-LTLFireability-05 finished in 120601 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(p0)))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 151 transition count 372
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 143 transition count 350
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 136 transition count 326
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 136 transition count 326
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 129 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 129 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 122 transition count 288
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 122 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 115 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 115 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 109 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 109 transition count 262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 104 transition count 252
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 104 transition count 252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 100 transition count 244
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 99 transition count 242
Applied a total of 128 rules in 26 ms. Remains 99 /161 variables (removed 62) and now considering 242/406 (removed 164) transitions.
[2024-05-23 12:41:34] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2024-05-23 12:41:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 12:41:34] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-23 12:41:34] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2024-05-23 12:41:34] [INFO ] Invariant cache hit.
[2024-05-23 12:41:34] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 12:41:34] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-23 12:41:34] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2024-05-23 12:41:34] [INFO ] Invariant cache hit.
[2024-05-23 12:41:34] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 140 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5909 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 240/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 380 constraints, problems are : Problem set: 0 solved, 240 unsolved in 7216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
After SMT, in 13295ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 13308ms
Starting structural reductions in LTL mode, iteration 1 : 99/161 places, 242/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13600 ms. Remains : 99/161 places, 242/406 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 122 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b032-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b032-LTLFireability-06 finished in 13965 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 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 150 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 150 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 150 transition count 368
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 142 transition count 346
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 142 transition count 346
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 135 transition count 322
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 135 transition count 322
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 128 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 128 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 121 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 114 transition count 270
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 108 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 108 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 102 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 99 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 98 transition count 238
Applied a total of 132 rules in 18 ms. Remains 98 /161 variables (removed 63) and now considering 238/406 (removed 168) transitions.
[2024-05-23 12:41:48] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
// Phase 1: matrix 162 rows 98 cols
[2024-05-23 12:41:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 12:41:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-23 12:41:48] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-23 12:41:48] [INFO ] Invariant cache hit.
[2024-05-23 12:41:48] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 12:41:48] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-23 12:41:48] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-23 12:41:48] [INFO ] Invariant cache hit.
[2024-05-23 12:41:48] [INFO ] State equation strengthened by 39 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) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5546 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 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) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 236/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 375 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6823 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 12534ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 12537ms
Starting structural reductions in LTL mode, iteration 1 : 98/161 places, 238/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12858 ms. Remains : 98/161 places, 238/406 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-09
Entered a terminal (fully accepting) state of product in 180 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-09 finished in 13022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 378
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 378
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 144 transition count 350
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 138 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 133 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 133 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 128 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 128 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 123 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 123 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 119 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 115 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 111 transition count 268
Applied a total of 108 rules in 27 ms. Remains 111 /161 variables (removed 50) and now considering 268/406 (removed 138) transitions.
[2024-05-23 12:42:01] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
// Phase 1: matrix 183 rows 111 cols
[2024-05-23 12:42:01] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 12:42:01] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-23 12:42:01] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
[2024-05-23 12:42:01] [INFO ] Invariant cache hit.
[2024-05-23 12:42:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 12:42:02] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-05-23 12:42:02] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
[2024-05-23 12:42:02] [INFO ] Invariant cache hit.
[2024-05-23 12:42:02] [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, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 183/294 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 156 constraints, problems are : Problem set: 0 solved, 266 unsolved in 7139 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: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 183/294 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 266/422 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 422 constraints, problems are : Problem set: 0 solved, 266 unsolved in 8977 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: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 16316ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 16319ms
Starting structural reductions in LTL mode, iteration 1 : 111/161 places, 268/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16899 ms. Remains : 111/161 places, 268/406 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1360 steps with 11 reset in 6 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-10 finished in 17039 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 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 151 transition count 372
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 143 transition count 350
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 136 transition count 326
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 136 transition count 326
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 129 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 129 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 122 transition count 288
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 122 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 115 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 115 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 109 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 109 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 103 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 103 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 99 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 98 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 98 transition count 238
Applied a total of 132 rules in 36 ms. Remains 98 /161 variables (removed 63) and now considering 238/406 (removed 168) transitions.
[2024-05-23 12:42:18] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
// Phase 1: matrix 160 rows 98 cols
[2024-05-23 12:42:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 12:42:18] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-23 12:42:18] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-23 12:42:18] [INFO ] Invariant cache hit.
[2024-05-23 12:42:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 12:42:19] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-23 12:42:19] [INFO ] Redundant transitions in 0 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-23 12:42:19] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-23 12:42:19] [INFO ] Invariant cache hit.
[2024-05-23 12:42:19] [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
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 5583 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 7396 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 13174ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 13178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/161 places, 238/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13642 ms. Remains : 98/161 places, 238/406 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-11
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-11 finished in 13688 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 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 378
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 378
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 144 transition count 350
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 110 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 110 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 107 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 106 transition count 258
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 122 place count 106 transition count 254
Applied a total of 122 rules in 31 ms. Remains 106 /161 variables (removed 55) and now considering 254/406 (removed 152) transitions.
[2024-05-23 12:42:32] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-23 12:42:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 12:42:32] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-23 12:42:32] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 12:42:32] [INFO ] Invariant cache hit.
[2024-05-23 12:42:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 12:42:32] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-23 12:42:32] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-23 12:42:32] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 12:42:32] [INFO ] Invariant cache hit.
[2024-05-23 12:42:32] [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, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6273 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: 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/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 400 constraints, problems are : Problem set: 0 solved, 252 unsolved in 7792 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: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 14245ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 14248ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/161 places, 254/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14725 ms. Remains : 106/161 places, 254/406 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-12
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-12 finished in 14804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 378
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 378
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 144 transition count 350
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 120 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 112 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 110 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 110 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 109 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 109 transition count 264
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 116 place count 109 transition count 260
Applied a total of 116 rules in 32 ms. Remains 109 /161 variables (removed 52) and now considering 260/406 (removed 146) transitions.
[2024-05-23 12:42:47] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 109 cols
[2024-05-23 12:42:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 12:42:47] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-23 12:42:47] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:42:47] [INFO ] Invariant cache hit.
[2024-05-23 12:42:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 12:42:47] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-23 12:42:47] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 12:42:47] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:42:47] [INFO ] Invariant cache hit.
[2024-05-23 12:42:47] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 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/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 411 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 15049ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 15051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/161 places, 260/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15459 ms. Remains : 109/161 places, 260/406 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-13
Product exploration explored 100000 steps with 975 reset in 276 ms.
Product exploration explored 100000 steps with 930 reset in 289 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 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 244 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40061 steps (51 resets) in 61 ms. (646 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-05-23 12:43:03] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:43:03] [INFO ] Invariant cache hit.
[2024-05-23 12:43:03] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 255/287 variables, and 86 constraints, problems are : Problem set: 1 solved, 0 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 86/109 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 309 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-23 12:43:03] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:43:03] [INFO ] Invariant cache hit.
[2024-05-23 12:43:04] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-23 12:43:04] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:43:04] [INFO ] Invariant cache hit.
[2024-05-23 12:43:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 12:43:04] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-23 12:43:04] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 12:43:04] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:43:04] [INFO ] Invariant cache hit.
[2024-05-23 12:43:04] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6684 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 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/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 411 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 15001ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 15004ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15297 ms. Remains : 109/109 places, 260/260 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 158 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40020 steps (37 resets) in 140 ms. (283 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
[2024-05-23 12:43:19] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:43:19] [INFO ] Invariant cache hit.
[2024-05-23 12:43:19] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 92/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 159/255 variables, 82/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 1/87 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 42/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/261 variables, 1/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 25/286 variables, 22/152 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/287 variables, 1/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 1 solved, 2 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/96 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 159/255 variables, 82/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 1/87 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 42/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/261 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 25/286 variables, 22/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/287 variables, 1/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/287 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 155 constraints, problems are : Problem set: 1 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 422ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 9122 steps, including 119 resets, run visited all 2 properties in 116 ms. (steps per millisecond=78 )
Parikh walk visited 2 properties in 115 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 299 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 997 reset in 273 ms.
Product exploration explored 100000 steps with 972 reset in 296 ms.
Built C files in :
/tmp/ltsmin11002289069453291655
[2024-05-23 12:43:21] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 12:43:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:43:21] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 12:43:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:43:21] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 12:43:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:43:21] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11002289069453291655
Running compilation step : cd /tmp/ltsmin11002289069453291655;'/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 566 ms.
Running link step : cd /tmp/ltsmin11002289069453291655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11002289069453291655;'/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/stateBased7033500094730556670.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 109 /109 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-23 12:43:36] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:43:36] [INFO ] Invariant cache hit.
[2024-05-23 12:43:36] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 12:43:36] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:43:36] [INFO ] Invariant cache hit.
[2024-05-23 12:43:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 12:43:36] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-23 12:43:36] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 12:43:36] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-23 12:43:36] [INFO ] Invariant cache hit.
[2024-05-23 12:43:36] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6639 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 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/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 411 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7940 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 14763ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14767ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15013 ms. Remains : 109/109 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin7892213655956412232
[2024-05-23 12:43:51] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 12:43:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:43:51] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 12:43:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:43:51] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 12:43:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:43:51] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7892213655956412232
Running compilation step : cd /tmp/ltsmin7892213655956412232;'/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 562 ms.
Running link step : cd /tmp/ltsmin7892213655956412232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7892213655956412232;'/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/stateBased13792713614871382262.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 12:44:06] [INFO ] Flatten gal took : 8 ms
[2024-05-23 12:44:06] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:44:06] [INFO ] Time to serialize gal into /tmp/LTL4475816491638333665.gal : 5 ms
[2024-05-23 12:44:06] [INFO ] Time to serialize properties into /tmp/LTL787531418644144276.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/LTL4475816491638333665.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4982515996916590973.hoa' '-atoms' '/tmp/LTL787531418644144276.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...316
Loading property file /tmp/LTL787531418644144276.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4982515996916590973.hoa
Detected timeout of ITS tools.
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 8 ms
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 6 ms
[2024-05-23 12:44:21] [INFO ] Time to serialize gal into /tmp/LTL16283522758954502597.gal : 2 ms
[2024-05-23 12:44:21] [INFO ] Time to serialize properties into /tmp/LTL9715321365585059814.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/LTL16283522758954502597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9715321365585059814.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((s0<1)||(l178<1))"))||(G("((s1<1)||(l134<1))")))))
Formula 0 simplified : G(F!"((s0<1)||(l178<1))" & F!"((s1<1)||(l134<1))")
Detected timeout of ITS tools.
[2024-05-23 12:44:36] [INFO ] Flatten gal took : 9 ms
[2024-05-23 12:44:36] [INFO ] Applying decomposition
[2024-05-23 12:44:36] [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/graph17205998235961361507.txt' '-o' '/tmp/graph17205998235961361507.bin' '-w' '/tmp/graph17205998235961361507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17205998235961361507.bin' '-l' '-1' '-v' '-w' '/tmp/graph17205998235961361507.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:44:36] [INFO ] Decomposing Gal with order
[2024-05-23 12:44:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:44:36] [INFO ] Removed a total of 433 redundant transitions.
[2024-05-23 12:44:36] [INFO ] Flatten gal took : 13 ms
[2024-05-23 12:44:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 7 ms.
[2024-05-23 12:44:36] [INFO ] Time to serialize gal into /tmp/LTL2064444389332480795.gal : 2 ms
[2024-05-23 12:44:36] [INFO ] Time to serialize properties into /tmp/LTL8474131562984415388.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/LTL2064444389332480795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8474131562984415388.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 : !((F((G("((i6.u0.s0<1)||(i10.i0.u27.l178<1))"))||(G("((i0.u1.s1<1)||(i7.u18.l134<1))")))))
Formula 0 simplified : G(F!"((i6.u0.s0<1)||(i10.i0.u27.l178<1))" & F!"((i0.u1.s1<1)||(i7.u18.l134<1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b032-LTLFireability-13 finished in 124630 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((p0||X(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 150 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 150 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 150 transition count 368
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 142 transition count 346
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 142 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 136 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 136 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 130 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 130 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 124 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 124 transition count 290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 118 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 112 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 106 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 102 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 101 transition count 244
Applied a total of 126 rules in 18 ms. Remains 101 /161 variables (removed 60) and now considering 244/406 (removed 162) transitions.
[2024-05-23 12:44:51] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
// Phase 1: matrix 166 rows 101 cols
[2024-05-23 12:44:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 12:44:51] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 12:44:51] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-23 12:44:51] [INFO ] Invariant cache hit.
[2024-05-23 12:44:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 12:44:51] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-23 12:44:51] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-23 12:44:51] [INFO ] Invariant cache hit.
[2024-05-23 12:44:51] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 143 constraints, problems are : Problem set: 0 solved, 242 unsolved in 6147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 242/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 385 constraints, problems are : Problem set: 0 solved, 242 unsolved in 7332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 13674ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 13677ms
Starting structural reductions in LTL mode, iteration 1 : 101/161 places, 244/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13907 ms. Remains : 101/161 places, 244/406 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-15
Entered a terminal (fully accepting) state of product in 22615 steps with 213 reset in 63 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-15 finished in 14104 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((G(!p0)||(!p0&&G(F(!p1)))))))'
Found a Shortening insensitive property : FunctionPointer-PT-b032-LTLFireability-00
Stuttering acceptance computed with spot in 223 ms :[p0, (AND p1 p0), (AND p1 p0), p0, p0]
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 380
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 152 transition count 374
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 146 transition count 358
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 146 transition count 358
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 141 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 141 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 136 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 136 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 131 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 131 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 126 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 126 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 111 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 111 transition count 270
Applied a total of 106 rules in 22 ms. Remains 111 /161 variables (removed 50) and now considering 270/406 (removed 136) transitions.
[2024-05-23 12:45:06] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
// Phase 1: matrix 184 rows 111 cols
[2024-05-23 12:45:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 12:45:06] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 12:45:06] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-23 12:45:06] [INFO ] Invariant cache hit.
[2024-05-23 12:45:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 12:45:06] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-23 12:45:06] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-23 12:45:06] [INFO ] Invariant cache hit.
[2024-05-23 12:45:06] [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, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 184/295 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 156 constraints, problems are : Problem set: 0 solved, 268 unsolved in 7295 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: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 184/295 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 268/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 424 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8979 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: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 16464ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 16467ms
Starting structural reductions in LI_LTL mode, iteration 1 : 111/161 places, 270/406 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16717 ms. Remains : 111/161 places, 270/406 transitions.
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-00
Product exploration explored 100000 steps with 972 reset in 252 ms.
Product exploration explored 100000 steps with 923 reset in 255 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 p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 109 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40020 steps (39 resets) in 64 ms. (615 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
[2024-05-23 12:45:23] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-23 12:45:23] [INFO ] Invariant cache hit.
[2024-05-23 12:45:23] [INFO ] State equation strengthened by 43 read => feed constraints.
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) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 193/249 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 35/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/255 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/292 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/295 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 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: 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) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 193/249 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 35/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/292 variables, 29/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/295 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/295 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8112 steps, including 69 resets, run visited all 1 properties in 26 ms. (steps per millisecond=312 )
Parikh walk visited 1 properties in 25 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 62 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 270/270 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 111 transition count 264
Applied a total of 6 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 264/270 (removed 6) transitions.
[2024-05-23 12:45:24] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 111 cols
[2024-05-23 12:45:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 12:45:24] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-23 12:45:24] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:45:24] [INFO ] Invariant cache hit.
[2024-05-23 12:45:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 12:45:24] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-23 12:45:24] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-23 12:45:24] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:45:24] [INFO ] Invariant cache hit.
[2024-05-23 12:45:24] [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, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7083 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: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8659 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: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 15940ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 15942ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 264/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16238 ms. Remains : 111/111 places, 264/270 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) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40010 steps (41 resets) in 74 ms. (533 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-05-23 12:45:40] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:45:40] [INFO ] Invariant cache hit.
[2024-05-23 12:45:40] [INFO ] State equation strengthened by 43 read => feed constraints.
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) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 189/244 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 35/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/250 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/287 variables, 29/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 8/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/291 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/292 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 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: 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) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 189/244 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 35/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/250 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/287 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/291 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/292 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/292 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/292 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 264/264 transitions.
Graph (complete) has 448 edges and 111 vertex of which 87 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 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 87 transition count 216
Applied a total of 49 rules in 11 ms. Remains 87 /111 variables (removed 24) and now considering 216/264 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 87/111 places, 216/264 transitions.
RANDOM walk for 30510 steps (6 resets) in 35 ms. (847 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 273 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 60 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 937 reset in 240 ms.
Product exploration explored 100000 steps with 937 reset in 257 ms.
Built C files in :
/tmp/ltsmin10573640696865325828
[2024-05-23 12:45:42] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-23 12:45:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:45:42] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-23 12:45:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:45:42] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-23 12:45:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:45:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10573640696865325828
Running compilation step : cd /tmp/ltsmin10573640696865325828;'/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 605 ms.
Running link step : cd /tmp/ltsmin10573640696865325828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10573640696865325828;'/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/stateBased6079571223634277233.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 264/264 transitions.
Applied a total of 0 rules in 33 ms. Remains 111 /111 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-23 12:45:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:45:57] [INFO ] Invariant cache hit.
[2024-05-23 12:45:57] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-23 12:45:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:45:57] [INFO ] Invariant cache hit.
[2024-05-23 12:45:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 12:45:57] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-23 12:45:57] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-23 12:45:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 12:45:57] [INFO ] Invariant cache hit.
[2024-05-23 12:45:57] [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, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6943 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: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8669 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: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 15806ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 15810ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16152 ms. Remains : 111/111 places, 264/264 transitions.
Built C files in :
/tmp/ltsmin4979003884374425043
[2024-05-23 12:46:13] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-23 12:46:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:46:13] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-23 12:46:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:46:13] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-23 12:46:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:46:13] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4979003884374425043
Running compilation step : cd /tmp/ltsmin4979003884374425043;'/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 574 ms.
Running link step : cd /tmp/ltsmin4979003884374425043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4979003884374425043;'/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/stateBased12837509480765460161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 12:46:28] [INFO ] Flatten gal took : 13 ms
[2024-05-23 12:46:28] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:46:28] [INFO ] Time to serialize gal into /tmp/LTL10263774036769835041.gal : 2 ms
[2024-05-23 12:46:28] [INFO ] Time to serialize properties into /tmp/LTL16960715631757437516.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/LTL10263774036769835041.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1278038789230763619.hoa' '-atoms' '/tmp/LTL16960715631757437516.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/LTL16960715631757437516.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1278038789230763619.hoa
Detected timeout of ITS tools.
[2024-05-23 12:46:43] [INFO ] Flatten gal took : 6 ms
[2024-05-23 12:46:43] [INFO ] Flatten gal took : 6 ms
[2024-05-23 12:46:43] [INFO ] Time to serialize gal into /tmp/LTL16576318154047948766.gal : 2 ms
[2024-05-23 12:46:43] [INFO ] Time to serialize properties into /tmp/LTL12687179765885647275.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/LTL16576318154047948766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12687179765885647275.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((G("((s1<1)||(l153<1))"))||((G(F("((s1<1)||(l231<1))")))&&("((s1<1)||(l153<1))"))))))
Formula 0 simplified : XG(F!"((s1<1)||(l153<1))" & (!"((s1<1)||(l153<1))" | FG!"((s1<1)||(l231<1))"))
Detected timeout of ITS tools.
[2024-05-23 12:46:58] [INFO ] Flatten gal took : 9 ms
[2024-05-23 12:46:58] [INFO ] Applying decomposition
[2024-05-23 12:46:58] [INFO ] Flatten gal took : 6 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/graph6124654148611398008.txt' '-o' '/tmp/graph6124654148611398008.bin' '-w' '/tmp/graph6124654148611398008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6124654148611398008.bin' '-l' '-1' '-v' '-w' '/tmp/graph6124654148611398008.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:46:58] [INFO ] Decomposing Gal with order
[2024-05-23 12:46:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:46:58] [INFO ] Removed a total of 437 redundant transitions.
[2024-05-23 12:46:58] [INFO ] Flatten gal took : 16 ms
[2024-05-23 12:46:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 3 ms.
[2024-05-23 12:46:58] [INFO ] Time to serialize gal into /tmp/LTL6354644773002767403.gal : 22 ms
[2024-05-23 12:46:58] [INFO ] Time to serialize properties into /tmp/LTL11399295260770831104.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/LTL6354644773002767403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11399295260770831104.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...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((i6.u1.s1<1)||(i10.i0.u24.l153<1))"))||((G(F("((i6.u1.s1<1)||(i10.i1.u25.l231<1))")))&&("((i6.u1.s1<1)||(i10.i0.u24.l153<1...164
Formula 0 simplified : XG(F!"((i6.u1.s1<1)||(i10.i0.u24.l153<1))" & (!"((i6.u1.s1<1)||(i10.i0.u24.l153<1))" | FG!"((i6.u1.s1<1)||(i10.i1.u25.l231<1))"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b032-LTLFireability-00 finished in 128125 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 U p1))||F(X(X(X(X(p0))))))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2024-05-23 12:47:14] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16195583853525456649
[2024-05-23 12:47:14] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2024-05-23 12:47:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:47:14] [INFO ] Applying decomposition
[2024-05-23 12:47:14] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2024-05-23 12:47:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:47:14] [INFO ] Flatten gal took : 26 ms
[2024-05-23 12:47:14] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2024-05-23 12:47:14] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:47:14] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16195583853525456649
Running compilation step : cd /tmp/ltsmin16195583853525456649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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'
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/graph13407024758065303736.txt' '-o' '/tmp/graph13407024758065303736.bin' '-w' '/tmp/graph13407024758065303736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13407024758065303736.bin' '-l' '-1' '-v' '-w' '/tmp/graph13407024758065303736.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:47:14] [INFO ] Decomposing Gal with order
[2024-05-23 12:47:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:47:14] [INFO ] Removed a total of 695 redundant transitions.
[2024-05-23 12:47:14] [INFO ] Flatten gal took : 45 ms
[2024-05-23 12:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 231 labels/synchronizations in 25 ms.
[2024-05-23 12:47:14] [INFO ] Time to serialize gal into /tmp/LTLFireability4480029463953175994.gal : 16 ms
[2024-05-23 12:47:14] [INFO ] Time to serialize properties into /tmp/LTLFireability17212716339011487668.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/LTLFireability4480029463953175994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17212716339011487668.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...277
Read 4 LTL properties
Checking formula 0 : !((X(F((G(!("((i3.i0.u1.s1>=1)&&(i12.u39.l153>=1))")))||((!("((i3.i0.u1.s1>=1)&&(i12.u39.l153>=1))"))&&(G(F(!("((i3.i0.u1.s1>=1)&&(i12...179
Formula 0 simplified : XG(F"((i3.i0.u1.s1>=1)&&(i12.u39.l153>=1))" & ("((i3.i0.u1.s1>=1)&&(i12.u39.l153>=1))" | FG"((i3.i0.u1.s1>=1)&&(i12.u44.l231>=1))"))
Compilation finished in 1129 ms.
Running link step : cd /tmp/ltsmin16195583853525456649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16195583853525456649;'/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(<>(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.035: LTL layer: formula: X(<>(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](<>(!(LTLAPp1==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.035: "X(<>(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](<>(!(LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.035: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.119: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.204: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.213: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.209: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.212: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.276: There are 414 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.277: State length is 162, there are 415 groups
pins2lts-mc-linux64( 0/ 8), 0.277: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.277: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.277: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.277: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.396: [Blue] ~120 levels ~960 states ~5584 transitions
pins2lts-mc-linux64( 4/ 8), 0.498: [Blue] ~240 levels ~1920 states ~11160 transitions
pins2lts-mc-linux64( 4/ 8), 0.675: [Blue] ~480 levels ~3840 states ~22608 transitions
pins2lts-mc-linux64( 4/ 8), 1.317: [Blue] ~960 levels ~7680 states ~40672 transitions
pins2lts-mc-linux64( 4/ 8), 2.595: [Blue] ~1920 levels ~15360 states ~72352 transitions
pins2lts-mc-linux64( 7/ 8), 3.602: [Blue] ~1993 levels ~30720 states ~126808 transitions
pins2lts-mc-linux64( 0/ 8), 5.913: [Blue] ~7680 levels ~61440 states ~313768 transitions
pins2lts-mc-linux64( 5/ 8), 9.011: [Blue] ~12207 levels ~122880 states ~647984 transitions
pins2lts-mc-linux64( 5/ 8), 12.295: [Blue] ~19189 levels ~245760 states ~1016616 transitions
pins2lts-mc-linux64( 5/ 8), 18.510: [Blue] ~33152 levels ~491520 states ~1753888 transitions
pins2lts-mc-linux64( 5/ 8), 22.206: [Blue] ~61080 levels ~983040 states ~3228464 transitions
pins2lts-mc-linux64( 0/ 8), 28.838: [Blue] ~245760 levels ~1966080 states ~10226024 transitions
pins2lts-mc-linux64( 0/ 8), 41.597: [Blue] ~491520 levels ~3932160 states ~20457920 transitions
pins2lts-mc-linux64( 0/ 8), 76.430: [Blue] ~983040 levels ~7864320 states ~40921704 transitions
pins2lts-mc-linux64( 4/ 8), 83.837: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 84.026:
pins2lts-mc-linux64( 0/ 8), 84.026: Explored 7776172 states 36637614 transitions, fanout: 4.712
pins2lts-mc-linux64( 0/ 8), 84.026: Total exploration time 83.710 sec (83.540 sec minimum, 83.623 sec on average)
pins2lts-mc-linux64( 0/ 8), 84.026: States per second: 92894, Transitions per second: 437673
pins2lts-mc-linux64( 0/ 8), 84.026:
pins2lts-mc-linux64( 0/ 8), 84.026: State space has 32054008 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 84.026: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 84.026: blue states: 7776172 (24.26%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 84.026: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 84.026: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 84.026:
pins2lts-mc-linux64( 0/ 8), 84.026: Total memory used for local state coloring: 102.7MB
pins2lts-mc-linux64( 0/ 8), 84.026:
pins2lts-mc-linux64( 0/ 8), 84.026: Queue width: 8B, total height: 6729610, memory: 51.34MB
pins2lts-mc-linux64( 0/ 8), 84.026: Tree memory: 500.6MB, 16.4 B/state, compr.: 2.5%
pins2lts-mc-linux64( 0/ 8), 84.026: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 84.026: Stored 408 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 84.026: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 84.026: Est. total memory use: 551.9MB (~1075.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16195583853525456649;'/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(<>(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16195583853525456649;'/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(<>(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-23 13:11:34] [INFO ] Flatten gal took : 10 ms
[2024-05-23 13:11:34] [INFO ] Time to serialize gal into /tmp/LTLFireability4316197796049030668.gal : 3 ms
[2024-05-23 13:11:34] [INFO ] Time to serialize properties into /tmp/LTLFireability10600608652420084733.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/LTLFireability4316197796049030668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10600608652420084733.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 4 LTL properties
Checking formula 0 : !((X(F((G(!("((s1>=1)&&(l153>=1))")))||((!("((s1>=1)&&(l153>=1))"))&&(G(F(!("((s1>=1)&&(l231>=1))")))))))))
Formula 0 simplified : XG(F"((s1>=1)&&(l153>=1))" & ("((s1>=1)&&(l153>=1))" | FG"((s1>=1)&&(l231>=1))"))
ITS-tools command line returned an error code 137
[2024-05-23 13:25:27] [INFO ] Flatten gal took : 10 ms
[2024-05-23 13:25:27] [INFO ] Input system was already deterministic with 406 transitions.
[2024-05-23 13:25:27] [INFO ] Transformed 161 places.
[2024-05-23 13:25:27] [INFO ] Transformed 406 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 13:25:27] [INFO ] Time to serialize gal into /tmp/LTLFireability696823928904854308.gal : 12 ms
[2024-05-23 13:25:27] [INFO ] Time to serialize properties into /tmp/LTLFireability15910710245400805898.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/LTLFireability696823928904854308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15910710245400805898.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...342
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F((G(!("((s1>=1)&&(l153>=1))")))||((!("((s1>=1)&&(l153>=1))"))&&(G(F(!("((s1>=1)&&(l231>=1))")))))))))
Formula 0 simplified : XG(F"((s1>=1)&&(l153>=1))" & ("((s1>=1)&&(l153>=1))" | FG"((s1>=1)&&(l231>=1))"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b032"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b032, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603000252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b032.tgz
mv FunctionPointer-PT-b032 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;