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 |
| 15180.044 | 3600000.00 | 13640068.00 | 1463.70 | TFFFFF?F??FFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998500204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r150-smll-165276998500204
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.5K Apr 29 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 552K May 10 09:34 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 1653022476871
Running Version 202205111006
[2022-05-20 04:54:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 04:54:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 04:54:39] [INFO ] Load time of PNML (sax parser for PT used): 518 ms
[2022-05-20 04:54:39] [INFO ] Transformed 1544 places.
[2022-05-20 04:54:40] [INFO ] Transformed 2229 transitions.
[2022-05-20 04:54:40] [INFO ] Found NUPN structural information;
[2022-05-20 04:54:40] [INFO ] Parsed PT model containing 1544 places and 2229 transitions in 811 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NoC3x3-PT-6B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 364 places :
Symmetric choice reduction at 0 with 364 rule applications. Total rules 364 place count 1180 transition count 1865
Iterating global reduction 0 with 364 rules applied. Total rules applied 728 place count 1180 transition count 1865
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 834 place count 1074 transition count 1665
Iterating global reduction 0 with 106 rules applied. Total rules applied 940 place count 1074 transition count 1665
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 1031 place count 983 transition count 1511
Iterating global reduction 0 with 91 rules applied. Total rules applied 1122 place count 983 transition count 1511
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 1145 place count 960 transition count 1465
Iterating global reduction 0 with 23 rules applied. Total rules applied 1168 place count 960 transition count 1465
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 1183 place count 945 transition count 1427
Iterating global reduction 0 with 15 rules applied. Total rules applied 1198 place count 945 transition count 1427
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 1213 place count 930 transition count 1412
Iterating global reduction 0 with 15 rules applied. Total rules applied 1228 place count 930 transition count 1412
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1230 place count 928 transition count 1408
Iterating global reduction 0 with 2 rules applied. Total rules applied 1232 place count 928 transition count 1408
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1234 place count 926 transition count 1404
Iterating global reduction 0 with 2 rules applied. Total rules applied 1236 place count 926 transition count 1404
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1238 place count 924 transition count 1402
Iterating global reduction 0 with 2 rules applied. Total rules applied 1240 place count 924 transition count 1402
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 1245 place count 924 transition count 1397
Applied a total of 1245 rules in 826 ms. Remains 924 /1544 variables (removed 620) and now considering 1397/2229 (removed 832) transitions.
// Phase 1: matrix 1397 rows 924 cols
[2022-05-20 04:54:41] [INFO ] Computed 66 place invariants in 42 ms
[2022-05-20 04:54:42] [INFO ] Implicit Places using invariants in 1176 ms returned []
// Phase 1: matrix 1397 rows 924 cols
[2022-05-20 04:54:42] [INFO ] Computed 66 place invariants in 11 ms
[2022-05-20 04:54:44] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 3184 ms to find 0 implicit places.
// Phase 1: matrix 1397 rows 924 cols
[2022-05-20 04:54:44] [INFO ] Computed 66 place invariants in 33 ms
[2022-05-20 04:54:46] [INFO ] Dead Transitions using invariants and state equation in 1717 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 924/1544 places, 1397/2229 transitions.
Finished structural reductions, in 1 iterations. Remains : 924/1544 places, 1397/2229 transitions.
Support contains 31 out of 924 places after structural reductions.
[2022-05-20 04:54:46] [INFO ] Flatten gal took : 292 ms
[2022-05-20 04:54:46] [INFO ] Flatten gal took : 187 ms
[2022-05-20 04:54:47] [INFO ] Input system was already deterministic with 1397 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 987 ms. (steps per millisecond=10 ) properties (out of 24) seen :17
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1397 rows 924 cols
[2022-05-20 04:54:48] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:54:49] [INFO ] [Real]Absence check using 66 positive place invariants in 72 ms returned sat
[2022-05-20 04:54:49] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 04:54:50] [INFO ] [Nat]Absence check using 66 positive place invariants in 254 ms returned sat
[2022-05-20 04:54:51] [INFO ] After 1421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 04:54:52] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 7 ms to minimize.
[2022-05-20 04:54:52] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 2 ms to minimize.
[2022-05-20 04:54:52] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2022-05-20 04:54:52] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2022-05-20 04:54:52] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 1 ms to minimize.
[2022-05-20 04:54:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1122 ms
[2022-05-20 04:54:53] [INFO ] Deduced a trap composed of 73 places in 258 ms of which 1 ms to minimize.
[2022-05-20 04:54:53] [INFO ] Deduced a trap composed of 98 places in 206 ms of which 1 ms to minimize.
[2022-05-20 04:54:54] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 1 ms to minimize.
[2022-05-20 04:54:54] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 0 ms to minimize.
[2022-05-20 04:54:54] [INFO ] Deduced a trap composed of 48 places in 280 ms of which 1 ms to minimize.
[2022-05-20 04:54:55] [INFO ] Deduced a trap composed of 61 places in 407 ms of which 1 ms to minimize.
[2022-05-20 04:54:55] [INFO ] Deduced a trap composed of 74 places in 325 ms of which 2 ms to minimize.
[2022-05-20 04:54:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2482 ms
[2022-05-20 04:54:56] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 1 ms to minimize.
[2022-05-20 04:54:56] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 1 ms to minimize.
[2022-05-20 04:54:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 706 ms
[2022-05-20 04:54:57] [INFO ] Deduced a trap composed of 22 places in 325 ms of which 1 ms to minimize.
[2022-05-20 04:54:57] [INFO ] Deduced a trap composed of 105 places in 304 ms of which 1 ms to minimize.
[2022-05-20 04:54:57] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 1 ms to minimize.
[2022-05-20 04:54:57] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 1 ms to minimize.
[2022-05-20 04:54:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1174 ms
[2022-05-20 04:54:57] [INFO ] After 7519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 445 ms.
[2022-05-20 04:54:58] [INFO ] After 8997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 88 ms.
Support contains 7 out of 924 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Drop transitions 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 924 transition count 1370
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 897 transition count 1370
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 54 place count 897 transition count 1269
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 256 place count 796 transition count 1269
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 286 place count 766 transition count 1105
Iterating global reduction 2 with 30 rules applied. Total rules applied 316 place count 766 transition count 1105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 318 place count 764 transition count 1101
Iterating global reduction 2 with 2 rules applied. Total rules applied 320 place count 764 transition count 1101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 322 place count 762 transition count 1097
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 762 transition count 1097
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 325 place count 762 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 326 place count 761 transition count 1094
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 761 transition count 1094
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 681 place count 584 transition count 917
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 883 place count 483 transition count 947
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -25
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 961 place count 444 transition count 972
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 983 place count 444 transition count 950
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 1006 place count 444 transition count 927
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 1043 place count 421 transition count 913
Applied a total of 1043 rules in 641 ms. Remains 421 /924 variables (removed 503) and now considering 913/1397 (removed 484) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/924 places, 913/1397 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 913 rows 421 cols
[2022-05-20 04:54:59] [INFO ] Computed 66 place invariants in 8 ms
[2022-05-20 04:54:59] [INFO ] [Real]Absence check using 66 positive place invariants in 21 ms returned sat
[2022-05-20 04:55:00] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 04:55:00] [INFO ] [Nat]Absence check using 66 positive place invariants in 28 ms returned sat
[2022-05-20 04:55:00] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 04:55:00] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:55:00] [INFO ] After 130ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 04:55:01] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-05-20 04:55:01] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 913/913 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 420 transition count 912
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 419 transition count 911
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 418 transition count 909
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 418 transition count 909
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 417 transition count 905
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 417 transition count 905
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 415 transition count 906
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 415 transition count 904
Applied a total of 14 rules in 71 ms. Remains 415 /421 variables (removed 6) and now considering 904/913 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/421 places, 904/913 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 904 rows 415 cols
[2022-05-20 04:55:01] [INFO ] Computed 66 place invariants in 13 ms
[2022-05-20 04:55:01] [INFO ] [Real]Absence check using 66 positive place invariants in 26 ms returned sat
[2022-05-20 04:55:02] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:55:02] [INFO ] [Nat]Absence check using 66 positive place invariants in 21 ms returned sat
[2022-05-20 04:55:02] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:55:02] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:55:02] [INFO ] After 51ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:55:02] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2022-05-20 04:55:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-20 04:55:02] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-20 04:55:02] [INFO ] After 727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 904/904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 414 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 414 transition count 902
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 4 place count 413 transition count 901
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 8 place count 411 transition count 907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 410 transition count 903
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 410 transition count 903
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 410 transition count 902
Applied a total of 11 rules in 56 ms. Remains 410 /415 variables (removed 5) and now considering 902/904 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/415 places, 902/904 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 240804 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 240804 steps, saw 70511 distinct states, run finished after 3003 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 902 rows 410 cols
[2022-05-20 04:55:05] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-20 04:55:06] [INFO ] [Real]Absence check using 66 positive place invariants in 26 ms returned sat
[2022-05-20 04:55:06] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:55:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 25 ms returned sat
[2022-05-20 04:55:07] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:55:07] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:55:07] [INFO ] After 69ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:55:07] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-20 04:55:07] [INFO ] After 759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 902/902 transitions.
Applied a total of 0 rules in 18 ms. Remains 410 /410 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 902/902 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 902/902 transitions.
Applied a total of 0 rules in 17 ms. Remains 410 /410 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 410 cols
[2022-05-20 04:55:07] [INFO ] Computed 66 place invariants in 8 ms
[2022-05-20 04:55:07] [INFO ] Implicit Places using invariants in 583 ms returned [10, 45, 89, 128, 184, 258, 304, 343, 389]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 587 ms to find 9 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 401/410 places, 902/902 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 377 transition count 878
Applied a total of 48 rules in 24 ms. Remains 377 /401 variables (removed 24) and now considering 878/902 (removed 24) transitions.
// Phase 1: matrix 878 rows 377 cols
[2022-05-20 04:55:07] [INFO ] Computed 57 place invariants in 8 ms
[2022-05-20 04:55:08] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 878 rows 377 cols
[2022-05-20 04:55:08] [INFO ] Computed 57 place invariants in 8 ms
[2022-05-20 04:55:08] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:55:09] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 377/410 places, 878/902 transitions.
Finished structural reductions, in 2 iterations. Remains : 377/410 places, 878/902 transitions.
Finished random walk after 2586 steps, including 19 resets, run visited all 1 properties in 14 ms. (steps per millisecond=184 )
FORMULA NoC3x3-PT-6B-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0)) U p1)))'
Support contains 3 out of 924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 914 transition count 1379
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 914 transition count 1379
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 909 transition count 1370
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 909 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 905 transition count 1362
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 905 transition count 1362
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 901 transition count 1356
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 901 transition count 1356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 901 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 900 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 900 transition count 1351
Applied a total of 52 rules in 141 ms. Remains 900 /924 variables (removed 24) and now considering 1351/1397 (removed 46) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2022-05-20 04:55:09] [INFO ] Computed 66 place invariants in 8 ms
[2022-05-20 04:55:10] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 1351 rows 900 cols
[2022-05-20 04:55:10] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:55:11] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
// Phase 1: matrix 1351 rows 900 cols
[2022-05-20 04:55:11] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:55:13] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/924 places, 1351/1397 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/924 places, 1351/1397 transitions.
Stuttering acceptance computed with spot in 513 ms :[(NOT p0), (NOT p1), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s749 1) (EQ s789 1)), p1:(EQ s692 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-01 finished in 4313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(X(p1))))'
Support contains 3 out of 924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 915 transition count 1381
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 915 transition count 1381
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 911 transition count 1374
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 911 transition count 1374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 908 transition count 1368
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 908 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 905 transition count 1363
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 905 transition count 1363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 905 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 904 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 904 transition count 1361
Applied a total of 41 rules in 134 ms. Remains 904 /924 variables (removed 20) and now considering 1361/1397 (removed 36) transitions.
// Phase 1: matrix 1361 rows 904 cols
[2022-05-20 04:55:14] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-20 04:55:14] [INFO ] Implicit Places using invariants in 607 ms returned []
// Phase 1: matrix 1361 rows 904 cols
[2022-05-20 04:55:14] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:55:16] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
// Phase 1: matrix 1361 rows 904 cols
[2022-05-20 04:55:16] [INFO ] Computed 66 place invariants in 12 ms
[2022-05-20 04:55:17] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/924 places, 1361/1397 transitions.
Finished structural reductions, in 1 iterations. Remains : 904/924 places, 1361/1397 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (EQ s123 1) (EQ s168 1)), p0:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 270 steps with 0 reset in 10 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-02 finished in 3965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(G(p1))&&p0))&&X(((G(p2)||p3) U p2)))))'
Support contains 4 out of 924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 917 transition count 1383
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 917 transition count 1383
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 914 transition count 1378
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 914 transition count 1378
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 912 transition count 1374
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 912 transition count 1374
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 910 transition count 1371
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 910 transition count 1371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 910 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 909 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 909 transition count 1367
Applied a total of 33 rules in 140 ms. Remains 909 /924 variables (removed 15) and now considering 1367/1397 (removed 30) transitions.
// Phase 1: matrix 1367 rows 909 cols
[2022-05-20 04:55:18] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-20 04:55:18] [INFO ] Implicit Places using invariants in 757 ms returned []
// Phase 1: matrix 1367 rows 909 cols
[2022-05-20 04:55:18] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-20 04:55:21] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2973 ms to find 0 implicit places.
// Phase 1: matrix 1367 rows 909 cols
[2022-05-20 04:55:21] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-20 04:55:22] [INFO ] Dead Transitions using invariants and state equation in 1656 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 909/924 places, 1367/1397 transitions.
Finished structural reductions, in 1 iterations. Remains : 909/924 places, 1367/1397 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s587 1) (EQ s651 1)), p1:(EQ s366 1), p2:(AND (EQ s587 1) (EQ s651 1)), p3:(EQ s547 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 467 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-03 finished in 5069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U F(p0)) U (F(p0)&&(G(p1)||p0))))'
Support contains 4 out of 924 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 923 transition count 1367
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 894 transition count 1367
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 58 place count 894 transition count 1267
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 258 place count 794 transition count 1267
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 290 place count 762 transition count 1104
Iterating global reduction 2 with 32 rules applied. Total rules applied 322 place count 762 transition count 1104
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 758 transition count 1096
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 758 transition count 1096
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 334 place count 754 transition count 1088
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 754 transition count 1088
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 340 place count 754 transition count 1086
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 342 place count 752 transition count 1082
Iterating global reduction 3 with 2 rules applied. Total rules applied 344 place count 752 transition count 1082
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 0 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 692 place count 578 transition count 908
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 894 place count 477 transition count 938
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 974 place count 437 transition count 971
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 998 place count 437 transition count 947
Applied a total of 998 rules in 429 ms. Remains 437 /924 variables (removed 487) and now considering 947/1397 (removed 450) transitions.
// Phase 1: matrix 947 rows 437 cols
[2022-05-20 04:55:23] [INFO ] Computed 66 place invariants in 15 ms
[2022-05-20 04:55:23] [INFO ] Implicit Places using invariants in 542 ms returned [12, 47, 95, 134, 276, 326, 366, 415]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 544 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 429/924 places, 947/1397 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 409 transition count 927
Applied a total of 40 rules in 38 ms. Remains 409 /429 variables (removed 20) and now considering 927/947 (removed 20) transitions.
// Phase 1: matrix 927 rows 409 cols
[2022-05-20 04:55:24] [INFO ] Computed 58 place invariants in 17 ms
[2022-05-20 04:55:24] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 927 rows 409 cols
[2022-05-20 04:55:24] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-20 04:55:24] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:55:25] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 409/924 places, 927/1397 transitions.
Finished structural reductions, in 2 iterations. Remains : 409/924 places, 927/1397 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s203 1) (EQ s253 1)), p0:(AND (EQ s327 1) (EQ s363 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-04 finished in 2714 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(F(p0)))&&X(G(p0))))))'
Support contains 2 out of 924 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 923 transition count 1367
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 894 transition count 1367
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 58 place count 894 transition count 1266
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 260 place count 793 transition count 1266
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 292 place count 761 transition count 1098
Iterating global reduction 2 with 32 rules applied. Total rules applied 324 place count 761 transition count 1098
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 328 place count 757 transition count 1090
Iterating global reduction 2 with 4 rules applied. Total rules applied 332 place count 757 transition count 1090
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 336 place count 753 transition count 1082
Iterating global reduction 2 with 4 rules applied. Total rules applied 340 place count 753 transition count 1082
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 342 place count 753 transition count 1080
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 344 place count 751 transition count 1076
Iterating global reduction 3 with 2 rules applied. Total rules applied 346 place count 751 transition count 1076
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 702 place count 573 transition count 898
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 3 with 202 rules applied. Total rules applied 904 place count 472 transition count 928
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 980 place count 434 transition count 943
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1004 place count 434 transition count 919
Applied a total of 1004 rules in 263 ms. Remains 434 /924 variables (removed 490) and now considering 919/1397 (removed 478) transitions.
// Phase 1: matrix 919 rows 434 cols
[2022-05-20 04:55:25] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-20 04:55:26] [INFO ] Implicit Places using invariants in 480 ms returned [10, 45, 93, 132, 192, 274, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 483 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/924 places, 919/1397 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 401 transition count 895
Applied a total of 48 rules in 38 ms. Remains 401 /425 variables (removed 24) and now considering 895/919 (removed 24) transitions.
// Phase 1: matrix 895 rows 401 cols
[2022-05-20 04:55:26] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:55:26] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 895 rows 401 cols
[2022-05-20 04:55:26] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:55:27] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:55:28] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1538 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/924 places, 895/1397 transitions.
Finished structural reductions, in 2 iterations. Remains : 401/924 places, 895/1397 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s165 1) (EQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-05 finished in 2378 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 924 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 923 transition count 1367
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 894 transition count 1367
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 58 place count 894 transition count 1266
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 260 place count 793 transition count 1266
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 292 place count 761 transition count 1098
Iterating global reduction 2 with 32 rules applied. Total rules applied 324 place count 761 transition count 1098
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 327 place count 758 transition count 1092
Iterating global reduction 2 with 3 rules applied. Total rules applied 330 place count 758 transition count 1092
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 333 place count 755 transition count 1086
Iterating global reduction 2 with 3 rules applied. Total rules applied 336 place count 755 transition count 1086
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 338 place count 755 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 339 place count 754 transition count 1082
Iterating global reduction 3 with 1 rules applied. Total rules applied 340 place count 754 transition count 1082
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 696 place count 576 transition count 904
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 898 place count 475 transition count 934
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 978 place count 435 transition count 949
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1002 place count 435 transition count 925
Applied a total of 1002 rules in 203 ms. Remains 435 /924 variables (removed 489) and now considering 925/1397 (removed 472) transitions.
// Phase 1: matrix 925 rows 435 cols
[2022-05-20 04:55:28] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-20 04:55:28] [INFO ] Implicit Places using invariants in 389 ms returned [10, 45, 93, 132, 192, 272, 322, 361, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 392 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/924 places, 925/1397 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 901
Applied a total of 48 rules in 25 ms. Remains 402 /426 variables (removed 24) and now considering 901/925 (removed 24) transitions.
// Phase 1: matrix 901 rows 402 cols
[2022-05-20 04:55:28] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:55:29] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 901 rows 402 cols
[2022-05-20 04:55:29] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:55:29] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:55:30] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/924 places, 901/1397 transitions.
Finished structural reductions, in 2 iterations. Remains : 402/924 places, 901/1397 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s356 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 703 reset in 922 ms.
Product exploration explored 100000 steps with 703 reset in 705 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4146 steps, including 28 resets, run visited all 1 properties in 28 ms. (steps per millisecond=148 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 901/901 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 901/901 (removed 0) transitions.
// Phase 1: matrix 901 rows 402 cols
[2022-05-20 04:55:32] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:55:32] [INFO ] Implicit Places using invariants in 490 ms returned []
// Phase 1: matrix 901 rows 402 cols
[2022-05-20 04:55:33] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:55:33] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:55:34] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
[2022-05-20 04:55:34] [INFO ] Redundant transitions in 118 ms returned []
// Phase 1: matrix 901 rows 402 cols
[2022-05-20 04:55:34] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:55:35] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 901/901 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 148 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=74 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 715 reset in 746 ms.
Product exploration explored 100000 steps with 706 reset in 517 ms.
Built C files in :
/tmp/ltsmin4288173873951517019
[2022-05-20 04:55:37] [INFO ] Computing symmetric may disable matrix : 901 transitions.
[2022-05-20 04:55:37] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:55:37] [INFO ] Computing symmetric may enable matrix : 901 transitions.
[2022-05-20 04:55:37] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:55:37] [INFO ] Computing Do-Not-Accords matrix : 901 transitions.
[2022-05-20 04:55:37] [INFO ] Computation of Completed DNA matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:55:37] [INFO ] Built C files in 363ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4288173873951517019
Running compilation step : cd /tmp/ltsmin4288173873951517019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4288173873951517019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4288173873951517019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 901/901 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 901/901 (removed 0) transitions.
// Phase 1: matrix 901 rows 402 cols
[2022-05-20 04:55:40] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:55:41] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 901 rows 402 cols
[2022-05-20 04:55:41] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:55:41] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:55:42] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
[2022-05-20 04:55:42] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 901 rows 402 cols
[2022-05-20 04:55:42] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:55:43] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 901/901 transitions.
Built C files in :
/tmp/ltsmin4642778785354026622
[2022-05-20 04:55:43] [INFO ] Computing symmetric may disable matrix : 901 transitions.
[2022-05-20 04:55:43] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:55:43] [INFO ] Computing symmetric may enable matrix : 901 transitions.
[2022-05-20 04:55:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:55:43] [INFO ] Computing Do-Not-Accords matrix : 901 transitions.
[2022-05-20 04:55:43] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:55:43] [INFO ] Built C files in 234ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4642778785354026622
Running compilation step : cd /tmp/ltsmin4642778785354026622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4642778785354026622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4642778785354026622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 04:55:46] [INFO ] Flatten gal took : 151 ms
[2022-05-20 04:55:46] [INFO ] Flatten gal took : 133 ms
[2022-05-20 04:55:47] [INFO ] Time to serialize gal into /tmp/LTL16055990414339769683.gal : 44 ms
[2022-05-20 04:55:47] [INFO ] Time to serialize properties into /tmp/LTL11661454812331995007.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16055990414339769683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11661454812331995007.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1605599...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1394!=1)"))))
Formula 0 simplified : !GF"(p1394!=1)"
Detected timeout of ITS tools.
[2022-05-20 04:56:02] [INFO ] Flatten gal took : 65 ms
[2022-05-20 04:56:02] [INFO ] Applying decomposition
[2022-05-20 04:56:02] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12708046313325396034.txt' '-o' '/tmp/graph12708046313325396034.bin' '-w' '/tmp/graph12708046313325396034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12708046313325396034.bin' '-l' '-1' '-v' '-w' '/tmp/graph12708046313325396034.weights' '-q' '0' '-e' '0.001'
[2022-05-20 04:56:02] [INFO ] Decomposing Gal with order
[2022-05-20 04:56:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 04:56:02] [INFO ] Removed a total of 704 redundant transitions.
[2022-05-20 04:56:02] [INFO ] Flatten gal took : 333 ms
[2022-05-20 04:56:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 610 labels/synchronizations in 104 ms.
[2022-05-20 04:56:03] [INFO ] Time to serialize gal into /tmp/LTL6589791056971351908.gal : 12 ms
[2022-05-20 04:56:03] [INFO ] Time to serialize properties into /tmp/LTL3415905776728867477.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6589791056971351908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3415905776728867477.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6589791...245
Read 1 LTL properties
Checking formula 0 : !((G(F("(i7.u30.p1394!=1)"))))
Formula 0 simplified : !GF"(i7.u30.p1394!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2785998175598849836
[2022-05-20 04:56:18] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2785998175598849836
Running compilation step : cd /tmp/ltsmin2785998175598849836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2566 ms.
Running link step : cd /tmp/ltsmin2785998175598849836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin2785998175598849836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-06 finished in 65229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G((G(F(p0))||G(X(p1))))||p2)))))'
Support contains 4 out of 924 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 923 transition count 1367
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 894 transition count 1367
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 58 place count 894 transition count 1266
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 260 place count 793 transition count 1266
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 292 place count 761 transition count 1098
Iterating global reduction 2 with 32 rules applied. Total rules applied 324 place count 761 transition count 1098
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 327 place count 758 transition count 1092
Iterating global reduction 2 with 3 rules applied. Total rules applied 330 place count 758 transition count 1092
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 333 place count 755 transition count 1086
Iterating global reduction 2 with 3 rules applied. Total rules applied 336 place count 755 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 337 place count 755 transition count 1085
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 339 place count 753 transition count 1081
Iterating global reduction 3 with 2 rules applied. Total rules applied 341 place count 753 transition count 1081
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 693 place count 577 transition count 905
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 895 place count 476 transition count 935
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -11
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 973 place count 437 transition count 946
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 997 place count 437 transition count 922
Applied a total of 997 rules in 190 ms. Remains 437 /924 variables (removed 487) and now considering 922/1397 (removed 475) transitions.
// Phase 1: matrix 922 rows 437 cols
[2022-05-20 04:56:33] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-20 04:56:33] [INFO ] Implicit Places using invariants in 444 ms returned [11, 46, 94, 134, 194, 274, 326, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 447 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/924 places, 922/1397 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 404 transition count 898
Applied a total of 48 rules in 24 ms. Remains 404 /428 variables (removed 24) and now considering 898/922 (removed 24) transitions.
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:33] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:56:34] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:34] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:56:34] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:56:35] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/924 places, 898/1397 transitions.
Finished structural reductions, in 2 iterations. Remains : 404/924 places, 898/1397 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s308 1), p0:(EQ s276 0), p2:(AND (EQ s118 1) (EQ s155 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 711 reset in 883 ms.
Product exploration explored 100000 steps with 708 reset in 488 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) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 464 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:38] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:56:38] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 04:56:38] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2022-05-20 04:56:38] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 04:56:38] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:56:38] [INFO ] After 218ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 04:56:39] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-20 04:56:39] [INFO ] After 1147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 404 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 404/404 places, 898/898 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 404 transition count 874
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 62 place count 380 transition count 860
Applied a total of 62 rules in 53 ms. Remains 380 /404 variables (removed 24) and now considering 860/898 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 380/404 places, 860/898 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 860 rows 380 cols
[2022-05-20 04:56:39] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:56:39] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:56:39] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-20 04:56:40] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:56:40] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:56:40] [INFO ] After 68ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:56:40] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-05-20 04:56:40] [INFO ] After 917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 380/380 places, 860/860 transitions.
Applied a total of 0 rules in 16 ms. Remains 380 /380 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 380/380 places, 860/860 transitions.
Finished random walk after 6574 steps, including 48 resets, run visited all 1 properties in 54 ms. (steps per millisecond=121 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 9 factoid took 664 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 898/898 transitions.
Applied a total of 0 rules in 12 ms. Remains 404 /404 variables (removed 0) and now considering 898/898 (removed 0) transitions.
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:41] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:56:42] [INFO ] Implicit Places using invariants in 426 ms returned []
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:42] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:56:42] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:56:43] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2022-05-20 04:56:43] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:43] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-20 04:56:43] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 404/404 places, 898/898 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 : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 434 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:44] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-20 04:56:44] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 04:56:45] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2022-05-20 04:56:45] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 04:56:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:56:45] [INFO ] After 379ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 04:56:46] [INFO ] After 670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 190 ms.
[2022-05-20 04:56:46] [INFO ] After 1555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 112 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 3 properties in 15 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 9 factoid took 592 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 716 reset in 694 ms.
Product exploration explored 100000 steps with 717 reset in 512 ms.
Built C files in :
/tmp/ltsmin4100355429676644875
[2022-05-20 04:56:48] [INFO ] Computing symmetric may disable matrix : 898 transitions.
[2022-05-20 04:56:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:56:48] [INFO ] Computing symmetric may enable matrix : 898 transitions.
[2022-05-20 04:56:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:56:48] [INFO ] Computing Do-Not-Accords matrix : 898 transitions.
[2022-05-20 04:56:48] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:56:48] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4100355429676644875
Running compilation step : cd /tmp/ltsmin4100355429676644875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4100355429676644875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4100355429676644875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 898/898 transitions.
Applied a total of 0 rules in 15 ms. Remains 404 /404 variables (removed 0) and now considering 898/898 (removed 0) transitions.
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:51] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:56:52] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:52] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:56:52] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:56:52] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
[2022-05-20 04:56:53] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 898 rows 404 cols
[2022-05-20 04:56:53] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:56:53] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 404/404 places, 898/898 transitions.
Built C files in :
/tmp/ltsmin17923295246225953520
[2022-05-20 04:56:53] [INFO ] Computing symmetric may disable matrix : 898 transitions.
[2022-05-20 04:56:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:56:53] [INFO ] Computing symmetric may enable matrix : 898 transitions.
[2022-05-20 04:56:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:56:54] [INFO ] Computing Do-Not-Accords matrix : 898 transitions.
[2022-05-20 04:56:54] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:56:54] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17923295246225953520
Running compilation step : cd /tmp/ltsmin17923295246225953520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17923295246225953520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17923295246225953520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 04:56:57] [INFO ] Flatten gal took : 48 ms
[2022-05-20 04:56:57] [INFO ] Flatten gal took : 46 ms
[2022-05-20 04:56:57] [INFO ] Time to serialize gal into /tmp/LTL2119170815454939740.gal : 6 ms
[2022-05-20 04:56:57] [INFO ] Time to serialize properties into /tmp/LTL7145330403554789488.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2119170815454939740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7145330403554789488.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2119170...266
Read 1 LTL properties
Checking formula 0 : !((G(F(G((G((G(F("(p1116==0)")))||(G(X("(p1217==1)")))))||("((p468==1)&&(p602==1))"))))))
Formula 0 simplified : !GFG("((p468==1)&&(p602==1))" | G(GF"(p1116==0)" | GX"(p1217==1)"))
Detected timeout of ITS tools.
[2022-05-20 04:57:12] [INFO ] Flatten gal took : 44 ms
[2022-05-20 04:57:12] [INFO ] Applying decomposition
[2022-05-20 04:57:12] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17281206430851818992.txt' '-o' '/tmp/graph17281206430851818992.bin' '-w' '/tmp/graph17281206430851818992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17281206430851818992.bin' '-l' '-1' '-v' '-w' '/tmp/graph17281206430851818992.weights' '-q' '0' '-e' '0.001'
[2022-05-20 04:57:12] [INFO ] Decomposing Gal with order
[2022-05-20 04:57:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 04:57:12] [INFO ] Removed a total of 571 redundant transitions.
[2022-05-20 04:57:12] [INFO ] Flatten gal took : 159 ms
[2022-05-20 04:57:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 558 labels/synchronizations in 47 ms.
[2022-05-20 04:57:12] [INFO ] Time to serialize gal into /tmp/LTL2476727215630914380.gal : 12 ms
[2022-05-20 04:57:12] [INFO ] Time to serialize properties into /tmp/LTL16574334009185667750.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2476727215630914380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16574334009185667750.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2476727...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G((G((G(F("(i5.u24.p1116==0)")))||(G(X("(i6.u27.p1217==1)")))))||("((i3.u13.p468==1)&&(i3.u13.p602==1))"))))))
Formula 0 simplified : !GFG("((i3.u13.p468==1)&&(i3.u13.p602==1))" | G(GF"(i5.u24.p1116==0)" | GX"(i6.u27.p1217==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2510660868554112194
[2022-05-20 04:57:27] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2510660868554112194
Running compilation step : cd /tmp/ltsmin2510660868554112194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2567 ms.
Running link step : cd /tmp/ltsmin2510660868554112194;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2510660868554112194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([](([](([](<>((LTLAPp0==true)))||[](X((LTLAPp1==true)))))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-08 finished in 69653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(G(F((F(X(p0))||p1)))))))'
Support contains 2 out of 924 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions 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 923 transition count 1368
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 895 transition count 1368
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 56 place count 895 transition count 1267
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 258 place count 794 transition count 1267
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 291 place count 761 transition count 1098
Iterating global reduction 2 with 33 rules applied. Total rules applied 324 place count 761 transition count 1098
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 328 place count 757 transition count 1090
Iterating global reduction 2 with 4 rules applied. Total rules applied 332 place count 757 transition count 1090
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 336 place count 753 transition count 1082
Iterating global reduction 2 with 4 rules applied. Total rules applied 340 place count 753 transition count 1082
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 342 place count 753 transition count 1080
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 344 place count 751 transition count 1076
Iterating global reduction 3 with 2 rules applied. Total rules applied 346 place count 751 transition count 1076
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 702 place count 573 transition count 898
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 3 with 202 rules applied. Total rules applied 904 place count 472 transition count 927
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 978 place count 435 transition count 942
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 1000 place count 435 transition count 920
Applied a total of 1000 rules in 287 ms. Remains 435 /924 variables (removed 489) and now considering 920/1397 (removed 477) transitions.
// Phase 1: matrix 920 rows 435 cols
[2022-05-20 04:57:43] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:57:44] [INFO ] Implicit Places using invariants in 815 ms returned [10, 45, 93, 132, 193, 273, 323, 362, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 817 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/924 places, 920/1397 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 896
Applied a total of 48 rules in 22 ms. Remains 402 /426 variables (removed 24) and now considering 896/920 (removed 24) transitions.
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:57:44] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:57:44] [INFO ] Implicit Places using invariants in 545 ms returned []
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:57:44] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:57:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:57:45] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/924 places, 896/1397 transitions.
Finished structural reductions, in 2 iterations. Remains : 402/924 places, 896/1397 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s133 0), p0:(EQ s349 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 683 reset in 731 ms.
Product exploration explored 100000 steps with 686 reset in 800 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 237812 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237812 steps, saw 99667 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:57:50] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:57:50] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:57:50] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2022-05-20 04:57:51] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:57:51] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:57:51] [INFO ] After 70ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:57:51] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-20 04:57:51] [INFO ] After 651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 896/896 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 871
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 857
Applied a total of 64 rules in 48 ms. Remains 377 /402 variables (removed 25) and now considering 857/896 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 377/402 places, 857/896 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 198203 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198203 steps, saw 59807 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 857 rows 377 cols
[2022-05-20 04:57:54] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:57:54] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:57:54] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2022-05-20 04:57:55] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:57:55] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:57:55] [INFO ] After 73ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:57:55] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-20 04:57:55] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 377 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 377/377 places, 857/857 transitions.
Applied a total of 0 rules in 13 ms. Remains 377 /377 variables (removed 0) and now considering 857/857 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 377/377 places, 857/857 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 377/377 places, 857/857 transitions.
Applied a total of 0 rules in 10 ms. Remains 377 /377 variables (removed 0) and now considering 857/857 (removed 0) transitions.
// Phase 1: matrix 857 rows 377 cols
[2022-05-20 04:57:55] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:57:55] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 857 rows 377 cols
[2022-05-20 04:57:55] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:57:55] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:57:56] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2022-05-20 04:57:56] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 857 rows 377 cols
[2022-05-20 04:57:56] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:57:57] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 377/377 places, 857/857 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 377 transition count 845
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 377 transition count 845
Applied a total of 15 rules in 46 ms. Remains 377 /377 variables (removed 0) and now considering 845/857 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 845 rows 377 cols
[2022-05-20 04:57:57] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:57:57] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:57:57] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2022-05-20 04:57:57] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:57:57] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-20 04:57:57] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:57:57] [INFO ] Flatten gal took : 63 ms
[2022-05-20 04:57:57] [INFO ] Flatten gal took : 63 ms
[2022-05-20 04:57:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2181329571070440455.gal : 8 ms
[2022-05-20 04:57:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4998539666069776674.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13665341430680228764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2181329571070440455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4998539666069776674.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4998539666069776674.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 44
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :44 after 79
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :79 after 943
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :943 after 98647
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :98647 after 528529
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :528529 after 2.72387e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.72387e+06 after 1.13705e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.13705e+08 after 4.60789e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.60789e+08 after 3.84608e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.84608e+09 after 2.82152e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.82152e+10 after 1.04727e+14
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.04727e+14 after 2.85595e+16
Detected timeout of ITS tools.
[2022-05-20 04:58:13] [INFO ] Flatten gal took : 38 ms
[2022-05-20 04:58:13] [INFO ] Applying decomposition
[2022-05-20 04:58:13] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6190150187006423211.txt' '-o' '/tmp/graph6190150187006423211.bin' '-w' '/tmp/graph6190150187006423211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6190150187006423211.bin' '-l' '-1' '-v' '-w' '/tmp/graph6190150187006423211.weights' '-q' '0' '-e' '0.001'
[2022-05-20 04:58:13] [INFO ] Decomposing Gal with order
[2022-05-20 04:58:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 04:58:13] [INFO ] Removed a total of 643 redundant transitions.
[2022-05-20 04:58:13] [INFO ] Flatten gal took : 94 ms
[2022-05-20 04:58:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 518 labels/synchronizations in 71 ms.
[2022-05-20 04:58:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2384049068040698232.gal : 8 ms
[2022-05-20 04:58:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1340988110247295647.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13665341430680228764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2384049068040698232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1340988110247295647.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality1340988110247295647.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 49
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :49 after 97
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :97 after 257
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :257 after 449
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :449 after 721
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :721 after 70289
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :70289 after 1.00302e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.00302e+06 after 1.75972e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.75972e+07 after 3.09549e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.09549e+07 after 2.45741e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.45741e+10 after 9.17992e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.17992e+10 after 9.46399e+14
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14003406982630245978
[2022-05-20 04:58:28] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14003406982630245978
Running compilation step : cd /tmp/ltsmin14003406982630245978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2312 ms.
Running link step : cd /tmp/ltsmin14003406982630245978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14003406982630245978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 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 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 896/896 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 896/896 (removed 0) transitions.
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:58:43] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:58:44] [INFO ] Implicit Places using invariants in 537 ms returned []
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:58:44] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:58:44] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:58:45] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2022-05-20 04:58:45] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:58:45] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:58:46] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 896/896 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 (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 260679 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260679 steps, saw 104748 distinct states, run finished after 3002 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:58:49] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:58:49] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:58:49] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2022-05-20 04:58:50] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:58:50] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:58:50] [INFO ] After 90ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:58:50] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-05-20 04:58:50] [INFO ] After 802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 72 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 686 reset in 439 ms.
Product exploration explored 100000 steps with 682 reset in 499 ms.
Built C files in :
/tmp/ltsmin12343895181171914410
[2022-05-20 04:58:52] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2022-05-20 04:58:52] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:58:52] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2022-05-20 04:58:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:58:52] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2022-05-20 04:58:52] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:58:52] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12343895181171914410
Running compilation step : cd /tmp/ltsmin12343895181171914410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12343895181171914410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12343895181171914410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 896/896 transitions.
Applied a total of 0 rules in 20 ms. Remains 402 /402 variables (removed 0) and now considering 896/896 (removed 0) transitions.
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:58:55] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-20 04:58:55] [INFO ] Implicit Places using invariants in 515 ms returned []
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:58:55] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-20 04:58:56] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:58:56] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
[2022-05-20 04:58:56] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 896 rows 402 cols
[2022-05-20 04:58:56] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:58:57] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 896/896 transitions.
Built C files in :
/tmp/ltsmin17073412926885298501
[2022-05-20 04:58:57] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2022-05-20 04:58:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:58:57] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2022-05-20 04:58:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:58:57] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2022-05-20 04:58:57] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:58:57] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17073412926885298501
Running compilation step : cd /tmp/ltsmin17073412926885298501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17073412926885298501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17073412926885298501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 04:59:00] [INFO ] Flatten gal took : 67 ms
[2022-05-20 04:59:00] [INFO ] Flatten gal took : 64 ms
[2022-05-20 04:59:01] [INFO ] Time to serialize gal into /tmp/LTL16149044455661304002.gal : 9 ms
[2022-05-20 04:59:01] [INFO ] Time to serialize properties into /tmp/LTL17793098096541993920.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16149044455661304002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17793098096541993920.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1614904...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G(G(F((F(X("(p1360==0)")))||("(p530==0)"))))))))
Formula 0 simplified : !XFGF("(p530==0)" | FX"(p1360==0)")
Detected timeout of ITS tools.
[2022-05-20 04:59:16] [INFO ] Flatten gal took : 41 ms
[2022-05-20 04:59:16] [INFO ] Applying decomposition
[2022-05-20 04:59:16] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17673765301018323358.txt' '-o' '/tmp/graph17673765301018323358.bin' '-w' '/tmp/graph17673765301018323358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17673765301018323358.bin' '-l' '-1' '-v' '-w' '/tmp/graph17673765301018323358.weights' '-q' '0' '-e' '0.001'
[2022-05-20 04:59:16] [INFO ] Decomposing Gal with order
[2022-05-20 04:59:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 04:59:16] [INFO ] Removed a total of 760 redundant transitions.
[2022-05-20 04:59:16] [INFO ] Flatten gal took : 87 ms
[2022-05-20 04:59:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 605 labels/synchronizations in 43 ms.
[2022-05-20 04:59:16] [INFO ] Time to serialize gal into /tmp/LTL14093986538992259329.gal : 7 ms
[2022-05-20 04:59:16] [INFO ] Time to serialize properties into /tmp/LTL13883325881119077397.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14093986538992259329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13883325881119077397.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1409398...247
Read 1 LTL properties
Checking formula 0 : !((X(F(G(G(F((F(X("(i7.u34.p1360==0)")))||("(i3.u14.p530==0)"))))))))
Formula 0 simplified : !XFGF("(i3.u14.p530==0)" | FX"(i7.u34.p1360==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14360600087996958402
[2022-05-20 04:59:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14360600087996958402
Running compilation step : cd /tmp/ltsmin14360600087996958402;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2608 ms.
Running link step : cd /tmp/ltsmin14360600087996958402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin14360600087996958402;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([]([](<>((<>(X((LTLAPp0==true)))||(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-09 finished in 123650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)||F(G(p1))))||(G(p3)&&p2))))'
Support contains 5 out of 924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 915 transition count 1385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 915 transition count 1385
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 910 transition count 1376
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 910 transition count 1376
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 906 transition count 1368
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 906 transition count 1368
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 902 transition count 1362
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 902 transition count 1362
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 902 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 901 transition count 1357
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 901 transition count 1357
Applied a total of 50 rules in 177 ms. Remains 901 /924 variables (removed 23) and now considering 1357/1397 (removed 40) transitions.
// Phase 1: matrix 1357 rows 901 cols
[2022-05-20 04:59:46] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:59:47] [INFO ] Implicit Places using invariants in 711 ms returned []
// Phase 1: matrix 1357 rows 901 cols
[2022-05-20 04:59:47] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:59:49] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
// Phase 1: matrix 1357 rows 901 cols
[2022-05-20 04:59:49] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:59:50] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 901/924 places, 1357/1397 transitions.
Finished structural reductions, in 1 iterations. Remains : 901/924 places, 1357/1397 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s490 1) (EQ s581 1)), p3:(OR (EQ s152 0) (EQ s250 0)), p0:(EQ s704 1), p1:(AND (EQ s152 1) (EQ s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 884 steps with 4 reset in 5 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-11 finished in 4270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 915 transition count 1381
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 915 transition count 1381
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 911 transition count 1373
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 911 transition count 1373
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 907 transition count 1365
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 907 transition count 1365
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 903 transition count 1359
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 903 transition count 1359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 903 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 902 transition count 1354
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 902 transition count 1354
Applied a total of 48 rules in 206 ms. Remains 902 /924 variables (removed 22) and now considering 1354/1397 (removed 43) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2022-05-20 04:59:51] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-20 04:59:51] [INFO ] Implicit Places using invariants in 911 ms returned []
// Phase 1: matrix 1354 rows 902 cols
[2022-05-20 04:59:51] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-20 04:59:53] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 2560 ms to find 0 implicit places.
// Phase 1: matrix 1354 rows 902 cols
[2022-05-20 04:59:53] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:59:55] [INFO ] Dead Transitions using invariants and state equation in 1438 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/924 places, 1354/1397 transitions.
Finished structural reductions, in 1 iterations. Remains : 902/924 places, 1354/1397 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s415 1) (EQ s457 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 723 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-14 finished in 4335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 924/924 places, 1397/1397 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 914 transition count 1379
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 914 transition count 1379
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 910 transition count 1372
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 910 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 907 transition count 1366
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 907 transition count 1366
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 904 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 904 transition count 1362
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 904 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 903 transition count 1357
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 903 transition count 1357
Applied a total of 46 rules in 122 ms. Remains 903 /924 variables (removed 21) and now considering 1357/1397 (removed 40) transitions.
// Phase 1: matrix 1357 rows 903 cols
[2022-05-20 04:59:55] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-20 04:59:56] [INFO ] Implicit Places using invariants in 706 ms returned []
// Phase 1: matrix 1357 rows 903 cols
[2022-05-20 04:59:56] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:59:57] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
// Phase 1: matrix 1357 rows 903 cols
[2022-05-20 04:59:57] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:59:58] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/924 places, 1357/1397 transitions.
Finished structural reductions, in 1 iterations. Remains : 903/924 places, 1357/1397 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s401 0) (EQ s557 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 54757 steps with 121 reset in 171 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-15 finished in 4038 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G((G(F(p0))||G(X(p1))))||p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(G(F((F(X(p0))||p1)))))))'
[2022-05-20 04:59:59] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6964488440736225025
[2022-05-20 04:59:59] [INFO ] Computing symmetric may disable matrix : 1397 transitions.
[2022-05-20 04:59:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:59:59] [INFO ] Computing symmetric may enable matrix : 1397 transitions.
[2022-05-20 04:59:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:59:59] [INFO ] Applying decomposition
[2022-05-20 04:59:59] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3878505393443756970.txt' '-o' '/tmp/graph3878505393443756970.bin' '-w' '/tmp/graph3878505393443756970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3878505393443756970.bin' '-l' '-1' '-v' '-w' '/tmp/graph3878505393443756970.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:00:00] [INFO ] Decomposing Gal with order
[2022-05-20 05:00:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:00:00] [INFO ] Removed a total of 1382 redundant transitions.
[2022-05-20 05:00:00] [INFO ] Flatten gal took : 124 ms
[2022-05-20 05:00:00] [INFO ] Computing Do-Not-Accords matrix : 1397 transitions.
[2022-05-20 05:00:00] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 05:00:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 27 ms.
[2022-05-20 05:00:00] [INFO ] Built C files in 530ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6964488440736225025
Running compilation step : cd /tmp/ltsmin6964488440736225025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 05:00:00] [INFO ] Time to serialize gal into /tmp/LTLFireability14984856015137895353.gal : 22 ms
[2022-05-20 05:00:00] [INFO ] Time to serialize properties into /tmp/LTLFireability3765781934430148270.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14984856015137895353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3765781934430148270.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((G(F("(i11.u296.p1394!=1)"))))
Formula 0 simplified : !GF"(i11.u296.p1394!=1)"
Compilation finished in 8012 ms.
Running link step : cd /tmp/ltsmin6964488440736225025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 100 ms.
Running LTSmin : cd /tmp/ltsmin6964488440736225025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6964488440736225025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6964488440736225025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([](([](([](<>((LTLAPp1==true)))||[](X((LTLAPp2==true)))))||(LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 05:21:47] [INFO ] Applying decomposition
[2022-05-20 05:21:48] [INFO ] Flatten gal took : 158 ms
[2022-05-20 05:21:48] [INFO ] Decomposing Gal with order
[2022-05-20 05:21:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:21:48] [INFO ] Removed a total of 928 redundant transitions.
[2022-05-20 05:21:48] [INFO ] Flatten gal took : 264 ms
[2022-05-20 05:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2126 labels/synchronizations in 283 ms.
[2022-05-20 05:21:49] [INFO ] Time to serialize gal into /tmp/LTLFireability1712500804029095998.gal : 27 ms
[2022-05-20 05:21:49] [INFO ] Time to serialize properties into /tmp/LTLFireability3481962023910279454.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1712500804029095998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3481962023910279454.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 3 LTL properties
Checking formula 0 : !((G(F("(i0.i0.i0.i0.i0.i0.i0.u123.p1394!=1)"))))
Formula 0 simplified : !GF"(i0.i0.i0.i0.i0.i0.i0.u123.p1394!=1)"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6964488440736225025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([](([](([](<>((LTLAPp1==true)))||[](X((LTLAPp2==true)))))||(LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6964488440736225025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([]([](<>((<>(X((LTLAPp4==true)))||(LTLAPp5==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 05:43:37] [INFO ] Flatten gal took : 131 ms
[2022-05-20 05:43:37] [INFO ] Input system was already deterministic with 1397 transitions.
[2022-05-20 05:43:37] [INFO ] Transformed 924 places.
[2022-05-20 05:43:37] [INFO ] Transformed 1397 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-20 05:43:37] [INFO ] Time to serialize gal into /tmp/LTLFireability7111309600843569792.gal : 18 ms
[2022-05-20 05:43:37] [INFO ] Time to serialize properties into /tmp/LTLFireability6029667387193771751.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7111309600843569792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6029667387193771751.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(p1394!=1)"))))
Formula 0 simplified : !GF"(p1394!=1)"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-4028"
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 r150-smll-165276998500204"
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 ;