About the Execution of ITS-Tools for NoC3x3-PT-6B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16202.951 | 3600000.00 | 9199133.00 | 7249.00 | FF??FFFTFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r246-tall-171654352100644.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 NoC3x3-PT-6B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352100644
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 552K May 18 16:43 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 NoC3x3-PT-6B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716706994190
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 07:03:15] [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-26 07:03:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:03:15] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-05-26 07:03:15] [INFO ] Transformed 1544 places.
[2024-05-26 07:03:15] [INFO ] Transformed 2229 transitions.
[2024-05-26 07:03:15] [INFO ] Found NUPN structural information;
[2024-05-26 07:03:15] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-6B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 363 places :
Symmetric choice reduction at 0 with 363 rule applications. Total rules 363 place count 1181 transition count 1866
Iterating global reduction 0 with 363 rules applied. Total rules applied 726 place count 1181 transition count 1866
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 832 place count 1075 transition count 1660
Iterating global reduction 0 with 106 rules applied. Total rules applied 938 place count 1075 transition count 1660
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 1027 place count 986 transition count 1513
Iterating global reduction 0 with 89 rules applied. Total rules applied 1116 place count 986 transition count 1513
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1135 place count 967 transition count 1475
Iterating global reduction 0 with 19 rules applied. Total rules applied 1154 place count 967 transition count 1475
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1167 place count 954 transition count 1445
Iterating global reduction 0 with 13 rules applied. Total rules applied 1180 place count 954 transition count 1445
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 1192 place count 942 transition count 1433
Iterating global reduction 0 with 12 rules applied. Total rules applied 1204 place count 942 transition count 1433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1207 place count 939 transition count 1427
Iterating global reduction 0 with 3 rules applied. Total rules applied 1210 place count 939 transition count 1427
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1213 place count 936 transition count 1421
Iterating global reduction 0 with 3 rules applied. Total rules applied 1216 place count 936 transition count 1421
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1219 place count 933 transition count 1418
Iterating global reduction 0 with 3 rules applied. Total rules applied 1222 place count 933 transition count 1418
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 1230 place count 933 transition count 1410
Applied a total of 1230 rules in 463 ms. Remains 933 /1544 variables (removed 611) and now considering 1410/2229 (removed 819) transitions.
// Phase 1: matrix 1410 rows 933 cols
[2024-05-26 07:03:16] [INFO ] Computed 66 invariants in 35 ms
[2024-05-26 07:03:16] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-26 07:03:16] [INFO ] Invariant cache hit.
[2024-05-26 07:03:17] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
Running 1409 sub problems to find dead transitions.
[2024-05-26 07:03:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1409 unsolved
SMT process timed out in 30518ms, After SMT, problems are : Problem set: 0 solved, 1409 unsolved
Search for dead transitions found 0 dead transitions in 30556ms
Starting structural reductions in LTL mode, iteration 1 : 933/1544 places, 1410/2229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32557 ms. Remains : 933/1544 places, 1410/2229 transitions.
Support contains 47 out of 933 places after structural reductions.
[2024-05-26 07:03:48] [INFO ] Flatten gal took : 114 ms
[2024-05-26 07:03:48] [INFO ] Flatten gal took : 71 ms
[2024-05-26 07:03:48] [INFO ] Input system was already deterministic with 1410 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (85 resets) in 1889 ms. (21 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40004 steps (11 resets) in 248 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
[2024-05-26 07:03:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 103/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 826/933 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1410/2343 variables, 933/999 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2343 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2343 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2343/2343 variables, and 999 constraints, problems are : Problem set: 0 solved, 3 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
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) 103/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 826/933 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 07:03:50] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/933 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1410/2343 variables, 933/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2343 variables, 3/1003 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 07:03:51] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 8 ms to minimize.
[2024-05-26 07:03:51] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2343 variables, 2/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2343 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2343 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2343/2343 variables, and 1005 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1925 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 2609ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 322 ms.
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 933 transition count 1371
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 894 transition count 1371
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 78 place count 894 transition count 1275
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 270 place count 798 transition count 1275
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 304 place count 764 transition count 1107
Iterating global reduction 2 with 34 rules applied. Total rules applied 338 place count 764 transition count 1107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 764 transition count 1106
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 763 transition count 1106
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 346 place count 757 transition count 1089
Iterating global reduction 2 with 6 rules applied. Total rules applied 352 place count 757 transition count 1089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 757 transition count 1088
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 355 place count 755 transition count 1083
Iterating global reduction 3 with 2 rules applied. Total rules applied 357 place count 755 transition count 1083
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 713 place count 577 transition count 905
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 715 place count 575 transition count 901
Iterating global reduction 3 with 2 rules applied. Total rules applied 717 place count 575 transition count 901
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 718 place count 574 transition count 899
Iterating global reduction 3 with 1 rules applied. Total rules applied 719 place count 574 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 921 place count 473 transition count 929
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 999 place count 434 transition count 951
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1023 place count 434 transition count 927
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 1046 place count 434 transition count 904
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 1083 place count 411 transition count 890
Applied a total of 1083 rules in 384 ms. Remains 411 /933 variables (removed 522) and now considering 890/1410 (removed 520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 411/933 places, 890/1410 transitions.
RANDOM walk for 31641 steps (208 resets) in 1138 ms. (27 steps per ms) remains 0/2 properties
Computed a total of 65 stabilizing places and 65 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((X(G(p0))||G(p1))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1389
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1389
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 913 transition count 1376
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 913 transition count 1376
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 906 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 906 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 902 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 902 transition count 1355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 902 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 901 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 901 transition count 1353
Applied a total of 65 rules in 101 ms. Remains 901 /933 variables (removed 32) and now considering 1353/1410 (removed 57) transitions.
// Phase 1: matrix 1353 rows 901 cols
[2024-05-26 07:03:53] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 07:03:54] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-26 07:03:54] [INFO ] Invariant cache hit.
[2024-05-26 07:03:55] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2024-05-26 07:03:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
SMT process timed out in 30468ms, After SMT, problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 30481ms
Starting structural reductions in LTL mode, iteration 1 : 901/933 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31830 ms. Remains : 901/933 places, 1353/1410 transitions.
Stuttering acceptance computed with spot in 339 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 4176 steps with 9 reset in 34 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-00 finished in 32263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&(p1||X(p2)))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1376
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1376
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 909 transition count 1363
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 909 transition count 1363
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 905 transition count 1358
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 905 transition count 1358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 905 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 904 transition count 1356
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 904 transition count 1356
Applied a total of 59 rules in 122 ms. Remains 904 /933 variables (removed 29) and now considering 1356/1410 (removed 54) transitions.
// Phase 1: matrix 1356 rows 904 cols
[2024-05-26 07:04:26] [INFO ] Computed 66 invariants in 6 ms
[2024-05-26 07:04:26] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-26 07:04:26] [INFO ] Invariant cache hit.
[2024-05-26 07:04:27] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
Running 1355 sub problems to find dead transitions.
[2024-05-26 07:04:27] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
SMT process timed out in 30330ms, After SMT, problems are : Problem set: 0 solved, 1355 unsolved
Search for dead transitions found 0 dead transitions in 30348ms
Starting structural reductions in LTL mode, iteration 1 : 904/933 places, 1356/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31715 ms. Remains : 904/933 places, 1356/1410 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-01
Product exploration explored 100000 steps with 1937 reset in 266 ms.
Stack based approach found an accepted trace after 8594 steps with 168 reset with depth 51 and stack size 51 in 25 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-01 finished in 32186 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((p0||X((G(p1)&&F(p2)))))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 913 transition count 1375
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 913 transition count 1375
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 906 transition count 1359
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 906 transition count 1359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 902 transition count 1354
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 902 transition count 1354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 902 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 901 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 901 transition count 1352
Applied a total of 65 rules in 100 ms. Remains 901 /933 variables (removed 32) and now considering 1352/1410 (removed 58) transitions.
// Phase 1: matrix 1352 rows 901 cols
[2024-05-26 07:04:58] [INFO ] Computed 66 invariants in 14 ms
[2024-05-26 07:04:58] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-26 07:04:58] [INFO ] Invariant cache hit.
[2024-05-26 07:04:59] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Running 1351 sub problems to find dead transitions.
[2024-05-26 07:04:59] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
SMT process timed out in 30359ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 30372ms
Starting structural reductions in LTL mode, iteration 1 : 901/933 places, 1352/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31599 ms. Remains : 901/933 places, 1352/1410 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-02
Product exploration explored 100000 steps with 224 reset in 385 ms.
Product exploration explored 100000 steps with 226 reset in 355 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
RANDOM walk for 40000 steps (88 resets) in 247 ms. (161 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
[2024-05-26 07:05:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 834/901 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1352/2253 variables, 901/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2253 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2253 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2253/2253 variables, and 967 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 901/901 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 834/901 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1352/2253 variables, 901/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2253 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 07:05:32] [INFO ] Deduced a trap composed of 83 places in 180 ms of which 4 ms to minimize.
[2024-05-26 07:05:32] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
[2024-05-26 07:05:32] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2253 variables, 3/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2253 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2253 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2253/2253 variables, and 971 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1142 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 901/901 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1631ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 2 out of 901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 901/901 places, 1352/1352 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 901 transition count 1325
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 874 transition count 1325
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 54 place count 874 transition count 1228
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 248 place count 777 transition count 1228
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 273 place count 752 transition count 1077
Iterating global reduction 2 with 25 rules applied. Total rules applied 298 place count 752 transition count 1077
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 654 place count 574 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 856 place count 473 transition count 929
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 934 place count 434 transition count 951
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 958 place count 434 transition count 927
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 981 place count 434 transition count 904
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1018 place count 411 transition count 890
Applied a total of 1018 rules in 129 ms. Remains 411 /901 variables (removed 490) and now considering 890/1352 (removed 462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 411/901 places, 890/1352 transitions.
RANDOM walk for 40000 steps (274 resets) in 395 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (13 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 409779 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 409779 steps, saw 110165 distinct states, run finished after 3007 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 890 rows 411 cols
[2024-05-26 07:05:36] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 07:05:36] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 391/411 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 890/1301 variables, 411/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1301 variables, 53/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1301 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1301 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 411/411 constraints, ReadFeed: 53/53 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 391/411 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 890/1301 variables, 411/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1301 variables, 53/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1301 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1301 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1301 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 531 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 411/411 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 602ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 890/890 transitions.
Applied a total of 0 rules in 11 ms. Remains 411 /411 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 411/411 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 890/890 transitions.
Applied a total of 0 rules in 11 ms. Remains 411 /411 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-26 07:05:37] [INFO ] Invariant cache hit.
[2024-05-26 07:05:37] [INFO ] Implicit Places using invariants in 209 ms returned [11, 46, 90, 129, 186, 259, 305, 344, 390]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 216 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 402/411 places, 890/890 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 378 transition count 866
Applied a total of 48 rules in 17 ms. Remains 378 /402 variables (removed 24) and now considering 866/890 (removed 24) transitions.
// Phase 1: matrix 866 rows 378 cols
[2024-05-26 07:05:37] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 07:05:37] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-26 07:05:37] [INFO ] Invariant cache hit.
[2024-05-26 07:05:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 07:05:37] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 378/411 places, 866/890 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 987 ms. Remains : 378/411 places, 866/890 transitions.
RANDOM walk for 33837 steps (248 resets) in 209 ms. (161 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 4 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 1352/1352 transitions.
Applied a total of 0 rules in 20 ms. Remains 901 /901 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
// Phase 1: matrix 1352 rows 901 cols
[2024-05-26 07:05:38] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 07:05:39] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-26 07:05:39] [INFO ] Invariant cache hit.
[2024-05-26 07:05:39] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 1351 sub problems to find dead transitions.
[2024-05-26 07:05:39] [INFO ] Invariant cache hit.
(s71 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0timeout
)
(s72 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
SMT process timed out in 30326ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 30338ms
Finished structural reductions in LTL mode , in 1 iterations and 31497 ms. Remains : 901/901 places, 1352/1352 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
RANDOM walk for 40000 steps (90 resets) in 169 ms. (235 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2024-05-26 07:06:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 834/901 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1352/2253 variables, 901/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2253 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2253 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2253/2253 variables, and 967 constraints, problems are : Problem set: 0 solved, 1 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 901/901 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 834/901 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1352/2253 variables, 901/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2253 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 07:06:11] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 3 ms to minimize.
[2024-05-26 07:06:11] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 3 ms to minimize.
[2024-05-26 07:06:12] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2253 variables, 3/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2253 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2253 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2253/2253 variables, and 971 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 901/901 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1627ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 2 out of 901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 901/901 places, 1352/1352 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 901 transition count 1325
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 874 transition count 1325
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 54 place count 874 transition count 1228
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 248 place count 777 transition count 1228
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 273 place count 752 transition count 1077
Iterating global reduction 2 with 25 rules applied. Total rules applied 298 place count 752 transition count 1077
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 654 place count 574 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 856 place count 473 transition count 929
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 934 place count 434 transition count 951
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 958 place count 434 transition count 927
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 981 place count 434 transition count 904
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1018 place count 411 transition count 890
Applied a total of 1018 rules in 114 ms. Remains 411 /901 variables (removed 490) and now considering 890/1352 (removed 462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 411/901 places, 890/1352 transitions.
RANDOM walk for 35861 steps (242 resets) in 256 ms. (139 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Product exploration explored 100000 steps with 224 reset in 260 ms.
Product exploration explored 100000 steps with 227 reset in 280 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 4 out of 901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 901/901 places, 1352/1352 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 901 transition count 1352
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 53 Pre rules applied. Total rules applied 27 place count 901 transition count 1405
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 1 with 53 rules applied. Total rules applied 80 place count 901 transition count 1405
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 302 places in 1 ms
Iterating global reduction 1 with 222 rules applied. Total rules applied 302 place count 901 transition count 1405
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 383 place count 820 transition count 1198
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 464 place count 820 transition count 1198
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 488 place count 796 transition count 1174
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 512 place count 796 transition count 1174
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -295
Deduced a syphon composed of 322 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 613 place count 796 transition count 1469
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 357 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 648 place count 796 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 649 place count 795 transition count 1574
Deduced a syphon composed of 356 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 650 place count 795 transition count 1574
Deduced a syphon composed of 356 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 674 place count 795 transition count 1550
Deduced a syphon composed of 356 places in 0 ms
Applied a total of 674 rules in 256 ms. Remains 795 /901 variables (removed 106) and now considering 1550/1352 (removed -198) transitions.
[2024-05-26 07:06:14] [INFO ] Redundant transitions in 94 ms returned []
Running 1548 sub problems to find dead transitions.
// Phase 1: matrix 1550 rows 795 cols
[2024-05-26 07:06:14] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 07:06:14] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/794 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
SMT process timed out in 30940ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 30952ms
Starting structural reductions in SI_LTL mode, iteration 1 : 795/901 places, 1550/1352 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31311 ms. Remains : 795/901 places, 1550/1352 transitions.
Built C files in :
/tmp/ltsmin826319301153828128
[2024-05-26 07:06:45] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin826319301153828128
Running compilation step : cd /tmp/ltsmin826319301153828128;'/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 2847 ms.
Running link step : cd /tmp/ltsmin826319301153828128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin826319301153828128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3027668536621656442.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 1352/1352 transitions.
Applied a total of 0 rules in 27 ms. Remains 901 /901 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
// Phase 1: matrix 1352 rows 901 cols
[2024-05-26 07:07:00] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 07:07:01] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-26 07:07:01] [INFO ] Invariant cache hit.
[2024-05-26 07:07:01] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Running 1351 sub problems to find dead transitions.
[2024-05-26 07:07:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
SMT process timed out in 30308ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 30321ms
Finished structural reductions in LTL mode , in 1 iterations and 31492 ms. Remains : 901/901 places, 1352/1352 transitions.
Built C files in :
/tmp/ltsmin305044584107150623
[2024-05-26 07:07:32] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin305044584107150623
Running compilation step : cd /tmp/ltsmin305044584107150623;'/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 2803 ms.
Running link step : cd /tmp/ltsmin305044584107150623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin305044584107150623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15801148715638061041.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 07:07:47] [INFO ] Flatten gal took : 48 ms
[2024-05-26 07:07:47] [INFO ] Flatten gal took : 45 ms
[2024-05-26 07:07:47] [INFO ] Time to serialize gal into /tmp/LTL8177820272737678074.gal : 12 ms
[2024-05-26 07:07:47] [INFO ] Time to serialize properties into /tmp/LTL11578133527166421003.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/LTL8177820272737678074.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1321268290177222225.hoa' '-atoms' '/tmp/LTL11578133527166421003.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/LTL11578133527166421003.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1321268290177222225.hoa
Detected timeout of ITS tools.
[2024-05-26 07:08:02] [INFO ] Flatten gal took : 59 ms
[2024-05-26 07:08:02] [INFO ] Flatten gal took : 44 ms
[2024-05-26 07:08:02] [INFO ] Time to serialize gal into /tmp/LTL1889397047414704428.gal : 24 ms
[2024-05-26 07:08:02] [INFO ] Time to serialize properties into /tmp/LTL13168367454392535939.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/LTL1889397047414704428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13168367454392535939.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((X((G("((p616==0)||(p700==0))"))&&(F("((p649==0)||(p962==0))"))))||("((p616==1)&&(p700==1))")))))
Formula 0 simplified : XX(!"((p616==1)&&(p700==1))" & X(F!"((p616==0)||(p700==0))" | G!"((p649==0)||(p962==0))"))
Detected timeout of ITS tools.
[2024-05-26 07:08:17] [INFO ] Flatten gal took : 38 ms
[2024-05-26 07:08:17] [INFO ] Applying decomposition
[2024-05-26 07:08:17] [INFO ] Flatten gal took : 37 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/graph14343632306482361195.txt' '-o' '/tmp/graph14343632306482361195.bin' '-w' '/tmp/graph14343632306482361195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14343632306482361195.bin' '-l' '-1' '-v' '-w' '/tmp/graph14343632306482361195.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:08:18] [INFO ] Decomposing Gal with order
[2024-05-26 07:08:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:08:18] [INFO ] Removed a total of 1292 redundant transitions.
[2024-05-26 07:08:18] [INFO ] Flatten gal took : 129 ms
[2024-05-26 07:08:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 38 ms.
[2024-05-26 07:08:18] [INFO ] Time to serialize gal into /tmp/LTL11683898464045109.gal : 17 ms
[2024-05-26 07:08:18] [INFO ] Time to serialize properties into /tmp/LTL15431244904231093866.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/LTL11683898464045109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15431244904231093866.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...253
Read 1 LTL properties
Checking formula 0 : !((X(X((X((G("((i5.u148.p616==0)||(i7.u168.p700==0))"))&&(F("((i7.u154.p649==0)||(i5.u211.p962==0))"))))||("((i5.u148.p616==1)&&(i7.u1...173
Formula 0 simplified : XX(!"((i5.u148.p616==1)&&(i7.u168.p700==1))" & X(F!"((i5.u148.p616==0)||(i7.u168.p700==0))" | G!"((i7.u154.p649==0)||(i5.u211.p962==...161
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-6B-LTLFireability-02 finished in 215242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 78 place count 893 transition count 1275
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 268 place count 798 transition count 1275
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 301 place count 765 transition count 1109
Iterating global reduction 2 with 33 rules applied. Total rules applied 334 place count 765 transition count 1109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 334 place count 765 transition count 1108
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 336 place count 764 transition count 1108
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 759 transition count 1093
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 759 transition count 1093
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 759 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 349 place count 757 transition count 1087
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 757 transition count 1087
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 709 place count 578 transition count 908
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 711 place count 576 transition count 904
Iterating global reduction 3 with 2 rules applied. Total rules applied 713 place count 576 transition count 904
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 714 place count 575 transition count 902
Iterating global reduction 3 with 1 rules applied. Total rules applied 715 place count 575 transition count 902
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 917 place count 474 transition count 932
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 995 place count 435 transition count 947
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1019 place count 435 transition count 923
Applied a total of 1019 rules in 175 ms. Remains 435 /933 variables (removed 498) and now considering 923/1410 (removed 487) transitions.
// Phase 1: matrix 923 rows 435 cols
[2024-05-26 07:08:33] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 07:08:33] [INFO ] Implicit Places using invariants in 256 ms returned [10, 45, 93, 132, 193, 275, 325, 364, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 258 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/933 places, 923/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 402 transition count 899
Applied a total of 48 rules in 17 ms. Remains 402 /426 variables (removed 24) and now considering 899/923 (removed 24) transitions.
// Phase 1: matrix 899 rows 402 cols
[2024-05-26 07:08:33] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 07:08:34] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-26 07:08:34] [INFO ] Invariant cache hit.
[2024-05-26 07:08:34] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 07:08:34] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/933 places, 899/1410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1274 ms. Remains : 402/933 places, 899/1410 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-03
Product exploration explored 100000 steps with 687 reset in 422 ms.
Product exploration explored 100000 steps with 697 reset in 435 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(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) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X 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 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (271 resets) in 292 ms. (136 steps per ms) remains 1/4 properties
BEST_FIRST walk for 31018 steps (11 resets) in 44 ms. (689 steps per ms) remains 0/1 properties
Knowledge obtained : [(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) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 205 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 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 11 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2024-05-26 07:08:36] [INFO ] Invariant cache hit.
[2024-05-26 07:08:36] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-26 07:08:36] [INFO ] Invariant cache hit.
[2024-05-26 07:08:36] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 07:08:37] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2024-05-26 07:08:37] [INFO ] Redundant transitions in 12 ms returned []
Running 889 sub problems to find dead transitions.
[2024-05-26 07:08:37] [INFO ] Invariant cache hit.
[2024-05-26 07:08:37] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 2/402 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 889 unsolved
[2024-05-26 07:08:50] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-26 07:08:53] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (OVERLAPS) 899/1301 variables, 402/461 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/514 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 514 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 889 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 2/402 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (OVERLAPS) 899/1301 variables, 402/461 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/514 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1301 variables, 889/1403 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 1403 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 2/2 constraints]
After SMT, in 60507ms problems are : Problem set: 0 solved, 889 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61426 ms. Remains : 402/402 places, 899/899 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(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) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (267 resets) in 273 ms. (145 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (15 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
[2024-05-26 07:09:38] [INFO ] Invariant cache hit.
[2024-05-26 07:09:38] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/393 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 897/1290 variables, 393/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1290 variables, 53/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1290 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/1301 variables, 9/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1301 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1301 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1301 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 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) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/393 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 897/1290 variables, 393/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1290 variables, 53/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1290 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1290 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1301 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1301 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1301 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1301 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 899/899 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 874
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 64 place count 377 transition count 860
Applied a total of 64 rules in 25 ms. Remains 377 /402 variables (removed 25) and now considering 860/899 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 377/402 places, 860/899 transitions.
RANDOM walk for 33003 steps (246 resets) in 329 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [(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) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 695 reset in 378 ms.
Product exploration explored 100000 steps with 693 reset in 413 ms.
Built C files in :
/tmp/ltsmin15130492164421617463
[2024-05-26 07:09:40] [INFO ] Computing symmetric may disable matrix : 899 transitions.
[2024-05-26 07:09:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:09:40] [INFO ] Computing symmetric may enable matrix : 899 transitions.
[2024-05-26 07:09:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:09:40] [INFO ] Computing Do-Not-Accords matrix : 899 transitions.
[2024-05-26 07:09:40] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:09:40] [INFO ] Built C files in 213ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15130492164421617463
Running compilation step : cd /tmp/ltsmin15130492164421617463;'/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 2832 ms.
Running link step : cd /tmp/ltsmin15130492164421617463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15130492164421617463;'/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/stateBased7294398070870427448.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 14 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2024-05-26 07:09:55] [INFO ] Invariant cache hit.
[2024-05-26 07:09:55] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-26 07:09:55] [INFO ] Invariant cache hit.
[2024-05-26 07:09:55] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 07:09:56] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2024-05-26 07:09:56] [INFO ] Redundant transitions in 9 ms returned []
Running 889 sub problems to find dead transitions.
[2024-05-26 07:09:56] [INFO ] Invariant cache hit.
[2024-05-26 07:09:56] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 2/402 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 889 unsolved
[2024-05-26 07:10:08] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-26 07:10:12] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (OVERLAPS) 899/1301 variables, 402/461 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/514 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 514 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 889 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 2/402 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (OVERLAPS) 899/1301 variables, 402/461 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/514 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1301 variables, 889/1403 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 1403 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 2/2 constraints]
After SMT, in 60516ms problems are : Problem set: 0 solved, 889 unsolved
Search for dead transitions found 0 dead transitions in 60524ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61377 ms. Remains : 402/402 places, 899/899 transitions.
Built C files in :
/tmp/ltsmin7759229618591468891
[2024-05-26 07:10:56] [INFO ] Computing symmetric may disable matrix : 899 transitions.
[2024-05-26 07:10:56] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:10:56] [INFO ] Computing symmetric may enable matrix : 899 transitions.
[2024-05-26 07:10:56] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:10:56] [INFO ] Computing Do-Not-Accords matrix : 899 transitions.
[2024-05-26 07:10:56] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:10:56] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7759229618591468891
Running compilation step : cd /tmp/ltsmin7759229618591468891;'/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 2942 ms.
Running link step : cd /tmp/ltsmin7759229618591468891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin7759229618591468891;'/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/stateBased9503480637085800133.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 07:11:11] [INFO ] Flatten gal took : 38 ms
[2024-05-26 07:11:11] [INFO ] Flatten gal took : 33 ms
[2024-05-26 07:11:11] [INFO ] Time to serialize gal into /tmp/LTL9361600544901556824.gal : 6 ms
[2024-05-26 07:11:11] [INFO ] Time to serialize properties into /tmp/LTL2731535063600453438.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/LTL9361600544901556824.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4985671076620947032.hoa' '-atoms' '/tmp/LTL2731535063600453438.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...317
Loading property file /tmp/LTL2731535063600453438.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4985671076620947032.hoa
Detected timeout of ITS tools.
[2024-05-26 07:11:26] [INFO ] Flatten gal took : 29 ms
[2024-05-26 07:11:26] [INFO ] Flatten gal took : 28 ms
[2024-05-26 07:11:26] [INFO ] Time to serialize gal into /tmp/LTL398335527816059989.gal : 6 ms
[2024-05-26 07:11:26] [INFO ] Time to serialize properties into /tmp/LTL7524179819768382346.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/LTL398335527816059989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7524179819768382346.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...274
Read 1 LTL properties
Checking formula 0 : !((F((G("((p436==0)||(p521==0))"))||(X(("(p808==0)")&&(G(F("(p808==0)"))))))))
Formula 0 simplified : G(F!"((p436==0)||(p521==0))" & X(!"(p808==0)" | FG!"(p808==0)"))
Detected timeout of ITS tools.
[2024-05-26 07:11:42] [INFO ] Flatten gal took : 30 ms
[2024-05-26 07:11:42] [INFO ] Applying decomposition
[2024-05-26 07:11:42] [INFO ] Flatten gal took : 28 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/graph6069722822612274888.txt' '-o' '/tmp/graph6069722822612274888.bin' '-w' '/tmp/graph6069722822612274888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6069722822612274888.bin' '-l' '-1' '-v' '-w' '/tmp/graph6069722822612274888.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:11:42] [INFO ] Decomposing Gal with order
[2024-05-26 07:11:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:11:42] [INFO ] Removed a total of 668 redundant transitions.
[2024-05-26 07:11:42] [INFO ] Flatten gal took : 54 ms
[2024-05-26 07:11:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 602 labels/synchronizations in 31 ms.
[2024-05-26 07:11:42] [INFO ] Time to serialize gal into /tmp/LTL15114962572729000930.gal : 6 ms
[2024-05-26 07:11:42] [INFO ] Time to serialize properties into /tmp/LTL11950858384398073889.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/LTL15114962572729000930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11950858384398073889.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((i3.u10.p436==0)||(i3.u10.p521==0))"))||(X(("(i4.i0.u15.p808==0)")&&(G(F("(i4.i0.u15.p808==0)"))))))))
Formula 0 simplified : G(F!"((i3.u10.p436==0)||(i3.u10.p521==0))" & X(!"(i4.i0.u15.p808==0)" | FG!"(i4.i0.u15.p808==0)"))
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-6B-LTLFireability-03 finished in 203888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(p1 U (G(p1)||(p1&&G(!p2)))))))))'
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1389
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1389
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 913 transition count 1376
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 913 transition count 1376
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 906 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 906 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 902 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 902 transition count 1355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 902 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 901 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 901 transition count 1353
Applied a total of 65 rules in 90 ms. Remains 901 /933 variables (removed 32) and now considering 1353/1410 (removed 57) transitions.
// Phase 1: matrix 1353 rows 901 cols
[2024-05-26 07:11:57] [INFO ] Computed 66 invariants in 11 ms
[2024-05-26 07:11:57] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-26 07:11:57] [INFO ] Invariant cache hit.
[2024-05-26 07:11:58] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2024-05-26 07:11:58] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
SMT process timed out in 30316ms, After SMT, problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 30328ms
Starting structural reductions in LTL mode, iteration 1 : 901/933 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31580 ms. Remains : 901/933 places, 1353/1410 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), p2, (NOT p1), (AND p0 p2), (AND p2 (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-04
Product exploration explored 100000 steps with 224 reset in 365 ms.
Product exploration explored 100000 steps with 224 reset in 408 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 119 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter sensitive) to 9 states, 35 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[true, p0, p0, (NOT p1), (AND p0 (NOT p1)), p2, (AND (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2)]
RANDOM walk for 40000 steps (89 resets) in 401 ms. (99 steps per ms) remains 5/19 properties
BEST_FIRST walk for 40003 steps (9 resets) in 396 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 275 ms. (144 steps per ms) remains 1/5 properties
[2024-05-26 07:12:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/149 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 752/901 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1353/2254 variables, 901/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2254 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2254 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2254/2254 variables, and 967 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 901/901 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/149 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 752/901 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1353/2254 variables, 901/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2254 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2254 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2254 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2254/2254 variables, and 968 constraints, problems are : Problem set: 0 solved, 1 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 901/901 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1090ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 5 out of 901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 901/901 places, 1353/1353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 901 transition count 1326
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 874 transition count 1326
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 54 place count 874 transition count 1229
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 248 place count 777 transition count 1229
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 272 place count 753 transition count 1079
Iterating global reduction 2 with 24 rules applied. Total rules applied 296 place count 753 transition count 1079
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 652 place count 575 transition count 901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 854 place count 474 transition count 933
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 930 place count 436 transition count 955
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 954 place count 436 transition count 931
Free-agglomeration rule applied 21 times.
Iterating global reduction 2 with 21 rules applied. Total rules applied 975 place count 436 transition count 910
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1008 place count 415 transition count 898
Applied a total of 1008 rules in 98 ms. Remains 415 /901 variables (removed 486) and now considering 898/1353 (removed 455) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 415/901 places, 898/1353 transitions.
RANDOM walk for 40000 steps (268 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34080 steps (10 resets) in 66 ms. (508 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) (NOT p2) p1)))
Knowledge based reduction with 20 factoid took 158 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6B-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLFireability-04 finished in 35274 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)&&F(p1))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 78 place count 893 transition count 1275
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 268 place count 798 transition count 1275
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 299 place count 767 transition count 1117
Iterating global reduction 2 with 31 rules applied. Total rules applied 330 place count 767 transition count 1117
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 334 place count 763 transition count 1109
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 763 transition count 1109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 339 place count 763 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 340 place count 762 transition count 1106
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 762 transition count 1106
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 701 place count 582 transition count 926
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 703 place count 580 transition count 922
Iterating global reduction 3 with 2 rules applied. Total rules applied 705 place count 580 transition count 922
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 706 place count 579 transition count 920
Iterating global reduction 3 with 1 rules applied. Total rules applied 707 place count 579 transition count 920
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 909 place count 478 transition count 952
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 987 place count 439 transition count 968
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 1012 place count 439 transition count 943
Applied a total of 1012 rules in 143 ms. Remains 439 /933 variables (removed 494) and now considering 943/1410 (removed 467) transitions.
[2024-05-26 07:12:32] [INFO ] Flow matrix only has 941 transitions (discarded 2 similar events)
// Phase 1: matrix 941 rows 439 cols
[2024-05-26 07:12:32] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 07:12:33] [INFO ] Implicit Places using invariants in 248 ms returned [12, 47, 95, 134, 194, 274, 324, 365, 417]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 249 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 430/933 places, 943/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 406 transition count 919
Applied a total of 48 rules in 15 ms. Remains 406 /430 variables (removed 24) and now considering 919/943 (removed 24) transitions.
[2024-05-26 07:12:33] [INFO ] Flow matrix only has 917 transitions (discarded 2 similar events)
// Phase 1: matrix 917 rows 406 cols
[2024-05-26 07:12:33] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 07:12:33] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-26 07:12:33] [INFO ] Flow matrix only has 917 transitions (discarded 2 similar events)
[2024-05-26 07:12:33] [INFO ] Invariant cache hit.
[2024-05-26 07:12:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 07:12:33] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 406/933 places, 919/1410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1227 ms. Remains : 406/933 places, 919/1410 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-05
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-05 finished in 1365 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)&&(p1||G(p2)))))'
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1376
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1376
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 907 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 907 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 903 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 903 transition count 1355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 903 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 902 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 902 transition count 1353
Applied a total of 63 rules in 87 ms. Remains 902 /933 variables (removed 31) and now considering 1353/1410 (removed 57) transitions.
// Phase 1: matrix 1353 rows 902 cols
[2024-05-26 07:12:34] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 07:12:34] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-26 07:12:34] [INFO ] Invariant cache hit.
[2024-05-26 07:12:35] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2024-05-26 07:12:35] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 30317ms
Starting structural reductions in LTL mode, iteration 1 : 902/933 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31633 ms. Remains : 902/933 places, 1353/1410 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4289 steps with 9 reset in 15 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-06 finished in 31874 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(p1)||(X(G(p3))&&p2))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 920 transition count 1387
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 920 transition count 1387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 912 transition count 1374
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 912 transition count 1374
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 905 transition count 1358
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 905 transition count 1358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 901 transition count 1353
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 901 transition count 1353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 901 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 900 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 900 transition count 1351
Applied a total of 67 rules in 89 ms. Remains 900 /933 variables (removed 33) and now considering 1351/1410 (removed 59) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2024-05-26 07:13:05] [INFO ] Computed 66 invariants in 12 ms
[2024-05-26 07:13:06] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-26 07:13:06] [INFO ] Invariant cache hit.
[2024-05-26 07:13:07] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Running 1350 sub problems to find dead transitions.
[2024-05-26 07:13:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/899 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
SMT process timed out in 30361ms, After SMT, problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 30375ms
Starting structural reductions in LTL mode, iteration 1 : 900/933 places, 1351/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31696 ms. Remains : 900/933 places, 1351/1410 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-07
Product exploration explored 100000 steps with 9341 reset in 178 ms.
Product exploration explored 100000 steps with 9354 reset in 185 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p3))), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 31 factoid took 174 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 35 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p3))), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 31 factoid took 158 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 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
[2024-05-26 07:13:38] [INFO ] Invariant cache hit.
[2024-05-26 07:13:39] [INFO ] [Real]Absence check using 66 positive place invariants in 45 ms returned sat
[2024-05-26 07:13:42] [INFO ] [Real]Absence check using state equation in 3106 ms returned sat
[2024-05-26 07:13:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:13:43] [INFO ] [Nat]Absence check using 66 positive place invariants in 55 ms returned sat
[2024-05-26 07:13:46] [INFO ] [Nat]Absence check using state equation in 3456 ms returned sat
[2024-05-26 07:13:46] [INFO ] Computed and/alt/rep : 1289/3840/1289 causal constraints (skipped 61 transitions) in 139 ms.
Could not prove EG (NOT p1)
Support contains 1 out of 900 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 1351/1351 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 899 transition count 1323
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 872 transition count 1323
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 54 place count 872 transition count 1226
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 248 place count 775 transition count 1226
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 272 place count 751 transition count 1076
Iterating global reduction 2 with 24 rules applied. Total rules applied 296 place count 751 transition count 1076
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 646 place count 576 transition count 901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 848 place count 475 transition count 930
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 924 place count 437 transition count 943
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 948 place count 437 transition count 919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 949 place count 436 transition count 918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 950 place count 435 transition count 918
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 954 place count 433 transition count 916
Applied a total of 954 rules in 113 ms. Remains 433 /900 variables (removed 467) and now considering 916/1351 (removed 435) transitions.
// Phase 1: matrix 916 rows 433 cols
[2024-05-26 07:13:57] [INFO ] Computed 65 invariants in 2 ms
[2024-05-26 07:13:57] [INFO ] Implicit Places using invariants in 327 ms returned [11, 47, 95, 134, 194, 275, 325, 364]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 339 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/900 places, 916/1351 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 403 transition count 894
Applied a total of 44 rules in 14 ms. Remains 403 /425 variables (removed 22) and now considering 894/916 (removed 22) transitions.
// Phase 1: matrix 894 rows 403 cols
[2024-05-26 07:13:57] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 07:13:58] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-26 07:13:58] [INFO ] Invariant cache hit.
[2024-05-26 07:13:58] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 07:13:58] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 403/900 places, 894/1351 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1432 ms. Remains : 403/900 places, 894/1351 transitions.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 172 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 61 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 7 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 261 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 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
[2024-05-26 07:13:59] [INFO ] Invariant cache hit.
[2024-05-26 07:13:59] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2024-05-26 07:14:00] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2024-05-26 07:14:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:14:00] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-05-26 07:14:01] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2024-05-26 07:14:01] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 07:14:01] [INFO ] [Nat]Added 51 Read/Feed constraints in 122 ms returned sat
[2024-05-26 07:14:01] [INFO ] Computed and/alt/rep : 590/4099/590 causal constraints (skipped 298 transitions) in 58 ms.
[2024-05-26 07:14:03] [INFO ] Added : 173 causal constraints over 35 iterations in 2110 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 40249 reset in 824 ms.
Product exploration explored 100000 steps with 40287 reset in 801 ms.
Built C files in :
/tmp/ltsmin2241215030157559151
[2024-05-26 07:14:05] [INFO ] Computing symmetric may disable matrix : 894 transitions.
[2024-05-26 07:14:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:14:05] [INFO ] Computing symmetric may enable matrix : 894 transitions.
[2024-05-26 07:14:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:14:05] [INFO ] Computing Do-Not-Accords matrix : 894 transitions.
[2024-05-26 07:14:05] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:14:05] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2241215030157559151
Running compilation step : cd /tmp/ltsmin2241215030157559151;'/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 2794 ms.
Running link step : cd /tmp/ltsmin2241215030157559151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2241215030157559151;'/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/stateBased18002104355462133312.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 894/894 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 893
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 400 transition count 895
Applied a total of 6 rules in 21 ms. Remains 400 /403 variables (removed 3) and now considering 895/894 (removed -1) transitions.
// Phase 1: matrix 895 rows 400 cols
[2024-05-26 07:14:20] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 07:14:20] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-26 07:14:20] [INFO ] Invariant cache hit.
[2024-05-26 07:14:20] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 07:14:21] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-26 07:14:21] [INFO ] Redundant transitions in 7 ms returned []
Running 885 sub problems to find dead transitions.
[2024-05-26 07:14:21] [INFO ] Invariant cache hit.
[2024-05-26 07:14:21] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (OVERLAPS) 2/400 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 885 unsolved
[2024-05-26 07:14:34] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 5 (OVERLAPS) 895/1295 variables, 400/458 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 51/509 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 509 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 400/400 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 885/885 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 885 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (OVERLAPS) 2/400 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 5 (OVERLAPS) 895/1295 variables, 400/458 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 51/509 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1295 variables, 885/1394 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1394 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 400/400 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 885/885 constraints, Known Traps: 1/1 constraints]
After SMT, in 60464ms problems are : Problem set: 0 solved, 885 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Starting structural reductions in SI_LTL mode, iteration 1 : 400/403 places, 895/894 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61307 ms. Remains : 400/403 places, 895/894 transitions.
Built C files in :
/tmp/ltsmin6140255375025200861
[2024-05-26 07:15:21] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-26 07:15:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:15:21] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-26 07:15:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:15:21] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-26 07:15:21] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:15:21] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6140255375025200861
Running compilation step : cd /tmp/ltsmin6140255375025200861;'/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 2822 ms.
Running link step : cd /tmp/ltsmin6140255375025200861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin6140255375025200861;'/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/stateBased14085614237684312048.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 07:15:36] [INFO ] Flatten gal took : 27 ms
[2024-05-26 07:15:36] [INFO ] Flatten gal took : 26 ms
[2024-05-26 07:15:36] [INFO ] Time to serialize gal into /tmp/LTL3543744727288577588.gal : 4 ms
[2024-05-26 07:15:36] [INFO ] Time to serialize properties into /tmp/LTL8000061262839064524.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/LTL3543744727288577588.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4041579191592955857.hoa' '-atoms' '/tmp/LTL8000061262839064524.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...317
Loading property file /tmp/LTL8000061262839064524.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4041579191592955857.hoa
Detected timeout of ITS tools.
[2024-05-26 07:15:51] [INFO ] Flatten gal took : 24 ms
[2024-05-26 07:15:51] [INFO ] Flatten gal took : 25 ms
[2024-05-26 07:15:51] [INFO ] Time to serialize gal into /tmp/LTL7541171746509833242.gal : 4 ms
[2024-05-26 07:15:51] [INFO ] Time to serialize properties into /tmp/LTL4892406277133090016.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/LTL7541171746509833242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4892406277133090016.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 : !((("(p842==1)")U((F("(p1437==1)"))||(("((p181==1)&&(p324==1))")&&(X(G("((p181==1)&&(p324==1))")))))))
Formula 0 simplified : !"(p842==1)" R (G!"(p1437==1)" & F!"((p181==1)&&(p324==1))")
Detected timeout of ITS tools.
[2024-05-26 07:16:06] [INFO ] Flatten gal took : 27 ms
[2024-05-26 07:16:06] [INFO ] Applying decomposition
[2024-05-26 07:16:06] [INFO ] Flatten gal took : 25 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/graph13929371614344825520.txt' '-o' '/tmp/graph13929371614344825520.bin' '-w' '/tmp/graph13929371614344825520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13929371614344825520.bin' '-l' '-1' '-v' '-w' '/tmp/graph13929371614344825520.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:16:06] [INFO ] Decomposing Gal with order
[2024-05-26 07:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:16:06] [INFO ] Removed a total of 522 redundant transitions.
[2024-05-26 07:16:06] [INFO ] Flatten gal took : 49 ms
[2024-05-26 07:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 542 labels/synchronizations in 14 ms.
[2024-05-26 07:16:06] [INFO ] Time to serialize gal into /tmp/LTL13524090994546468658.gal : 6 ms
[2024-05-26 07:16:06] [INFO ] Time to serialize properties into /tmp/LTL1987416131893298903.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/LTL13524090994546468658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1987416131893298903.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 : !((("(i4.u14.p842==1)")U((F("(i7.u30.p1437==1)"))||(("((i1.u6.p181==1)&&(i1.u6.p324==1))")&&(X(G("((i1.u6.p181==1)&&(i1.u6.p324==1))")...161
Formula 0 simplified : !"(i4.u14.p842==1)" R (G!"(i7.u30.p1437==1)" & F!"((i1.u6.p181==1)&&(i1.u6.p324==1))")
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-6B-LTLFireability-07 finished in 196187 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)&&F(G(p1)))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 78 place count 893 transition count 1274
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 270 place count 797 transition count 1274
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 303 place count 764 transition count 1108
Iterating global reduction 2 with 33 rules applied. Total rules applied 336 place count 764 transition count 1108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 336 place count 764 transition count 1107
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 763 transition count 1107
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 344 place count 757 transition count 1090
Iterating global reduction 2 with 6 rules applied. Total rules applied 350 place count 757 transition count 1090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 757 transition count 1089
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 353 place count 755 transition count 1084
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 755 transition count 1084
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 709 place count 578 transition count 907
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 711 place count 576 transition count 903
Iterating global reduction 3 with 2 rules applied. Total rules applied 713 place count 576 transition count 903
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 714 place count 575 transition count 901
Iterating global reduction 3 with 1 rules applied. Total rules applied 715 place count 575 transition count 901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 917 place count 474 transition count 931
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 991 place count 437 transition count 943
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1015 place count 437 transition count 919
Applied a total of 1015 rules in 141 ms. Remains 437 /933 variables (removed 496) and now considering 919/1410 (removed 491) transitions.
// Phase 1: matrix 919 rows 437 cols
[2024-05-26 07:16:22] [INFO ] Computed 66 invariants in 3 ms
[2024-05-26 07:16:22] [INFO ] Implicit Places using invariants in 227 ms returned [11, 46, 94, 134, 196, 276, 327, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 228 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/933 places, 919/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 404 transition count 895
Applied a total of 48 rules in 14 ms. Remains 404 /428 variables (removed 24) and now considering 895/919 (removed 24) transitions.
// Phase 1: matrix 895 rows 404 cols
[2024-05-26 07:16:22] [INFO ] Computed 57 invariants in 8 ms
[2024-05-26 07:16:22] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-26 07:16:22] [INFO ] Invariant cache hit.
[2024-05-26 07:16:22] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 07:16:23] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/933 places, 895/1410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1187 ms. Remains : 404/933 places, 895/1410 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-09
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-09 finished in 1332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)&&X(!p2)))))'
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 920 transition count 1387
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 920 transition count 1387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 912 transition count 1374
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 912 transition count 1374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 906 transition count 1364
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 906 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 903 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 903 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 903 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 902 transition count 1358
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 902 transition count 1358
Applied a total of 63 rules in 86 ms. Remains 902 /933 variables (removed 31) and now considering 1358/1410 (removed 52) transitions.
// Phase 1: matrix 1358 rows 902 cols
[2024-05-26 07:16:23] [INFO ] Computed 66 invariants in 11 ms
[2024-05-26 07:16:23] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-26 07:16:23] [INFO ] Invariant cache hit.
[2024-05-26 07:16:24] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
Running 1357 sub problems to find dead transitions.
[2024-05-26 07:16:24] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1357 unsolved
SMT process timed out in 30334ms, After SMT, problems are : Problem set: 0 solved, 1357 unsolved
Search for dead transitions found 0 dead transitions in 30346ms
Starting structural reductions in LTL mode, iteration 1 : 902/933 places, 1358/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31639 ms. Remains : 902/933 places, 1358/1410 transitions.
Stuttering acceptance computed with spot in 177 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10
Product exploration explored 100000 steps with 247 reset in 277 ms.
Product exploration explored 100000 steps with 241 reset in 282 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 146 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
RANDOM walk for 40000 steps (86 resets) in 593 ms. (67 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
[2024-05-26 07:16:56] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/143 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 759/902 variables, 60/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 07:16:56] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 1/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1358/2260 variables, 902/969 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2260 variables, 0/969 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2260 variables, 0/969 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2260/2260 variables, and 969 constraints, problems are : Problem set: 1 solved, 1 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 902/902 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/122 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 780/902 variables, 62/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 1/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 07:16:57] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1358/2260 variables, 902/970 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2260 variables, 1/971 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2260 variables, 0/971 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2260 variables, 0/971 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2260/2260 variables, and 971 constraints, problems are : Problem set: 1 solved, 1 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 902/902 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1273ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 4 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 902 transition count 1330
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 874 transition count 1330
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 874 transition count 1235
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 779 transition count 1235
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 756 transition count 1087
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 756 transition count 1087
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 652 place count 576 transition count 907
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 854 place count 475 transition count 937
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 932 place count 436 transition count 957
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 958 place count 436 transition count 931
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 982 place count 436 transition count 907
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1018 place count 412 transition count 895
Applied a total of 1018 rules in 93 ms. Remains 412 /902 variables (removed 490) and now considering 895/1358 (removed 463) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 412/902 places, 895/1358 transitions.
RANDOM walk for 40000 steps (272 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (14 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 404674 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 404674 steps, saw 112921 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
// Phase 1: matrix 895 rows 412 cols
[2024-05-26 07:17:01] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 07:17:01] [INFO ] State equation strengthened by 54 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) 38/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 370/412 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 895/1307 variables, 412/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1307 variables, 54/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1307 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1307 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1307/1307 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 412/412 constraints, ReadFeed: 54/54 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 370/412 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 895/1307 variables, 412/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1307 variables, 54/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1307 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1307 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1307 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1307/1307 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 412/412 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 895/895 transitions.
Applied a total of 0 rules in 8 ms. Remains 412 /412 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 412/412 places, 895/895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 895/895 transitions.
Applied a total of 0 rules in 8 ms. Remains 412 /412 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-26 07:17:01] [INFO ] Invariant cache hit.
[2024-05-26 07:17:01] [INFO ] Implicit Places using invariants in 220 ms returned [10, 45, 89, 128, 184, 257, 303, 344, 392]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 222 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 403/412 places, 895/895 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 379 transition count 871
Applied a total of 48 rules in 12 ms. Remains 379 /403 variables (removed 24) and now considering 871/895 (removed 24) transitions.
// Phase 1: matrix 871 rows 379 cols
[2024-05-26 07:17:01] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 07:17:02] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-26 07:17:02] [INFO ] Invariant cache hit.
[2024-05-26 07:17:02] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 07:17:02] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 379/412 places, 871/895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1021 ms. Remains : 379/412 places, 871/895 transitions.
RANDOM walk for 30082 steps (220 resets) in 149 ms. (200 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (G (OR (NOT p2) (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 293 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 105 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 901 transition count 1329
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 873 transition count 1329
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 873 transition count 1234
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 778 transition count 1234
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 755 transition count 1086
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 755 transition count 1086
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 646 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 848 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 924 place count 439 transition count 959
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 950 place count 439 transition count 933
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 951 place count 438 transition count 932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 952 place count 437 transition count 932
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 956 place count 435 transition count 930
Applied a total of 956 rules in 109 ms. Remains 435 /902 variables (removed 467) and now considering 930/1358 (removed 428) transitions.
// Phase 1: matrix 930 rows 435 cols
[2024-05-26 07:17:03] [INFO ] Computed 65 invariants in 7 ms
[2024-05-26 07:17:03] [INFO ] Implicit Places using invariants in 241 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 243 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/902 places, 930/1358 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 405 transition count 908
Applied a total of 44 rules in 14 ms. Remains 405 /427 variables (removed 22) and now considering 908/930 (removed 22) transitions.
// Phase 1: matrix 908 rows 405 cols
[2024-05-26 07:17:03] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 07:17:03] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-26 07:17:03] [INFO ] Invariant cache hit.
[2024-05-26 07:17:03] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 07:17:04] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/902 places, 908/1358 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1138 ms. Remains : 405/902 places, 908/1358 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 70 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 10490 steps (67 resets) in 143 ms. (72 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 118 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 128 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 680 reset in 397 ms.
Product exploration explored 100000 steps with 682 reset in 431 ms.
Built C files in :
/tmp/ltsmin13122621969864973447
[2024-05-26 07:17:05] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2024-05-26 07:17:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:17:05] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2024-05-26 07:17:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:17:06] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2024-05-26 07:17:06] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:17:06] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13122621969864973447
Running compilation step : cd /tmp/ltsmin13122621969864973447;'/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 2849 ms.
Running link step : cd /tmp/ltsmin13122621969864973447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13122621969864973447;'/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/stateBased5019921808605491226.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 908/908 transitions.
Applied a total of 0 rules in 9 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2024-05-26 07:17:21] [INFO ] Invariant cache hit.
[2024-05-26 07:17:21] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-26 07:17:21] [INFO ] Invariant cache hit.
[2024-05-26 07:17:21] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 07:17:21] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2024-05-26 07:17:21] [INFO ] Redundant transitions in 11 ms returned []
Running 898 sub problems to find dead transitions.
[2024-05-26 07:17:21] [INFO ] Invariant cache hit.
[2024-05-26 07:17:21] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 07:17:35] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-26 07:17:35] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-26 07:17:35] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-26 07:17:39] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-26 07:17:39] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-05-26 07:17:39] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 898 unsolved
SMT process timed out in 30478ms, After SMT, problems are : Problem set: 0 solved, 898 unsolved
Search for dead transitions found 0 dead transitions in 30486ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31317 ms. Remains : 405/405 places, 908/908 transitions.
Built C files in :
/tmp/ltsmin212437924436465285
[2024-05-26 07:17:52] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2024-05-26 07:17:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:17:52] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2024-05-26 07:17:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:17:52] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2024-05-26 07:17:52] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:17:52] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin212437924436465285
Running compilation step : cd /tmp/ltsmin212437924436465285;'/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 2936 ms.
Running link step : cd /tmp/ltsmin212437924436465285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin212437924436465285;'/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/stateBased1676430512373596274.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 07:18:07] [INFO ] Flatten gal took : 26 ms
[2024-05-26 07:18:07] [INFO ] Flatten gal took : 26 ms
[2024-05-26 07:18:07] [INFO ] Time to serialize gal into /tmp/LTL11197259597627805959.gal : 5 ms
[2024-05-26 07:18:07] [INFO ] Time to serialize properties into /tmp/LTL18133472771608465646.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/LTL11197259597627805959.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13602167034451489644.hoa' '-atoms' '/tmp/LTL18133472771608465646.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18133472771608465646.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13602167034451489644.hoa
Detected timeout of ITS tools.
[2024-05-26 07:18:22] [INFO ] Flatten gal took : 26 ms
[2024-05-26 07:18:22] [INFO ] Flatten gal took : 25 ms
[2024-05-26 07:18:22] [INFO ] Time to serialize gal into /tmp/LTL5194146281355876284.gal : 4 ms
[2024-05-26 07:18:22] [INFO ] Time to serialize properties into /tmp/LTL648651296509047889.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/LTL5194146281355876284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL648651296509047889.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...274
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))")))||(((F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))"))&&(G...220
Formula 0 simplified : G(FG!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" & (G!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" | F!"((p615=...204
Detected timeout of ITS tools.
[2024-05-26 07:18:37] [INFO ] Flatten gal took : 28 ms
[2024-05-26 07:18:37] [INFO ] Applying decomposition
[2024-05-26 07:18:37] [INFO ] Flatten gal took : 26 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/graph5807773929974243775.txt' '-o' '/tmp/graph5807773929974243775.bin' '-w' '/tmp/graph5807773929974243775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5807773929974243775.bin' '-l' '-1' '-v' '-w' '/tmp/graph5807773929974243775.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:18:37] [INFO ] Decomposing Gal with order
[2024-05-26 07:18:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:18:37] [INFO ] Removed a total of 685 redundant transitions.
[2024-05-26 07:18:37] [INFO ] Flatten gal took : 48 ms
[2024-05-26 07:18:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 613 labels/synchronizations in 27 ms.
[2024-05-26 07:18:37] [INFO ] Time to serialize gal into /tmp/LTL33221353296225292.gal : 6 ms
[2024-05-26 07:18:37] [INFO ] Time to serialize properties into /tmp/LTL17670648653222973880.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/LTL33221353296225292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17670648653222973880.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...253
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((i8.u33.p1468!=1)||(i8.u34.p1537!=1))||((i7.u32.p1306==1)&&(i7.u31.p1407==1)))")))||(((F("(((i8.u33.p1468!=1)||(i8.u34.p1...310
Formula 0 simplified : G(FG!"(((i8.u33.p1468!=1)||(i8.u34.p1537!=1))||((i7.u32.p1306==1)&&(i7.u31.p1407==1)))" & (G!"(((i8.u33.p1468!=1)||(i8.u34.p1537!=1)...294
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 149587 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(F(p0))||G(p1))))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1377
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1377
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 907 transition count 1361
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 907 transition count 1361
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 903 transition count 1356
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 903 transition count 1356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 903 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 902 transition count 1354
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 902 transition count 1354
Applied a total of 63 rules in 87 ms. Remains 902 /933 variables (removed 31) and now considering 1354/1410 (removed 56) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2024-05-26 07:18:53] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 07:18:53] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-26 07:18:53] [INFO ] Invariant cache hit.
[2024-05-26 07:18:54] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
Running 1353 sub problems to find dead transitions.
[2024-05-26 07:18:54] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
SMT process timed out in 30318ms, After SMT, problems are : Problem set: 0 solved, 1353 unsolved
Search for dead transitions found 0 dead transitions in 30330ms
Starting structural reductions in LTL mode, iteration 1 : 902/933 places, 1354/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31633 ms. Remains : 902/933 places, 1354/1410 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12
Product exploration explored 100000 steps with 225 reset in 236 ms.
Product exploration explored 100000 steps with 230 reset in 275 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 36816 steps (81 resets) in 461 ms. (79 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 14 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
[2024-05-26 07:19:26] [INFO ] Invariant cache hit.
[2024-05-26 07:19:27] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-26 07:19:27] [INFO ] Invariant cache hit.
[2024-05-26 07:19:27] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Running 1353 sub problems to find dead transitions.
[2024-05-26 07:19:27] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 timeout
1.0)
(s118 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
SMT process timed out in 30317ms, After SMT, problems are : Problem set: 0 solved, 1353 unsolved
Search for dead transitions found 0 dead transitions in 30328ms
Finished structural reductions in LTL mode , in 1 iterations and 31497 ms. Remains : 902/902 places, 1354/1354 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 30610 steps (69 resets) in 490 ms. (62 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 224 reset in 266 ms.
Product exploration explored 100000 steps with 218 reset in 265 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 902 transition count 1354
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 27 place count 902 transition count 1406
Deduced a syphon composed of 79 places in 3 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 79 place count 902 transition count 1406
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 301 places in 1 ms
Iterating global reduction 1 with 222 rules applied. Total rules applied 301 place count 902 transition count 1406
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 382 place count 821 transition count 1199
Deduced a syphon composed of 244 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 463 place count 821 transition count 1199
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 487 place count 797 transition count 1175
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 511 place count 797 transition count 1175
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -308
Deduced a syphon composed of 321 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 612 place count 797 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 613 place count 796 transition count 1481
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 614 place count 796 transition count 1481
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -113
Deduced a syphon composed of 358 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 652 place count 796 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 653 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 654 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 678 place count 795 transition count 1568
Deduced a syphon composed of 357 places in 0 ms
Applied a total of 678 rules in 164 ms. Remains 795 /902 variables (removed 107) and now considering 1568/1354 (removed -214) transitions.
[2024-05-26 07:20:00] [INFO ] Redundant transitions in 19 ms returned []
Running 1566 sub problems to find dead transitions.
// Phase 1: matrix 1568 rows 795 cols
[2024-05-26 07:20:00] [INFO ] Computed 66 invariants in 13 ms
[2024-05-26 07:20:00] [INFO ] State equation strengthened by 53 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/794 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1566 unsolved
SMT process timed out in 30928ms, After SMT, problems are : Problem set: 0 solved, 1566 unsolved
Search for dead transitions found 0 dead transitions in 30940ms
Starting structural reductions in SI_LTL mode, iteration 1 : 795/902 places, 1568/1354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31137 ms. Remains : 795/902 places, 1568/1354 transitions.
Built C files in :
/tmp/ltsmin16059808036430948608
[2024-05-26 07:20:31] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16059808036430948608
Running compilation step : cd /tmp/ltsmin16059808036430948608;'/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 2777 ms.
Running link step : cd /tmp/ltsmin16059808036430948608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16059808036430948608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10344399080046734113.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 18 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2024-05-26 07:20:47] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 07:20:47] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-26 07:20:47] [INFO ] Invariant cache hit.
[2024-05-26 07:20:48] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Running 1353 sub problems to find dead transitions.
[2024-05-26 07:20:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
SMT process timed out in 30310ms, After SMT, problems are : Problem set: 0 solved, 1353 unsolved
Search for dead transitions found 0 dead transitions in 30320ms
Finished structural reductions in LTL mode , in 1 iterations and 31526 ms. Remains : 902/902 places, 1354/1354 transitions.
Built C files in :
/tmp/ltsmin1734905606020675472
[2024-05-26 07:21:18] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1734905606020675472
Running compilation step : cd /tmp/ltsmin1734905606020675472;'/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 2831 ms.
Running link step : cd /tmp/ltsmin1734905606020675472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1734905606020675472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13655522377382759176.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 07:21:33] [INFO ] Flatten gal took : 34 ms
[2024-05-26 07:21:33] [INFO ] Flatten gal took : 28 ms
[2024-05-26 07:21:33] [INFO ] Time to serialize gal into /tmp/LTL4748437931279475559.gal : 4 ms
[2024-05-26 07:21:33] [INFO ] Time to serialize properties into /tmp/LTL5418253090999695060.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/LTL4748437931279475559.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6118073167091640812.hoa' '-atoms' '/tmp/LTL5418253090999695060.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...317
Loading property file /tmp/LTL5418253090999695060.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6118073167091640812.hoa
Detected timeout of ITS tools.
[2024-05-26 07:21:48] [INFO ] Flatten gal took : 29 ms
[2024-05-26 07:21:48] [INFO ] Flatten gal took : 29 ms
[2024-05-26 07:21:48] [INFO ] Time to serialize gal into /tmp/LTL16180293023123562690.gal : 4 ms
[2024-05-26 07:21:48] [INFO ] Time to serialize properties into /tmp/LTL8156634514331869535.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/LTL16180293023123562690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8156634514331869535.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(p231==0)")))||(G("((p433==1)&&(p521==1))")))))))
Formula 0 simplified : XXX(FG!"(p231==0)" & F!"((p433==1)&&(p521==1))")
Detected timeout of ITS tools.
[2024-05-26 07:22:03] [INFO ] Flatten gal took : 29 ms
[2024-05-26 07:22:03] [INFO ] Applying decomposition
[2024-05-26 07:22:03] [INFO ] Flatten gal took : 29 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/graph10055588369417875676.txt' '-o' '/tmp/graph10055588369417875676.bin' '-w' '/tmp/graph10055588369417875676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10055588369417875676.bin' '-l' '-1' '-v' '-w' '/tmp/graph10055588369417875676.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:22:04] [INFO ] Decomposing Gal with order
[2024-05-26 07:22:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:22:04] [INFO ] Removed a total of 1301 redundant transitions.
[2024-05-26 07:22:04] [INFO ] Flatten gal took : 53 ms
[2024-05-26 07:22:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 14 ms.
[2024-05-26 07:22:04] [INFO ] Time to serialize gal into /tmp/LTL8601013685155848175.gal : 8 ms
[2024-05-26 07:22:04] [INFO ] Time to serialize properties into /tmp/LTL8579470918720162575.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/LTL8601013685155848175.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8579470918720162575.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(X(X((G(F("(i1.i0.i1.u60.p231==0)")))||(G("((i4.i0.i4.u113.p433==1)&&(i4.i0.i3.u131.p521==1))")))))))
Formula 0 simplified : XXX(FG!"(i1.i0.i1.u60.p231==0)" & F!"((i4.i0.i4.u113.p433==1)&&(i4.i0.i3.u131.p521==1))")
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 206293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F((!p0&&X(G(p1))))||G(p0))))))'
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1377
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1377
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 908 transition count 1363
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 908 transition count 1363
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 905 transition count 1359
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 905 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 904 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 904 transition count 1358
Applied a total of 58 rules in 86 ms. Remains 904 /933 variables (removed 29) and now considering 1358/1410 (removed 52) transitions.
// Phase 1: matrix 1358 rows 904 cols
[2024-05-26 07:22:19] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 07:22:19] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-26 07:22:19] [INFO ] Invariant cache hit.
[2024-05-26 07:22:20] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
Running 1357 sub problems to find dead transitions.
[2024-05-26 07:22:20] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1357 unsolved
SMT process timed out in 30309ms, After SMT, problems are : Problem set: 0 solved, 1357 unsolved
Search for dead transitions found 0 dead transitions in 30327ms
Starting structural reductions in LTL mode, iteration 1 : 904/933 places, 1358/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31571 ms. Remains : 904/933 places, 1358/1410 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-13 finished in 31849 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||X(p1))))&&F(p2)))'
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 922 transition count 1390
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 922 transition count 1390
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 916 transition count 1380
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 916 transition count 1380
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 911 transition count 1368
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 911 transition count 1368
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 909 transition count 1366
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 909 transition count 1366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 909 transition count 1365
Applied a total of 49 rules in 81 ms. Remains 909 /933 variables (removed 24) and now considering 1365/1410 (removed 45) transitions.
// Phase 1: matrix 1365 rows 909 cols
[2024-05-26 07:22:51] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 07:22:51] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-26 07:22:51] [INFO ] Invariant cache hit.
[2024-05-26 07:22:52] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Running 1364 sub problems to find dead transitions.
[2024-05-26 07:22:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1364 unsolved
SMT process timed out in 30297ms, After SMT, problems are : Problem set: 0 solved, 1364 unsolved
Search for dead transitions found 0 dead transitions in 30310ms
Starting structural reductions in LTL mode, iteration 1 : 909/933 places, 1365/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31582 ms. Remains : 909/933 places, 1365/1410 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-15
Stuttering criterion allowed to conclude after 349 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-15 finished in 31793 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((p0||X((G(p1)&&F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
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(p1)||(X(G(p3))&&p2))))'
Found a Lengthening insensitive property : NoC3x3-PT-6B-LTLFireability-07
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 78 place count 893 transition count 1274
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 270 place count 797 transition count 1274
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 304 place count 763 transition count 1106
Iterating global reduction 2 with 34 rules applied. Total rules applied 338 place count 763 transition count 1106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 763 transition count 1105
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 762 transition count 1105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 346 place count 756 transition count 1088
Iterating global reduction 2 with 6 rules applied. Total rules applied 352 place count 756 transition count 1088
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 756 transition count 1087
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 355 place count 754 transition count 1082
Iterating global reduction 3 with 2 rules applied. Total rules applied 357 place count 754 transition count 1082
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 707 place count 579 transition count 907
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 709 place count 577 transition count 903
Iterating global reduction 3 with 2 rules applied. Total rules applied 711 place count 577 transition count 903
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 712 place count 576 transition count 901
Iterating global reduction 3 with 1 rules applied. Total rules applied 713 place count 576 transition count 901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 915 place count 475 transition count 930
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 991 place count 437 transition count 943
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 992 place count 436 transition count 942
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 993 place count 435 transition count 942
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 997 place count 433 transition count 940
Applied a total of 997 rules in 164 ms. Remains 433 /933 variables (removed 500) and now considering 940/1410 (removed 470) transitions.
// Phase 1: matrix 940 rows 433 cols
[2024-05-26 07:23:23] [INFO ] Computed 65 invariants in 7 ms
[2024-05-26 07:23:23] [INFO ] Implicit Places using invariants in 233 ms returned [11, 47, 95, 134, 194, 275, 325, 364]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 234 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 425/933 places, 940/1410 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 403 transition count 918
Applied a total of 44 rules in 12 ms. Remains 403 /425 variables (removed 22) and now considering 918/940 (removed 22) transitions.
// Phase 1: matrix 918 rows 403 cols
[2024-05-26 07:23:23] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 07:23:24] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-26 07:23:24] [INFO ] Invariant cache hit.
[2024-05-26 07:23:24] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-26 07:23:24] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 403/933 places, 918/1410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1238 ms. Remains : 403/933 places, 918/1410 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-07
Product exploration explored 100000 steps with 40291 reset in 825 ms.
Product exploration explored 100000 steps with 40191 reset in 833 ms.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 679 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 7 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (F p1)]
Knowledge based reduction with 23 factoid took 674 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
[2024-05-26 07:23:27] [INFO ] Invariant cache hit.
[2024-05-26 07:23:28] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2024-05-26 07:23:28] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2024-05-26 07:23:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:23:29] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2024-05-26 07:23:29] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2024-05-26 07:23:29] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-26 07:23:29] [INFO ] [Nat]Added 63 Read/Feed constraints in 94 ms returned sat
[2024-05-26 07:23:29] [INFO ] Computed and/alt/rep : 602/4158/602 causal constraints (skipped 310 transitions) in 49 ms.
[2024-05-26 07:23:31] [INFO ] Added : 187 causal constraints over 38 iterations in 2247 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 403 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 918/918 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 403 transition count 894
Applied a total of 24 rules in 16 ms. Remains 403 /403 variables (removed 0) and now considering 894/918 (removed 24) transitions.
// Phase 1: matrix 894 rows 403 cols
[2024-05-26 07:23:31] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 07:23:32] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-26 07:23:32] [INFO ] Invariant cache hit.
[2024-05-26 07:23:32] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 07:23:32] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-05-26 07:23:32] [INFO ] Redundant transitions in 11 ms returned []
Running 888 sub problems to find dead transitions.
[2024-05-26 07:23:32] [INFO ] Invariant cache hit.
[2024-05-26 07:23:32] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (OVERLAPS) 2/403 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-26 07:23:45] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-26 07:23:46] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-26 07:23:46] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-26 07:23:46] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-26 07:23:46] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-26 07:23:46] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-26 07:23:46] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-26 07:23:57] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/1297 variables, and 65 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/403 constraints, ReadFeed: 0/51 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (OVERLAPS) 2/403 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 5 (OVERLAPS) 894/1297 variables, 403/468 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1297 variables, 51/519 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1297 variables, 888/1407 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1407 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 403/403 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 8/8 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Starting structural reductions in SI_LTL mode, iteration 1 : 403/403 places, 894/918 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61271 ms. Remains : 403/403 places, 894/918 transitions.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 179 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 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
[2024-05-26 07:24:33] [INFO ] Invariant cache hit.
[2024-05-26 07:24:34] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2024-05-26 07:24:34] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2024-05-26 07:24:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:24:35] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-05-26 07:24:35] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2024-05-26 07:24:35] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 07:24:35] [INFO ] [Nat]Added 51 Read/Feed constraints in 120 ms returned sat
[2024-05-26 07:24:35] [INFO ] Computed and/alt/rep : 590/4099/590 causal constraints (skipped 298 transitions) in 49 ms.
[2024-05-26 07:24:37] [INFO ] Added : 148 causal constraints over 30 iterations in 1886 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 40252 reset in 816 ms.
Product exploration explored 100000 steps with 40255 reset in 811 ms.
Built C files in :
/tmp/ltsmin7887975959175568488
[2024-05-26 07:24:39] [INFO ] Computing symmetric may disable matrix : 894 transitions.
[2024-05-26 07:24:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:24:39] [INFO ] Computing symmetric may enable matrix : 894 transitions.
[2024-05-26 07:24:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:24:39] [INFO ] Computing Do-Not-Accords matrix : 894 transitions.
[2024-05-26 07:24:39] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:24:39] [INFO ] Built C files in 154ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7887975959175568488
Running compilation step : cd /tmp/ltsmin7887975959175568488;'/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 2856 ms.
Running link step : cd /tmp/ltsmin7887975959175568488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin7887975959175568488;'/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/stateBased15147107975642953915.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 894/894 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 893
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 400 transition count 895
Applied a total of 6 rules in 22 ms. Remains 400 /403 variables (removed 3) and now considering 895/894 (removed -1) transitions.
// Phase 1: matrix 895 rows 400 cols
[2024-05-26 07:24:54] [INFO ] Computed 57 invariants in 25 ms
[2024-05-26 07:24:54] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-26 07:24:54] [INFO ] Invariant cache hit.
[2024-05-26 07:24:54] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 07:24:55] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-26 07:24:55] [INFO ] Redundant transitions in 9 ms returned []
Running 885 sub problems to find dead transitions.
[2024-05-26 07:24:55] [INFO ] Invariant cache hit.
[2024-05-26 07:24:55] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (OVERLAPS) 2/400 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 885 unsolved
[2024-05-26 07:25:08] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 5 (OVERLAPS) 895/1295 variables, 400/458 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 51/509 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 509 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 400/400 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 885/885 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 885 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (OVERLAPS) 2/400 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 5 (OVERLAPS) 895/1295 variables, 400/458 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 51/509 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1295 variables, 885/1394 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1394 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 400/400 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 885/885 constraints, Known Traps: 1/1 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 885 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 400/403 places, 895/894 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61248 ms. Remains : 400/403 places, 895/894 transitions.
Built C files in :
/tmp/ltsmin12892490697495324857
[2024-05-26 07:25:55] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-26 07:25:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:25:55] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-26 07:25:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:25:55] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-26 07:25:55] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:25:55] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12892490697495324857
Running compilation step : cd /tmp/ltsmin12892490697495324857;'/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 2799 ms.
Running link step : cd /tmp/ltsmin12892490697495324857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin12892490697495324857;'/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/stateBased1339245198744352069.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 07:26:10] [INFO ] Flatten gal took : 25 ms
[2024-05-26 07:26:10] [INFO ] Flatten gal took : 25 ms
[2024-05-26 07:26:10] [INFO ] Time to serialize gal into /tmp/LTL13911326730718971331.gal : 4 ms
[2024-05-26 07:26:10] [INFO ] Time to serialize properties into /tmp/LTL12944302063151486296.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/LTL13911326730718971331.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10855228542702614838.hoa' '-atoms' '/tmp/LTL12944302063151486296.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12944302063151486296.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10855228542702614838.hoa
Detected timeout of ITS tools.
[2024-05-26 07:26:25] [INFO ] Flatten gal took : 23 ms
[2024-05-26 07:26:25] [INFO ] Flatten gal took : 23 ms
[2024-05-26 07:26:25] [INFO ] Time to serialize gal into /tmp/LTL12470949189194289622.gal : 4 ms
[2024-05-26 07:26:25] [INFO ] Time to serialize properties into /tmp/LTL1017318271624732457.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/LTL12470949189194289622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1017318271624732457.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 : !((("(p842==1)")U((F("(p1437==1)"))||(("((p181==1)&&(p324==1))")&&(X(G("((p181==1)&&(p324==1))")))))))
Formula 0 simplified : !"(p842==1)" R (G!"(p1437==1)" & F!"((p181==1)&&(p324==1))")
Detected timeout of ITS tools.
[2024-05-26 07:26:40] [INFO ] Flatten gal took : 36 ms
[2024-05-26 07:26:40] [INFO ] Applying decomposition
[2024-05-26 07:26:40] [INFO ] Flatten gal took : 24 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/graph16117062326709842710.txt' '-o' '/tmp/graph16117062326709842710.bin' '-w' '/tmp/graph16117062326709842710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16117062326709842710.bin' '-l' '-1' '-v' '-w' '/tmp/graph16117062326709842710.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:26:40] [INFO ] Decomposing Gal with order
[2024-05-26 07:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:26:41] [INFO ] Removed a total of 533 redundant transitions.
[2024-05-26 07:26:41] [INFO ] Flatten gal took : 94 ms
[2024-05-26 07:26:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 534 labels/synchronizations in 44 ms.
[2024-05-26 07:26:41] [INFO ] Time to serialize gal into /tmp/LTL9603710254702658607.gal : 22 ms
[2024-05-26 07:26:41] [INFO ] Time to serialize properties into /tmp/LTL806982565112620797.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/LTL9603710254702658607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL806982565112620797.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...253
Read 1 LTL properties
Checking formula 0 : !((("(i4.u16.p842==1)")U((F("(i7.u30.p1437==1)"))||(("((i1.i1.u6.p181==1)&&(i1.i1.u5.p324==1))")&&(X(G("((i1.i1.u6.p181==1)&&(i1.i1.u5...173
Formula 0 simplified : !"(i4.u16.p842==1)" R (G!"(i7.u30.p1437==1)" & F!"((i1.i1.u6.p181==1)&&(i1.i1.u5.p324==1))")
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-6B-LTLFireability-07 finished in 213144 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))||(F(!p0)&&G(p1)&&X(!p2)))))'
Found a Shortening insensitive property : NoC3x3-PT-6B-LTLFireability-10
Stuttering acceptance computed with spot in 140 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 78 place count 893 transition count 1276
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 266 place count 799 transition count 1276
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 299 place count 766 transition count 1113
Iterating global reduction 2 with 33 rules applied. Total rules applied 332 place count 766 transition count 1113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 332 place count 766 transition count 1112
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 765 transition count 1112
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 340 place count 759 transition count 1095
Iterating global reduction 2 with 6 rules applied. Total rules applied 346 place count 759 transition count 1095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 759 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 348 place count 758 transition count 1092
Iterating global reduction 3 with 1 rules applied. Total rules applied 349 place count 758 transition count 1092
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 703 place count 581 transition count 915
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 705 place count 579 transition count 911
Iterating global reduction 3 with 2 rules applied. Total rules applied 707 place count 579 transition count 911
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 708 place count 578 transition count 909
Iterating global reduction 3 with 1 rules applied. Total rules applied 709 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 911 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 987 place count 439 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 988 place count 438 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 989 place count 437 transition count 958
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 993 place count 435 transition count 956
Applied a total of 993 rules in 142 ms. Remains 435 /933 variables (removed 498) and now considering 956/1410 (removed 454) transitions.
// Phase 1: matrix 956 rows 435 cols
[2024-05-26 07:26:56] [INFO ] Computed 65 invariants in 2 ms
[2024-05-26 07:26:56] [INFO ] Implicit Places using invariants in 249 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 250 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 427/933 places, 956/1410 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 405 transition count 934
Applied a total of 44 rules in 18 ms. Remains 405 /427 variables (removed 22) and now considering 934/956 (removed 22) transitions.
// Phase 1: matrix 934 rows 405 cols
[2024-05-26 07:26:56] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 07:26:57] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-26 07:26:57] [INFO ] Invariant cache hit.
[2024-05-26 07:26:57] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-26 07:26:57] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 405/933 places, 934/1410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1327 ms. Remains : 405/933 places, 934/1410 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10
Product exploration explored 100000 steps with 712 reset in 381 ms.
Product exploration explored 100000 steps with 704 reset in 405 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 218 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
RANDOM walk for 40000 steps (267 resets) in 291 ms. (136 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (14 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
[2024-05-26 07:26:59] [INFO ] Invariant cache hit.
[2024-05-26 07:26:59] [INFO ] State equation strengthened by 65 read => feed constraints.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/64 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 326/390 variables, 48/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 921/1311 variables, 390/444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1311 variables, 64/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1311 variables, 0/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/1335 variables, 11/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1335 variables, 1/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1335 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/1339 variables, 3/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1339 variables, 4/527 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1339 variables, 0/527 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1339 variables, 0/527 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1339/1339 variables, and 527 constraints, problems are : Problem set: 1 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 405/405 constraints, ReadFeed: 65/65 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/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 332/380 variables, 49/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 906/1286 variables, 380/433 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1286 variables, 64/497 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1286 variables, 0/497 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 45/1331 variables, 17/514 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1331 variables, 1/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1331 variables, 1/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1331 variables, 0/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/1339 variables, 4/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1339 variables, 8/528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1339 variables, 0/528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1339 variables, 0/528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1339/1339 variables, and 528 constraints, problems are : Problem set: 1 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 405/405 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 752ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 934/934 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 404 transition count 933
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 403 transition count 933
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 30 place count 403 transition count 907
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 54 place count 403 transition count 883
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 90 place count 379 transition count 871
Applied a total of 90 rules in 31 ms. Remains 379 /405 variables (removed 26) and now considering 871/934 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 379/405 places, 871/934 transitions.
RANDOM walk for 40000 steps (294 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (14 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 376123 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 376123 steps, saw 108109 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
// Phase 1: matrix 871 rows 379 cols
[2024-05-26 07:27:03] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 07:27:03] [INFO ] State equation strengthened by 52 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) 37/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/357 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 847/1204 variables, 357/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 51/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/1243 variables, 15/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1243 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1243 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/1250 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1250 variables, 7/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1250 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1250 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1250/1250 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 379/379 constraints, ReadFeed: 52/52 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/357 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 847/1204 variables, 357/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 51/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/1243 variables, 15/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1243 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1243 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1243 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/1250 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1250 variables, 7/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1250 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1250 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1250/1250 variables, and 489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 379/379 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 39 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (G (OR (NOT p2) (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 379 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 106 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 934/934 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 405 transition count 908
Applied a total of 26 rules in 17 ms. Remains 405 /405 variables (removed 0) and now considering 908/934 (removed 26) transitions.
// Phase 1: matrix 908 rows 405 cols
[2024-05-26 07:27:04] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 07:27:04] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-26 07:27:04] [INFO ] Invariant cache hit.
[2024-05-26 07:27:04] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 07:27:05] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2024-05-26 07:27:05] [INFO ] Redundant transitions in 6 ms returned []
Running 898 sub problems to find dead transitions.
[2024-05-26 07:27:05] [INFO ] Invariant cache hit.
[2024-05-26 07:27:05] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 07:27:18] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-26 07:27:18] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-26 07:27:18] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-26 07:27:22] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 07:27:33] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 898 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/1313 variables, and 62 constraints, problems are : Problem set: 0 solved, 898 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/405 constraints, ReadFeed: 0/52 constraints, PredecessorRefiner: 898/898 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 3 (OVERLAPS) 2/405 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 6 (OVERLAPS) 908/1313 variables, 405/467 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1313 variables, 52/519 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1313 variables, 898/1417 constraints. Problems are: Problem set: 0 solved, 898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 1417 constraints, problems are : Problem set: 0 solved, 898 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 405/405 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 898/898 constraints, Known Traps: 5/5 constraints]
After SMT, in 60425ms problems are : Problem set: 0 solved, 898 unsolved
Search for dead transitions found 0 dead transitions in 60432ms
Starting structural reductions in SI_LTL mode, iteration 1 : 405/405 places, 908/934 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61269 ms. Remains : 405/405 places, 908/934 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 10943 steps (70 resets) in 78 ms. (138 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 140 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 139 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 104 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 688 reset in 381 ms.
Stack based approach found an accepted trace after 3418 steps with 23 reset with depth 73 and stack size 73 in 14 ms.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 70541 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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(F(p0))||G(p1))))))'
Found a Lengthening insensitive property : NoC3x3-PT-6B-LTLFireability-12
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 78 place count 893 transition count 1275
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 268 place count 798 transition count 1275
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 301 place count 765 transition count 1108
Iterating global reduction 2 with 33 rules applied. Total rules applied 334 place count 765 transition count 1108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 334 place count 765 transition count 1107
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 336 place count 764 transition count 1107
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 759 transition count 1092
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 759 transition count 1092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 759 transition count 1091
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 349 place count 757 transition count 1086
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 757 transition count 1086
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 705 place count 580 transition count 909
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 707 place count 578 transition count 905
Iterating global reduction 3 with 2 rules applied. Total rules applied 709 place count 578 transition count 905
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 710 place count 577 transition count 903
Iterating global reduction 3 with 1 rules applied. Total rules applied 711 place count 577 transition count 903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 913 place count 476 transition count 933
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 991 place count 437 transition count 945
Applied a total of 991 rules in 142 ms. Remains 437 /933 variables (removed 496) and now considering 945/1410 (removed 465) transitions.
// Phase 1: matrix 945 rows 437 cols
[2024-05-26 07:28:07] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 07:28:07] [INFO ] Implicit Places using invariants in 234 ms returned [11, 46, 96, 136, 197, 277, 327, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 262 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 428/933 places, 945/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 404 transition count 921
Applied a total of 48 rules in 12 ms. Remains 404 /428 variables (removed 24) and now considering 921/945 (removed 24) transitions.
// Phase 1: matrix 921 rows 404 cols
[2024-05-26 07:28:07] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 07:28:07] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-26 07:28:07] [INFO ] Invariant cache hit.
[2024-05-26 07:28:07] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-26 07:28:08] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 404/933 places, 921/1410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1295 ms. Remains : 404/933 places, 921/1410 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12
Product exploration explored 100000 steps with 682 reset in 363 ms.
Stack based approach found an accepted trace after 82337 steps with 568 reset with depth 221 and stack size 221 in 331 ms.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 2313 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-26 07:28:09] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17877865625276672882
[2024-05-26 07:28:09] [INFO ] Computing symmetric may disable matrix : 1410 transitions.
[2024-05-26 07:28:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:28:09] [INFO ] Computing symmetric may enable matrix : 1410 transitions.
[2024-05-26 07:28:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:28:09] [INFO ] Applying decomposition
[2024-05-26 07:28:09] [INFO ] Flatten gal took : 44 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/graph11191222874130817622.txt' '-o' '/tmp/graph11191222874130817622.bin' '-w' '/tmp/graph11191222874130817622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11191222874130817622.bin' '-l' '-1' '-v' '-w' '/tmp/graph11191222874130817622.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:28:09] [INFO ] Decomposing Gal with order
[2024-05-26 07:28:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:28:09] [INFO ] Computing Do-Not-Accords matrix : 1410 transitions.
[2024-05-26 07:28:09] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:28:09] [INFO ] Built C files in 341ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17877865625276672882
Running compilation step : cd /tmp/ltsmin17877865625276672882;'/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'
[2024-05-26 07:28:09] [INFO ] Removed a total of 1398 redundant transitions.
[2024-05-26 07:28:09] [INFO ] Flatten gal took : 83 ms
[2024-05-26 07:28:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 16 ms.
[2024-05-26 07:28:09] [INFO ] Time to serialize gal into /tmp/LTLFireability2502969521623061119.gal : 9 ms
[2024-05-26 07:28:09] [INFO ] Time to serialize properties into /tmp/LTLFireability9907505964605582926.ltl : 42 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/LTLFireability2502969521623061119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9907505964605582926.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...276
Read 4 LTL properties
Checking formula 0 : !((X(X(("((i7.u153.p616==1)&&(i5.u169.p700==1))")||(X((G("((i7.u153.p616==0)||(i5.u169.p700==0))"))&&(F("((i6.u158.p649==0)||(i7.u212....173
Formula 0 simplified : XX(!"((i7.u153.p616==1)&&(i5.u169.p700==1))" & X(F!"((i7.u153.p616==0)||(i5.u169.p700==0))" | G!"((i6.u158.p649==0)||(i7.u212.p962==...161
Compilation finished in 6363 ms.
Running link step : cd /tmp/ltsmin17877865625276672882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 104 ms.
Running LTSmin : cd /tmp/ltsmin17877865625276672882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true)||X(([]((LTLAPp1==true))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>180 s) on command cd /tmp/ltsmin17877865625276672882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true)||X(([]((LTLAPp1==true))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17877865625276672882;'/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' '<>(([]((LTLAPp3==true))||X(((LTLAPp4==true)&&[](<>((LTLAPp4==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>180 s) on command cd /tmp/ltsmin17877865625276672882;'/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' '<>(([]((LTLAPp3==true))||X(((LTLAPp4==true)&&[](<>((LTLAPp4==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17877865625276672882;'/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' '((LTLAPp5==true) U (<>((LTLAPp6==true))||(X([]((LTLAPp8==true)))&&(LTLAPp7==true))))' '--buchi-type=spotba'
LTSmin run took 821 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17877865625276672882;'/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' '<>(([](<>(!(LTLAPp9==true)))||(<>(!(LTLAPp9==true))&&[]((LTLAPp10==true))&&X(!(LTLAPp11==true)))))' '--buchi-type=spotba'
LTSmin run took 3825 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin17877865625276672882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true)||X(([]((LTLAPp1==true))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-26 07:50:53] [INFO ] Applying decomposition
[2024-05-26 07:50:53] [INFO ] Flatten gal took : 98 ms
[2024-05-26 07:50:53] [INFO ] Decomposing Gal with order
[2024-05-26 07:50:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:50:53] [INFO ] Removed a total of 936 redundant transitions.
[2024-05-26 07:50:53] [INFO ] Flatten gal took : 172 ms
[2024-05-26 07:50:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2129 labels/synchronizations in 171 ms.
[2024-05-26 07:50:53] [INFO ] Time to serialize gal into /tmp/LTLFireability4083311638346923196.gal : 19 ms
[2024-05-26 07:50:53] [INFO ] Time to serialize properties into /tmp/LTLFireability15999777426348670309.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/LTLFireability4083311638346923196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15999777426348670309.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 2 LTL properties
Checking formula 0 : !((X(X(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u94.p616==1)&&(...747
Formula 0 simplified : XX(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u94.p616==1)&&(i0...735
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.256: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.256: LTL layer: formula: X(X(((LTLAPp0==true)||X(([]((LTLAPp1==true))&&<>((LTLAPp2==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.256: "X(X(((LTLAPp0==true)||X(([]((LTLAPp1==true))&&<>((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.256: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.281: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.297: buchi has 6 states
pins2lts-mc-linux64( 4/ 8), 0.302: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.308: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.309: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.310: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.310: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.314: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.355: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.649: DFS-FIFO for weak LTL, using special progress label 1425
pins2lts-mc-linux64( 0/ 8), 0.649: There are 1426 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.649: State length is 934, there are 1419 groups
pins2lts-mc-linux64( 0/ 8), 0.649: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.649: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.649: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.649: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.723: ~2 levels ~960 states ~2920 transitions
pins2lts-mc-linux64( 2/ 8), 0.800: ~2 levels ~1920 states ~6936 transitions
pins2lts-mc-linux64( 2/ 8), 0.958: ~2 levels ~3840 states ~15656 transitions
pins2lts-mc-linux64( 1/ 8), 1.225: ~1 levels ~7680 states ~29352 transitions
pins2lts-mc-linux64( 2/ 8), 1.757: ~2 levels ~15360 states ~67000 transitions
pins2lts-mc-linux64( 1/ 8), 2.844: ~1 levels ~30720 states ~124736 transitions
pins2lts-mc-linux64( 2/ 8), 4.877: ~2 levels ~61440 states ~269720 transitions
pins2lts-mc-linux64( 1/ 8), 13.434: ~1 levels ~122880 states ~645800 transitions
pins2lts-mc-linux64( 2/ 8), 23.154: ~2 levels ~245760 states ~1275648 transitions
pins2lts-mc-linux64( 2/ 8), 39.240: ~2 levels ~491520 states ~2757272 transitions
pins2lts-mc-linux64( 2/ 8), 69.436: ~2 levels ~983040 states ~5772792 transitions
pins2lts-mc-linux64( 2/ 8), 145.419: ~2 levels ~1966080 states ~12159568 transitions
pins2lts-mc-linux64( 2/ 8), 306.361: ~2 levels ~3932160 states ~25967064 transitions
pins2lts-mc-linux64( 1/ 8), 565.092: ~1 levels ~7864320 states ~53168880 transitions
pins2lts-mc-linux64( 1/ 8), 1099.245: ~1 levels ~15728640 states ~111767288 transitions
pins2lts-mc-linux64( 4/ 8), 1295.436: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1295.499:
pins2lts-mc-linux64( 0/ 8), 1295.499: mean standard work distribution: 4.3% (states) 6.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1295.501:
pins2lts-mc-linux64( 0/ 8), 1295.501: Explored 17915383 states 144347614 transitions, fanout: 8.057
pins2lts-mc-linux64( 0/ 8), 1295.504: Total exploration time 1294.830 sec (1294.780 sec minimum, 1294.794 sec on average)
pins2lts-mc-linux64( 0/ 8), 1295.504: States per second: 13836, Transitions per second: 111480
pins2lts-mc-linux64( 0/ 8), 1295.504:
pins2lts-mc-linux64( 0/ 8), 1295.504: Progress states detected: 31871728
pins2lts-mc-linux64( 0/ 8), 1295.504: Redundant explorations: -43.7891
pins2lts-mc-linux64( 0/ 8), 1295.504:
pins2lts-mc-linux64( 0/ 8), 1295.504: Queue width: 8B, total height: 24679561, memory: 188.29MB
pins2lts-mc-linux64( 0/ 8), 1295.504: Tree memory: 499.2MB, 16.4 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1295.504: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1295.504: Stored 1439 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1295.504: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1295.504: Est. total memory use: 687.5MB (~1212.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17877865625276672882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true)||X(([]((LTLAPp1==true))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17877865625276672882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true)||X(([]((LTLAPp1==true))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-26 08:02:29] [INFO ] Flatten gal took : 37 ms
[2024-05-26 08:02:29] [INFO ] Input system was already deterministic with 1410 transitions.
[2024-05-26 08:02:29] [INFO ] Transformed 933 places.
[2024-05-26 08:02:29] [INFO ] Transformed 1410 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-26 08:02:29] [INFO ] Time to serialize gal into /tmp/LTLFireability4791637777427187128.gal : 6 ms
[2024-05-26 08:02:29] [INFO ] Time to serialize properties into /tmp/LTLFireability16055323864655176783.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/LTLFireability4791637777427187128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16055323864655176783.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(("((p616==1)&&(p700==1))")||(X((G("((p616==0)||(p700==0))"))&&(F("((p649==0)||(p962==0))"))))))))
Formula 0 simplified : XX(!"((p616==1)&&(p700==1))" & X(F!"((p616==0)||(p700==0))" | G!"((p649==0)||(p962==0))"))
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="NoC3x3-PT-6B"
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 NoC3x3-PT-6B, 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 r246-tall-171654352100644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6B.tgz
mv NoC3x3-PT-6B 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 '
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 ;