About the Execution of 2023-gold for PolyORBNT-PT-S05J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.720 | 3600000.00 | 9140957.00 | 32951.80 | FFFF??TFFFFTFF?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460800283.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-PT-S05J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800283
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 23K Apr 12 09:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 09:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 12 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 193K Apr 12 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K Apr 12 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 12 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 512K Apr 12 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717131258914
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J30
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 04:54:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 04:54:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:54:21] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-05-31 04:54:21] [INFO ] Transformed 489 places.
[2024-05-31 04:54:21] [INFO ] Transformed 1400 transitions.
[2024-05-31 04:54:21] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-31 04:54:21] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 129 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Applied a total of 0 rules in 54 ms. Remains 489 /489 variables (removed 0) and now considering 745/745 (removed 0) transitions.
[2024-05-31 04:54:21] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2024-05-31 04:54:21] [INFO ] Computed 82 invariants in 52 ms
[2024-05-31 04:54:22] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2024-05-31 04:54:22] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 489 cols
[2024-05-31 04:54:22] [INFO ] Computed 82 invariants in 20 ms
[2024-05-31 04:54:23] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-31 04:54:23] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 04:54:23] [INFO ] Invariant cache hit.
[2024-05-31 04:54:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:54:27] [INFO ] Implicit Places using invariants and state equation in 3876 ms returned []
Implicit Place search using SMT with State Equation took 4643 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 489/489 places, 650/745 transitions.
Applied a total of 0 rules in 16 ms. Remains 489 /489 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5818 ms. Remains : 489/489 places, 650/745 transitions.
Support contains 129 out of 489 places after structural reductions.
[2024-05-31 04:54:27] [INFO ] Flatten gal took : 101 ms
[2024-05-31 04:54:27] [INFO ] Flatten gal took : 66 ms
[2024-05-31 04:54:27] [INFO ] Input system was already deterministic with 650 transitions.
Incomplete random walk after 10000 steps, including 709 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2024-05-31 04:54:28] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 04:54:28] [INFO ] Invariant cache hit.
[2024-05-31 04:54:28] [INFO ] [Real]Absence check using 58 positive place invariants in 25 ms returned sat
[2024-05-31 04:54:28] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 51 ms returned sat
[2024-05-31 04:54:28] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-31 04:54:29] [INFO ] [Nat]Absence check using 58 positive place invariants in 38 ms returned sat
[2024-05-31 04:54:29] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 65 ms returned sat
[2024-05-31 04:54:29] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 04:54:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:54:29] [INFO ] After 101ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-31 04:54:30] [INFO ] Deduced a trap composed of 256 places in 218 ms of which 4 ms to minimize.
[2024-05-31 04:54:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2024-05-31 04:54:30] [INFO ] Deduced a trap composed of 215 places in 189 ms of which 1 ms to minimize.
[2024-05-31 04:54:30] [INFO ] Deduced a trap composed of 200 places in 340 ms of which 14 ms to minimize.
[2024-05-31 04:54:31] [INFO ] Deduced a trap composed of 205 places in 167 ms of which 2 ms to minimize.
[2024-05-31 04:54:31] [INFO ] Deduced a trap composed of 214 places in 184 ms of which 1 ms to minimize.
[2024-05-31 04:54:31] [INFO ] Deduced a trap composed of 212 places in 215 ms of which 1 ms to minimize.
[2024-05-31 04:54:31] [INFO ] Deduced a trap composed of 212 places in 150 ms of which 1 ms to minimize.
[2024-05-31 04:54:31] [INFO ] Deduced a trap composed of 208 places in 196 ms of which 1 ms to minimize.
[2024-05-31 04:54:32] [INFO ] Deduced a trap composed of 192 places in 193 ms of which 0 ms to minimize.
[2024-05-31 04:54:32] [INFO ] Deduced a trap composed of 197 places in 200 ms of which 0 ms to minimize.
[2024-05-31 04:54:33] [INFO ] Deduced a trap composed of 192 places in 225 ms of which 1 ms to minimize.
[2024-05-31 04:54:33] [INFO ] Deduced a trap composed of 187 places in 449 ms of which 0 ms to minimize.
[2024-05-31 04:54:33] [INFO ] Deduced a trap composed of 211 places in 290 ms of which 0 ms to minimize.
[2024-05-31 04:54:34] [INFO ] Deduced a trap composed of 197 places in 200 ms of which 1 ms to minimize.
[2024-05-31 04:54:34] [INFO ] Deduced a trap composed of 193 places in 132 ms of which 1 ms to minimize.
[2024-05-31 04:54:34] [INFO ] Deduced a trap composed of 204 places in 171 ms of which 1 ms to minimize.
[2024-05-31 04:54:34] [INFO ] Deduced a trap composed of 207 places in 154 ms of which 1 ms to minimize.
[2024-05-31 04:54:35] [INFO ] Deduced a trap composed of 195 places in 170 ms of which 3 ms to minimize.
[2024-05-31 04:54:35] [INFO ] Deduced a trap composed of 202 places in 153 ms of which 1 ms to minimize.
[2024-05-31 04:54:35] [INFO ] Deduced a trap composed of 193 places in 153 ms of which 0 ms to minimize.
[2024-05-31 04:54:35] [INFO ] Deduced a trap composed of 198 places in 139 ms of which 1 ms to minimize.
[2024-05-31 04:54:35] [INFO ] Deduced a trap composed of 205 places in 121 ms of which 0 ms to minimize.
[2024-05-31 04:54:36] [INFO ] Deduced a trap composed of 211 places in 147 ms of which 1 ms to minimize.
[2024-05-31 04:54:36] [INFO ] Deduced a trap composed of 213 places in 145 ms of which 1 ms to minimize.
[2024-05-31 04:54:36] [INFO ] Deduced a trap composed of 195 places in 142 ms of which 0 ms to minimize.
[2024-05-31 04:54:36] [INFO ] Deduced a trap composed of 205 places in 142 ms of which 0 ms to minimize.
[2024-05-31 04:54:36] [INFO ] Deduced a trap composed of 213 places in 156 ms of which 1 ms to minimize.
[2024-05-31 04:54:36] [INFO ] Deduced a trap composed of 202 places in 130 ms of which 1 ms to minimize.
[2024-05-31 04:54:37] [INFO ] Deduced a trap composed of 202 places in 141 ms of which 0 ms to minimize.
[2024-05-31 04:54:37] [INFO ] Deduced a trap composed of 195 places in 141 ms of which 0 ms to minimize.
[2024-05-31 04:54:37] [INFO ] Deduced a trap composed of 212 places in 143 ms of which 0 ms to minimize.
[2024-05-31 04:54:37] [INFO ] Deduced a trap composed of 193 places in 143 ms of which 1 ms to minimize.
[2024-05-31 04:54:37] [INFO ] Deduced a trap composed of 198 places in 142 ms of which 1 ms to minimize.
[2024-05-31 04:54:38] [INFO ] Deduced a trap composed of 202 places in 140 ms of which 1 ms to minimize.
[2024-05-31 04:54:38] [INFO ] Deduced a trap composed of 215 places in 130 ms of which 4 ms to minimize.
[2024-05-31 04:54:38] [INFO ] Deduced a trap composed of 189 places in 148 ms of which 0 ms to minimize.
[2024-05-31 04:54:38] [INFO ] Deduced a trap composed of 215 places in 150 ms of which 1 ms to minimize.
[2024-05-31 04:54:38] [INFO ] Deduced a trap composed of 225 places in 149 ms of which 0 ms to minimize.
[2024-05-31 04:54:47] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 17636 ms
[2024-05-31 04:54:47] [INFO ] After 18299ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2024-05-31 04:54:48] [INFO ] After 19190ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 76 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 77 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 145 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 413 transition count 579
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 411 transition count 577
Applied a total of 151 rules in 147 ms. Remains 411 /489 variables (removed 78) and now considering 577/650 (removed 73) transitions.
[2024-05-31 04:54:48] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 04:54:48] [INFO ] Computed 77 invariants in 8 ms
[2024-05-31 04:54:48] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 411/489 places, 577/650 transitions.
Incomplete random walk after 10000 steps, including 497 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:54:48] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 04:54:48] [INFO ] Invariant cache hit.
[2024-05-31 04:54:48] [INFO ] [Real]Absence check using 59 positive place invariants in 8 ms returned sat
[2024-05-31 04:54:48] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 15 ms returned sat
[2024-05-31 04:54:48] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:54:48] [INFO ] [Nat]Absence check using 59 positive place invariants in 12 ms returned sat
[2024-05-31 04:54:48] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 24 ms returned sat
[2024-05-31 04:54:49] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:54:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:54:49] [INFO ] After 64ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:54:49] [INFO ] Deduced a trap composed of 134 places in 179 ms of which 1 ms to minimize.
[2024-05-31 04:54:49] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 0 ms to minimize.
[2024-05-31 04:54:50] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 0 ms to minimize.
[2024-05-31 04:54:50] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 1 ms to minimize.
[2024-05-31 04:54:50] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 1 ms to minimize.
[2024-05-31 04:54:50] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 0 ms to minimize.
[2024-05-31 04:54:50] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 0 ms to minimize.
[2024-05-31 04:54:50] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 1 ms to minimize.
[2024-05-31 04:54:51] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 0 ms to minimize.
[2024-05-31 04:54:51] [INFO ] Deduced a trap composed of 145 places in 137 ms of which 0 ms to minimize.
[2024-05-31 04:54:51] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 0 ms to minimize.
[2024-05-31 04:54:51] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 1 ms to minimize.
[2024-05-31 04:54:51] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 1 ms to minimize.
[2024-05-31 04:54:52] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 0 ms to minimize.
[2024-05-31 04:54:52] [INFO ] Deduced a trap composed of 126 places in 230 ms of which 1 ms to minimize.
[2024-05-31 04:54:52] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 1 ms to minimize.
[2024-05-31 04:54:52] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 2 ms to minimize.
[2024-05-31 04:54:53] [INFO ] Deduced a trap composed of 134 places in 205 ms of which 11 ms to minimize.
[2024-05-31 04:54:53] [INFO ] Deduced a trap composed of 125 places in 171 ms of which 1 ms to minimize.
[2024-05-31 04:54:53] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 1 ms to minimize.
[2024-05-31 04:54:54] [INFO ] Deduced a trap composed of 116 places in 223 ms of which 0 ms to minimize.
[2024-05-31 04:54:55] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 1 ms to minimize.
[2024-05-31 04:54:56] [INFO ] Deduced a trap composed of 128 places in 181 ms of which 0 ms to minimize.
[2024-05-31 04:54:57] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 0 ms to minimize.
[2024-05-31 04:54:57] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 2 ms to minimize.
[2024-05-31 04:54:58] [INFO ] Deduced a trap composed of 122 places in 187 ms of which 2 ms to minimize.
[2024-05-31 04:54:58] [INFO ] Deduced a trap composed of 132 places in 157 ms of which 1 ms to minimize.
[2024-05-31 04:54:59] [INFO ] Deduced a trap composed of 129 places in 164 ms of which 1 ms to minimize.
[2024-05-31 04:54:59] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 12 ms to minimize.
[2024-05-31 04:54:59] [INFO ] Deduced a trap composed of 128 places in 184 ms of which 1 ms to minimize.
[2024-05-31 04:55:00] [INFO ] Deduced a trap composed of 133 places in 239 ms of which 1 ms to minimize.
[2024-05-31 04:55:00] [INFO ] Deduced a trap composed of 155 places in 164 ms of which 0 ms to minimize.
[2024-05-31 04:55:00] [INFO ] Deduced a trap composed of 132 places in 179 ms of which 0 ms to minimize.
[2024-05-31 04:55:01] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 1 ms to minimize.
[2024-05-31 04:55:01] [INFO ] Deduced a trap composed of 129 places in 173 ms of which 1 ms to minimize.
[2024-05-31 04:55:01] [INFO ] Deduced a trap composed of 132 places in 173 ms of which 0 ms to minimize.
[2024-05-31 04:55:01] [INFO ] Deduced a trap composed of 126 places in 177 ms of which 1 ms to minimize.
[2024-05-31 04:55:01] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 0 ms to minimize.
[2024-05-31 04:55:02] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2024-05-31 04:55:02] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 1 ms to minimize.
[2024-05-31 04:55:03] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 1 ms to minimize.
[2024-05-31 04:55:04] [INFO ] Deduced a trap composed of 134 places in 183 ms of which 0 ms to minimize.
[2024-05-31 04:55:04] [INFO ] Deduced a trap composed of 134 places in 170 ms of which 1 ms to minimize.
[2024-05-31 04:55:05] [INFO ] Deduced a trap composed of 119 places in 168 ms of which 1 ms to minimize.
[2024-05-31 04:55:05] [INFO ] Deduced a trap composed of 128 places in 182 ms of which 1 ms to minimize.
[2024-05-31 04:55:05] [INFO ] Deduced a trap composed of 122 places in 185 ms of which 1 ms to minimize.
[2024-05-31 04:55:07] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 0 ms to minimize.
[2024-05-31 04:55:13] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 24250 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:55:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:55:13] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 411 transition count 576
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 576
Applied a total of 2 rules in 56 ms. Remains 410 /411 variables (removed 1) and now considering 576/577 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 410/411 places, 576/577 transitions.
Incomplete random walk after 10000 steps, including 522 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 245974 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245974 steps, saw 73731 distinct states, run finished after 3015 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:55:17] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2024-05-31 04:55:17] [INFO ] Computed 77 invariants in 15 ms
[2024-05-31 04:55:17] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2024-05-31 04:55:17] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 30 ms returned sat
[2024-05-31 04:55:17] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:55:17] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2024-05-31 04:55:17] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 18 ms returned sat
[2024-05-31 04:55:18] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:55:18] [INFO ] After 93ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:55:18] [INFO ] Deduced a trap composed of 135 places in 173 ms of which 1 ms to minimize.
[2024-05-31 04:55:18] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 0 ms to minimize.
[2024-05-31 04:55:18] [INFO ] Deduced a trap composed of 125 places in 176 ms of which 0 ms to minimize.
[2024-05-31 04:55:18] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 1 ms to minimize.
[2024-05-31 04:55:19] [INFO ] Deduced a trap composed of 140 places in 136 ms of which 0 ms to minimize.
[2024-05-31 04:55:19] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 1 ms to minimize.
[2024-05-31 04:55:19] [INFO ] Deduced a trap composed of 110 places in 183 ms of which 0 ms to minimize.
[2024-05-31 04:55:19] [INFO ] Deduced a trap composed of 123 places in 172 ms of which 0 ms to minimize.
[2024-05-31 04:55:20] [INFO ] Deduced a trap composed of 122 places in 216 ms of which 1 ms to minimize.
[2024-05-31 04:55:20] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 1 ms to minimize.
[2024-05-31 04:55:20] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 1 ms to minimize.
[2024-05-31 04:55:21] [INFO ] Deduced a trap composed of 125 places in 325 ms of which 1 ms to minimize.
[2024-05-31 04:55:21] [INFO ] Deduced a trap composed of 142 places in 190 ms of which 0 ms to minimize.
[2024-05-31 04:55:21] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 1 ms to minimize.
[2024-05-31 04:55:21] [INFO ] Deduced a trap composed of 131 places in 207 ms of which 0 ms to minimize.
[2024-05-31 04:55:22] [INFO ] Deduced a trap composed of 132 places in 196 ms of which 1 ms to minimize.
[2024-05-31 04:55:22] [INFO ] Deduced a trap composed of 125 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:55:31] [INFO ] Deduced a trap composed of 128 places in 8478 ms of which 26 ms to minimize.
[2024-05-31 04:55:31] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 1 ms to minimize.
[2024-05-31 04:55:31] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 1 ms to minimize.
[2024-05-31 04:55:31] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 0 ms to minimize.
[2024-05-31 04:55:31] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 0 ms to minimize.
[2024-05-31 04:55:32] [INFO ] Deduced a trap composed of 130 places in 195 ms of which 1 ms to minimize.
[2024-05-31 04:55:32] [INFO ] Deduced a trap composed of 119 places in 187 ms of which 1 ms to minimize.
[2024-05-31 04:55:32] [INFO ] Deduced a trap composed of 119 places in 184 ms of which 1 ms to minimize.
[2024-05-31 04:55:33] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 1 ms to minimize.
[2024-05-31 04:55:33] [INFO ] Deduced a trap composed of 132 places in 187 ms of which 0 ms to minimize.
[2024-05-31 04:55:42] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 24082 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:55:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:55:42] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2024-05-31 04:55:42] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 04:55:42] [INFO ] Invariant cache hit.
[2024-05-31 04:55:43] [INFO ] Implicit Places using invariants in 807 ms returned []
[2024-05-31 04:55:43] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 04:55:43] [INFO ] Invariant cache hit.
[2024-05-31 04:55:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:55:48] [INFO ] Implicit Places using invariants and state equation in 5445 ms returned []
Implicit Place search using SMT with State Equation took 6262 ms to find 0 implicit places.
[2024-05-31 04:55:48] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-31 04:55:48] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 04:55:48] [INFO ] Invariant cache hit.
[2024-05-31 04:55:49] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6948 ms. Remains : 410/410 places, 576/576 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 88 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2024-05-31 04:55:49] [INFO ] Computed 77 invariants in 10 ms
[2024-05-31 04:55:49] [INFO ] [Real]Absence check using 59 positive place invariants in 395 ms returned sat
[2024-05-31 04:55:49] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 134 ms returned sat
[2024-05-31 04:55:50] [INFO ] After 752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:55:50] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2024-05-31 04:55:50] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 23 ms returned sat
[2024-05-31 04:55:50] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:55:51] [INFO ] Deduced a trap composed of 126 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:55:51] [INFO ] Deduced a trap composed of 132 places in 254 ms of which 1 ms to minimize.
[2024-05-31 04:55:51] [INFO ] Deduced a trap composed of 124 places in 270 ms of which 1 ms to minimize.
[2024-05-31 04:55:52] [INFO ] Deduced a trap composed of 129 places in 277 ms of which 1 ms to minimize.
[2024-05-31 04:55:52] [INFO ] Deduced a trap composed of 125 places in 202 ms of which 0 ms to minimize.
[2024-05-31 04:55:52] [INFO ] Deduced a trap composed of 132 places in 223 ms of which 1 ms to minimize.
[2024-05-31 04:55:52] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 1 ms to minimize.
[2024-05-31 04:55:52] [INFO ] Deduced a trap composed of 123 places in 179 ms of which 1 ms to minimize.
[2024-05-31 04:55:53] [INFO ] Deduced a trap composed of 117 places in 170 ms of which 0 ms to minimize.
[2024-05-31 04:55:53] [INFO ] Deduced a trap composed of 135 places in 181 ms of which 1 ms to minimize.
[2024-05-31 04:55:53] [INFO ] Deduced a trap composed of 114 places in 212 ms of which 1 ms to minimize.
[2024-05-31 04:55:54] [INFO ] Deduced a trap composed of 135 places in 176 ms of which 0 ms to minimize.
[2024-05-31 04:55:54] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 0 ms to minimize.
[2024-05-31 04:55:54] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 1 ms to minimize.
[2024-05-31 04:55:54] [INFO ] Deduced a trap composed of 126 places in 155 ms of which 0 ms to minimize.
[2024-05-31 04:55:54] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 0 ms to minimize.
[2024-05-31 04:55:55] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 0 ms to minimize.
[2024-05-31 04:55:55] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 1 ms to minimize.
[2024-05-31 04:55:55] [INFO ] Deduced a trap composed of 138 places in 135 ms of which 0 ms to minimize.
[2024-05-31 04:55:55] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 0 ms to minimize.
[2024-05-31 04:55:55] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 0 ms to minimize.
[2024-05-31 04:55:56] [INFO ] Deduced a trap composed of 130 places in 153 ms of which 0 ms to minimize.
[2024-05-31 04:55:56] [INFO ] Deduced a trap composed of 129 places in 153 ms of which 0 ms to minimize.
[2024-05-31 04:55:56] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 1 ms to minimize.
[2024-05-31 04:55:56] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 4 ms to minimize.
[2024-05-31 04:55:57] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 0 ms to minimize.
[2024-05-31 04:55:57] [INFO ] Deduced a trap composed of 122 places in 183 ms of which 0 ms to minimize.
[2024-05-31 04:55:57] [INFO ] Deduced a trap composed of 124 places in 183 ms of which 0 ms to minimize.
[2024-05-31 04:55:57] [INFO ] Deduced a trap composed of 117 places in 151 ms of which 1 ms to minimize.
[2024-05-31 04:55:58] [INFO ] Deduced a trap composed of 123 places in 179 ms of which 2 ms to minimize.
[2024-05-31 04:55:58] [INFO ] Deduced a trap composed of 129 places in 204 ms of which 0 ms to minimize.
[2024-05-31 04:55:58] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 0 ms to minimize.
[2024-05-31 04:55:58] [INFO ] Deduced a trap composed of 126 places in 201 ms of which 1 ms to minimize.
[2024-05-31 04:55:59] [INFO ] Deduced a trap composed of 129 places in 173 ms of which 0 ms to minimize.
[2024-05-31 04:55:59] [INFO ] Deduced a trap composed of 117 places in 181 ms of which 1 ms to minimize.
[2024-05-31 04:55:59] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 0 ms to minimize.
[2024-05-31 04:55:59] [INFO ] Deduced a trap composed of 126 places in 179 ms of which 0 ms to minimize.
[2024-05-31 04:56:00] [INFO ] Deduced a trap composed of 117 places in 179 ms of which 0 ms to minimize.
[2024-05-31 04:56:00] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 0 ms to minimize.
[2024-05-31 04:56:00] [INFO ] Deduced a trap composed of 119 places in 183 ms of which 0 ms to minimize.
[2024-05-31 04:56:01] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 1 ms to minimize.
[2024-05-31 04:56:01] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 0 ms to minimize.
[2024-05-31 04:56:01] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 1 ms to minimize.
[2024-05-31 04:56:01] [INFO ] Deduced a trap composed of 120 places in 178 ms of which 1 ms to minimize.
[2024-05-31 04:56:01] [INFO ] Deduced a trap composed of 146 places in 138 ms of which 0 ms to minimize.
[2024-05-31 04:56:02] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 0 ms to minimize.
[2024-05-31 04:56:02] [INFO ] Deduced a trap composed of 129 places in 187 ms of which 1 ms to minimize.
[2024-05-31 04:56:02] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 0 ms to minimize.
[2024-05-31 04:56:02] [INFO ] Deduced a trap composed of 122 places in 170 ms of which 0 ms to minimize.
[2024-05-31 04:56:03] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 1 ms to minimize.
[2024-05-31 04:56:03] [INFO ] Deduced a trap composed of 141 places in 191 ms of which 1 ms to minimize.
[2024-05-31 04:56:03] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 0 ms to minimize.
[2024-05-31 04:56:04] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 1 ms to minimize.
[2024-05-31 04:56:04] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 0 ms to minimize.
[2024-05-31 04:56:04] [INFO ] Deduced a trap composed of 123 places in 173 ms of which 0 ms to minimize.
[2024-05-31 04:56:04] [INFO ] Deduced a trap composed of 124 places in 199 ms of which 0 ms to minimize.
[2024-05-31 04:56:05] [INFO ] Deduced a trap composed of 112 places in 134 ms of which 0 ms to minimize.
[2024-05-31 04:56:05] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 1 ms to minimize.
[2024-05-31 04:56:05] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 0 ms to minimize.
[2024-05-31 04:56:05] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 0 ms to minimize.
[2024-05-31 04:56:06] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 1 ms to minimize.
[2024-05-31 04:56:06] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 1 ms to minimize.
[2024-05-31 04:56:06] [INFO ] Deduced a trap composed of 135 places in 201 ms of which 1 ms to minimize.
[2024-05-31 04:56:06] [INFO ] Deduced a trap composed of 122 places in 174 ms of which 1 ms to minimize.
[2024-05-31 04:56:06] [INFO ] Deduced a trap composed of 125 places in 177 ms of which 1 ms to minimize.
[2024-05-31 04:56:07] [INFO ] Deduced a trap composed of 126 places in 192 ms of which 1 ms to minimize.
[2024-05-31 04:56:07] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 1 ms to minimize.
[2024-05-31 04:56:07] [INFO ] Deduced a trap composed of 134 places in 193 ms of which 1 ms to minimize.
[2024-05-31 04:56:07] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 1 ms to minimize.
[2024-05-31 04:56:08] [INFO ] Deduced a trap composed of 126 places in 180 ms of which 0 ms to minimize.
[2024-05-31 04:56:08] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 0 ms to minimize.
[2024-05-31 04:56:08] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 0 ms to minimize.
[2024-05-31 04:56:08] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 1 ms to minimize.
[2024-05-31 04:56:09] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 0 ms to minimize.
[2024-05-31 04:56:09] [INFO ] Deduced a trap composed of 126 places in 193 ms of which 1 ms to minimize.
[2024-05-31 04:56:09] [INFO ] Deduced a trap composed of 120 places in 175 ms of which 1 ms to minimize.
[2024-05-31 04:56:10] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 1 ms to minimize.
[2024-05-31 04:56:10] [INFO ] Deduced a trap composed of 129 places in 169 ms of which 1 ms to minimize.
[2024-05-31 04:56:10] [INFO ] Deduced a trap composed of 111 places in 179 ms of which 1 ms to minimize.
[2024-05-31 04:56:10] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 1 ms to minimize.
[2024-05-31 04:56:10] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 1 ms to minimize.
[2024-05-31 04:56:11] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 0 ms to minimize.
[2024-05-31 04:56:12] [INFO ] Deduced a trap composed of 126 places in 178 ms of which 0 ms to minimize.
[2024-05-31 04:56:12] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 0 ms to minimize.
[2024-05-31 04:56:12] [INFO ] Deduced a trap composed of 129 places in 180 ms of which 1 ms to minimize.
[2024-05-31 04:56:13] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 1 ms to minimize.
[2024-05-31 04:56:13] [INFO ] Deduced a trap composed of 126 places in 173 ms of which 0 ms to minimize.
[2024-05-31 04:56:13] [INFO ] Deduced a trap composed of 129 places in 163 ms of which 1 ms to minimize.
[2024-05-31 04:56:22] [INFO ] Trap strengthening (SAT) tested/added 88/88 trap constraints in 31889 ms
[2024-05-31 04:56:22] [INFO ] After 32549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 04:56:22] [INFO ] After 32684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Support contains 66 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 34 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 04:56:23] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-31 04:56:23] [INFO ] Computed 77 invariants in 9 ms
[2024-05-31 04:56:24] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
[2024-05-31 04:56:24] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 04:56:24] [INFO ] Invariant cache hit.
[2024-05-31 04:56:25] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-05-31 04:56:25] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 04:56:25] [INFO ] Invariant cache hit.
[2024-05-31 04:56:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:56:30] [INFO ] Implicit Places using invariants and state equation in 5507 ms returned []
Implicit Place search using SMT with State Equation took 6162 ms to find 0 implicit places.
[2024-05-31 04:56:30] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 04:56:30] [INFO ] Invariant cache hit.
[2024-05-31 04:56:31] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8125 ms. Remains : 483/489 places, 649/650 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 364 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s79 1) (GEQ s261 1) (GEQ s442 1)) (AND (GEQ s152 1) (GEQ s261 1) (GEQ s442 1)) (AND (GEQ s261 1) (GEQ s336 1) (GEQ s442 1)) (AND (GEQ s16...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3506 steps with 256 reset in 108 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-00 finished in 8702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 16 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 04:56:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 04:56:31] [INFO ] Invariant cache hit.
[2024-05-31 04:56:32] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
[2024-05-31 04:56:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 04:56:32] [INFO ] Invariant cache hit.
[2024-05-31 04:56:33] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-31 04:56:33] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 04:56:33] [INFO ] Invariant cache hit.
[2024-05-31 04:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:56:37] [INFO ] Implicit Places using invariants and state equation in 4740 ms returned []
Implicit Place search using SMT with State Equation took 5170 ms to find 0 implicit places.
[2024-05-31 04:56:37] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 04:56:37] [INFO ] Invariant cache hit.
[2024-05-31 04:56:38] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6618 ms. Remains : 483/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s297 1), p1:(AND (GEQ s163 1) (GEQ s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-01 finished in 6826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 449 transition count 580
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
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 144 place count 412 transition count 578
Applied a total of 144 rules in 57 ms. Remains 412 /489 variables (removed 77) and now considering 578/650 (removed 72) transitions.
[2024-05-31 04:56:38] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 04:56:38] [INFO ] Computed 77 invariants in 6 ms
[2024-05-31 04:56:39] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
[2024-05-31 04:56:39] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 04:56:39] [INFO ] Invariant cache hit.
[2024-05-31 04:56:39] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-31 04:56:39] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 04:56:39] [INFO ] Invariant cache hit.
[2024-05-31 04:56:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:56:42] [INFO ] Implicit Places using invariants and state equation in 3168 ms returned []
Implicit Place search using SMT with State Equation took 3583 ms to find 0 implicit places.
[2024-05-31 04:56:42] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-31 04:56:42] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 04:56:42] [INFO ] Invariant cache hit.
[2024-05-31 04:56:43] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/489 places, 578/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4468 ms. Remains : 412/489 places, 578/650 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s252 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-03 finished in 4524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 14 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 489 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 454 transition count 615
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 454 transition count 581
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 420 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 419 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 419 transition count 580
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 2 with 2 rules applied. Total rules applied 142 place count 418 transition count 579
Applied a total of 142 rules in 64 ms. Remains 418 /489 variables (removed 71) and now considering 579/650 (removed 71) transitions.
[2024-05-31 04:56:43] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 418 cols
[2024-05-31 04:56:43] [INFO ] Computed 82 invariants in 17 ms
[2024-05-31 04:56:43] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
[2024-05-31 04:56:43] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:56:43] [INFO ] Invariant cache hit.
[2024-05-31 04:56:44] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-31 04:56:44] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:56:44] [INFO ] Invariant cache hit.
[2024-05-31 04:56:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:56:48] [INFO ] Implicit Places using invariants and state equation in 3904 ms returned []
Implicit Place search using SMT with State Equation took 4363 ms to find 0 implicit places.
[2024-05-31 04:56:48] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-31 04:56:48] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:56:48] [INFO ] Invariant cache hit.
[2024-05-31 04:56:48] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/489 places, 579/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5421 ms. Remains : 418/489 places, 579/650 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s172 10) (LT s401 1)), p0:(AND (OR (LT s20 1) (LT s70 1) (LT s316 1) (LT s382 1)) (OR (LT s70 1) (LT s199 1) (LT s361 1) (LT s382 1)) (OR (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9575 reset in 559 ms.
Product exploration explored 100000 steps with 9536 reset in 491 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 1 factoid took 286 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 255 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 14 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 579/579 transitions.
Applied a total of 0 rules in 20 ms. Remains 418 /418 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2024-05-31 04:56:50] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:56:50] [INFO ] Invariant cache hit.
[2024-05-31 04:56:51] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
[2024-05-31 04:56:51] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:56:51] [INFO ] Invariant cache hit.
[2024-05-31 04:56:51] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-31 04:56:51] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:56:51] [INFO ] Invariant cache hit.
[2024-05-31 04:56:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:56:55] [INFO ] Implicit Places using invariants and state equation in 4560 ms returned []
Implicit Place search using SMT with State Equation took 4956 ms to find 0 implicit places.
[2024-05-31 04:56:56] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 04:56:56] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:56:56] [INFO ] Invariant cache hit.
[2024-05-31 04:56:56] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5891 ms. Remains : 418/418 places, 579/579 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 297 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 410 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9671 reset in 396 ms.
Product exploration explored 100000 steps with 9531 reset in 379 ms.
Built C files in :
/tmp/ltsmin10108957192152262583
[2024-05-31 04:56:58] [INFO ] Computing symmetric may disable matrix : 579 transitions.
[2024-05-31 04:56:58] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:56:58] [INFO ] Computing symmetric may enable matrix : 579 transitions.
[2024-05-31 04:56:58] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:56:58] [INFO ] Computing Do-Not-Accords matrix : 579 transitions.
[2024-05-31 04:56:58] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:56:58] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10108957192152262583
Running compilation step : cd /tmp/ltsmin10108957192152262583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1861 ms.
Running link step : cd /tmp/ltsmin10108957192152262583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin10108957192152262583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6436592888114020874.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 14 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 579/579 transitions.
Applied a total of 0 rules in 16 ms. Remains 418 /418 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2024-05-31 04:57:13] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:57:13] [INFO ] Invariant cache hit.
[2024-05-31 04:57:14] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
[2024-05-31 04:57:14] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:57:14] [INFO ] Invariant cache hit.
[2024-05-31 04:57:14] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-31 04:57:14] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:57:14] [INFO ] Invariant cache hit.
[2024-05-31 04:57:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:57:18] [INFO ] Implicit Places using invariants and state equation in 4069 ms returned []
Implicit Place search using SMT with State Equation took 4455 ms to find 0 implicit places.
[2024-05-31 04:57:18] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-31 04:57:18] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 04:57:18] [INFO ] Invariant cache hit.
[2024-05-31 04:57:18] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5340 ms. Remains : 418/418 places, 579/579 transitions.
Built C files in :
/tmp/ltsmin398730818203197486
[2024-05-31 04:57:18] [INFO ] Computing symmetric may disable matrix : 579 transitions.
[2024-05-31 04:57:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:57:18] [INFO ] Computing symmetric may enable matrix : 579 transitions.
[2024-05-31 04:57:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:57:19] [INFO ] Computing Do-Not-Accords matrix : 579 transitions.
[2024-05-31 04:57:19] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:57:19] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin398730818203197486
Running compilation step : cd /tmp/ltsmin398730818203197486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1783 ms.
Running link step : cd /tmp/ltsmin398730818203197486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin398730818203197486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14203019800732708323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 04:57:34] [INFO ] Flatten gal took : 43 ms
[2024-05-31 04:57:34] [INFO ] Flatten gal took : 39 ms
[2024-05-31 04:57:34] [INFO ] Time to serialize gal into /tmp/LTL16108117855821542138.gal : 7 ms
[2024-05-31 04:57:34] [INFO ] Time to serialize properties into /tmp/LTL3165724130439545288.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16108117855821542138.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9160432346938244387.hoa' '-atoms' '/tmp/LTL3165724130439545288.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3165724130439545288.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9160432346938244387.hoa
Detected timeout of ITS tools.
[2024-05-31 04:57:49] [INFO ] Flatten gal took : 81 ms
[2024-05-31 04:57:49] [INFO ] Flatten gal took : 74 ms
[2024-05-31 04:57:49] [INFO ] Time to serialize gal into /tmp/LTL18352078561714018737.gal : 5 ms
[2024-05-31 04:57:49] [INFO ] Time to serialize properties into /tmp/LTL1438923259425744694.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18352078561714018737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1438923259425744694.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((cJobCnt<10)||(place_782_1<1))"))||("((((((TheSour_1<1)||(cSources<1))||((DataOnSrc_1<1)||(CanInjectEvent<1)))&&(((cSource...442
Formula 0 simplified : G(F!"((cJobCnt<10)||(place_782_1<1))" & FG!"((((((TheSour_1<1)||(cSources<1))||((DataOnSrc_1<1)||(CanInjectEvent<1)))&&(((cSources<1...435
Detected timeout of ITS tools.
[2024-05-31 04:58:04] [INFO ] Flatten gal took : 60 ms
[2024-05-31 04:58:04] [INFO ] Applying decomposition
[2024-05-31 04:58:04] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13814473252842697285.txt' '-o' '/tmp/graph13814473252842697285.bin' '-w' '/tmp/graph13814473252842697285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13814473252842697285.bin' '-l' '-1' '-v' '-w' '/tmp/graph13814473252842697285.weights' '-q' '0' '-e' '0.001'
[2024-05-31 04:58:05] [INFO ] Decomposing Gal with order
[2024-05-31 04:58:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:58:05] [INFO ] Removed a total of 691 redundant transitions.
[2024-05-31 04:58:05] [INFO ] Flatten gal took : 280 ms
[2024-05-31 04:58:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 259 labels/synchronizations in 36 ms.
[2024-05-31 04:58:05] [INFO ] Time to serialize gal into /tmp/LTL9915968360504861210.gal : 15 ms
[2024-05-31 04:58:05] [INFO ] Time to serialize properties into /tmp/LTL7084732885624591300.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9915968360504861210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7084732885624591300.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((u12.cJobCnt<10)||(i11.u18.place_782_1<1))"))||("((((((i11.u6.TheSour_1<1)||(i3.u5.cSources<1))||((i11.u24.DataOnSrc_1<1)|...591
Formula 0 simplified : G(F!"((u12.cJobCnt<10)||(i11.u18.place_782_1<1))" & FG!"((((((i11.u6.TheSour_1<1)||(i3.u5.cSources<1))||((i11.u24.DataOnSrc_1<1)||(i...584
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12958608200735127154
[2024-05-31 04:58:20] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12958608200735127154
Running compilation step : cd /tmp/ltsmin12958608200735127154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1096 ms.
Running link step : cd /tmp/ltsmin12958608200735127154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12958608200735127154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-04 finished in 112416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(p1))||(p1&&G(p2))))))'
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Applied a total of 5 rules in 19 ms. Remains 484 /489 variables (removed 5) and now considering 650/650 (removed 0) transitions.
[2024-05-31 04:58:35] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2024-05-31 04:58:35] [INFO ] Computed 77 invariants in 10 ms
[2024-05-31 04:58:36] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
[2024-05-31 04:58:36] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 04:58:36] [INFO ] Invariant cache hit.
[2024-05-31 04:58:36] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-31 04:58:36] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 04:58:36] [INFO ] Invariant cache hit.
[2024-05-31 04:58:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:58:41] [INFO ] Implicit Places using invariants and state equation in 4511 ms returned []
Implicit Place search using SMT with State Equation took 4994 ms to find 0 implicit places.
[2024-05-31 04:58:41] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 04:58:41] [INFO ] Invariant cache hit.
[2024-05-31 04:58:41] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/489 places, 650/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6239 ms. Remains : 484/489 places, 650/650 transitions.
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s8 4), p1:(LT s217 1), p2:(OR (LT s197 10) (LT s465 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 12141 reset in 322 ms.
Product exploration explored 100000 steps with 12167 reset in 342 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
Knowledge based reduction with 15 factoid took 989 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 674 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 152 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-31 04:58:44] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 04:58:44] [INFO ] Invariant cache hit.
[2024-05-31 04:58:45] [INFO ] [Real]Absence check using 59 positive place invariants in 11 ms returned sat
[2024-05-31 04:58:45] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 22 ms returned sat
[2024-05-31 04:58:45] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2024-05-31 04:58:45] [INFO ] [Nat]Absence check using 59 positive place invariants in 10 ms returned sat
[2024-05-31 04:58:45] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 18 ms returned sat
[2024-05-31 04:58:46] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2024-05-31 04:58:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:58:46] [INFO ] After 586ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :6 sat :2
[2024-05-31 04:58:46] [INFO ] Deduced a trap composed of 209 places in 179 ms of which 1 ms to minimize.
[2024-05-31 04:58:47] [INFO ] Deduced a trap composed of 219 places in 153 ms of which 0 ms to minimize.
[2024-05-31 04:58:47] [INFO ] Deduced a trap composed of 213 places in 160 ms of which 1 ms to minimize.
[2024-05-31 04:58:47] [INFO ] Deduced a trap composed of 210 places in 254 ms of which 1 ms to minimize.
[2024-05-31 04:58:47] [INFO ] Deduced a trap composed of 204 places in 177 ms of which 1 ms to minimize.
[2024-05-31 04:58:48] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 1 ms to minimize.
[2024-05-31 04:58:49] [INFO ] Deduced a trap composed of 213 places in 218 ms of which 1 ms to minimize.
[2024-05-31 04:58:51] [INFO ] Deduced a trap composed of 192 places in 169 ms of which 0 ms to minimize.
[2024-05-31 04:58:51] [INFO ] Deduced a trap composed of 198 places in 220 ms of which 0 ms to minimize.
[2024-05-31 04:58:52] [INFO ] Deduced a trap composed of 234 places in 193 ms of which 1 ms to minimize.
[2024-05-31 04:58:53] [INFO ] Deduced a trap composed of 203 places in 194 ms of which 1 ms to minimize.
[2024-05-31 04:58:53] [INFO ] Deduced a trap composed of 219 places in 236 ms of which 39 ms to minimize.
[2024-05-31 04:59:02] [INFO ] Trap strengthening (SAT) tested/added 12/12 trap constraints in 16070 ms
[2024-05-31 04:59:03] [INFO ] Deduced a trap composed of 213 places in 343 ms of which 6 ms to minimize.
[2024-05-31 04:59:03] [INFO ] Deduced a trap composed of 204 places in 173 ms of which 1 ms to minimize.
[2024-05-31 04:59:04] [INFO ] Deduced a trap composed of 218 places in 201 ms of which 0 ms to minimize.
[2024-05-31 04:59:04] [INFO ] Deduced a trap composed of 195 places in 204 ms of which 1 ms to minimize.
[2024-05-31 04:59:04] [INFO ] Deduced a trap composed of 200 places in 217 ms of which 1 ms to minimize.
[2024-05-31 04:59:05] [INFO ] Deduced a trap composed of 203 places in 229 ms of which 1 ms to minimize.
[2024-05-31 04:59:05] [INFO ] Deduced a trap composed of 219 places in 207 ms of which 1 ms to minimize.
[2024-05-31 04:59:05] [INFO ] Deduced a trap composed of 210 places in 254 ms of which 0 ms to minimize.
[2024-05-31 04:59:05] [INFO ] Deduced a trap composed of 198 places in 175 ms of which 10 ms to minimize.
[2024-05-31 04:59:06] [INFO ] Deduced a trap composed of 201 places in 181 ms of which 1 ms to minimize.
[2024-05-31 04:59:06] [INFO ] Deduced a trap composed of 201 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:59:08] [INFO ] Deduced a trap composed of 216 places in 286 ms of which 1 ms to minimize.
[2024-05-31 04:59:09] [INFO ] Deduced a trap composed of 216 places in 246 ms of which 1 ms to minimize.
[2024-05-31 04:59:09] [INFO ] Deduced a trap composed of 207 places in 217 ms of which 1 ms to minimize.
[2024-05-31 04:59:09] [INFO ] Deduced a trap composed of 207 places in 265 ms of which 1 ms to minimize.
[2024-05-31 04:59:10] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 6980 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:59:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:59:10] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:5
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 44 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2024-05-31 04:59:10] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 04:59:10] [INFO ] Computed 77 invariants in 12 ms
[2024-05-31 04:59:10] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 412/484 places, 578/650 transitions.
Incomplete random walk after 10000 steps, including 598 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 271943 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271943 steps, saw 81220 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 04:59:13] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 04:59:13] [INFO ] Invariant cache hit.
[2024-05-31 04:59:13] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2024-05-31 04:59:14] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 17 ms returned sat
[2024-05-31 04:59:14] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 04:59:14] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2024-05-31 04:59:14] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 17 ms returned sat
[2024-05-31 04:59:15] [INFO ] After 1027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 04:59:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:59:15] [INFO ] After 202ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 04:59:15] [INFO ] Deduced a trap composed of 126 places in 184 ms of which 2 ms to minimize.
[2024-05-31 04:59:16] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 0 ms to minimize.
[2024-05-31 04:59:16] [INFO ] Deduced a trap composed of 126 places in 193 ms of which 0 ms to minimize.
[2024-05-31 04:59:16] [INFO ] Deduced a trap composed of 125 places in 183 ms of which 1 ms to minimize.
[2024-05-31 04:59:16] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 0 ms to minimize.
[2024-05-31 04:59:16] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 0 ms to minimize.
[2024-05-31 04:59:17] [INFO ] Deduced a trap composed of 142 places in 192 ms of which 2 ms to minimize.
[2024-05-31 04:59:17] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 1 ms to minimize.
[2024-05-31 04:59:17] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 0 ms to minimize.
[2024-05-31 04:59:18] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 1 ms to minimize.
[2024-05-31 04:59:18] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:59:18] [INFO ] Deduced a trap composed of 133 places in 195 ms of which 0 ms to minimize.
[2024-05-31 04:59:19] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 1 ms to minimize.
[2024-05-31 04:59:19] [INFO ] Deduced a trap composed of 121 places in 171 ms of which 1 ms to minimize.
[2024-05-31 04:59:19] [INFO ] Deduced a trap composed of 133 places in 179 ms of which 1 ms to minimize.
[2024-05-31 04:59:19] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 1 ms to minimize.
[2024-05-31 04:59:20] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 0 ms to minimize.
[2024-05-31 04:59:20] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 0 ms to minimize.
[2024-05-31 04:59:21] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 0 ms to minimize.
[2024-05-31 04:59:21] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 0 ms to minimize.
[2024-05-31 04:59:21] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 0 ms to minimize.
[2024-05-31 04:59:22] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 0 ms to minimize.
[2024-05-31 04:59:23] [INFO ] Deduced a trap composed of 133 places in 203 ms of which 1 ms to minimize.
[2024-05-31 04:59:23] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 1 ms to minimize.
[2024-05-31 04:59:23] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 1 ms to minimize.
[2024-05-31 04:59:24] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 1 ms to minimize.
[2024-05-31 04:59:26] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 1 ms to minimize.
[2024-05-31 04:59:27] [INFO ] Deduced a trap composed of 133 places in 185 ms of which 4 ms to minimize.
[2024-05-31 04:59:29] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 0 ms to minimize.
[2024-05-31 04:59:29] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 0 ms to minimize.
[2024-05-31 04:59:31] [INFO ] Deduced a trap composed of 123 places in 202 ms of which 0 ms to minimize.
[2024-05-31 04:59:32] [INFO ] Deduced a trap composed of 134 places in 179 ms of which 1 ms to minimize.
[2024-05-31 04:59:39] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 23412 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:59:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:59:39] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 27 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 412/412 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 26 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 04:59:39] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 04:59:39] [INFO ] Invariant cache hit.
[2024-05-31 04:59:39] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-31 04:59:39] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 04:59:39] [INFO ] Invariant cache hit.
[2024-05-31 04:59:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:59:43] [INFO ] Implicit Places using invariants and state equation in 3410 ms returned []
Implicit Place search using SMT with State Equation took 3976 ms to find 0 implicit places.
[2024-05-31 04:59:43] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 04:59:43] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 04:59:43] [INFO ] Invariant cache hit.
[2024-05-31 04:59:43] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4425 ms. Remains : 412/412 places, 578/578 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 412 transition count 574
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 412 transition count 573
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 411 transition count 573
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 411 transition count 568
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 406 transition count 568
Applied a total of 16 rules in 69 ms. Remains 406 /412 variables (removed 6) and now considering 568/578 (removed 10) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 568 rows 406 cols
[2024-05-31 04:59:43] [INFO ] Computed 77 invariants in 18 ms
[2024-05-31 04:59:43] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2024-05-31 04:59:43] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 23 ms returned sat
[2024-05-31 04:59:43] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 04:59:43] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2024-05-31 04:59:43] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 22 ms returned sat
[2024-05-31 04:59:44] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 04:59:45] [INFO ] Deduced a trap composed of 157 places in 199 ms of which 1 ms to minimize.
[2024-05-31 04:59:45] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 0 ms to minimize.
[2024-05-31 04:59:45] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 1 ms to minimize.
[2024-05-31 04:59:45] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 1 ms to minimize.
[2024-05-31 04:59:45] [INFO ] Deduced a trap composed of 147 places in 164 ms of which 0 ms to minimize.
[2024-05-31 04:59:46] [INFO ] Deduced a trap composed of 132 places in 182 ms of which 1 ms to minimize.
[2024-05-31 04:59:46] [INFO ] Deduced a trap composed of 130 places in 175 ms of which 0 ms to minimize.
[2024-05-31 04:59:46] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 0 ms to minimize.
[2024-05-31 04:59:47] [INFO ] Deduced a trap composed of 127 places in 187 ms of which 1 ms to minimize.
[2024-05-31 04:59:47] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 0 ms to minimize.
[2024-05-31 04:59:47] [INFO ] Deduced a trap composed of 120 places in 191 ms of which 0 ms to minimize.
[2024-05-31 04:59:47] [INFO ] Deduced a trap composed of 129 places in 154 ms of which 1 ms to minimize.
[2024-05-31 04:59:47] [INFO ] Deduced a trap composed of 132 places in 168 ms of which 1 ms to minimize.
[2024-05-31 04:59:48] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 0 ms to minimize.
[2024-05-31 04:59:49] [INFO ] Deduced a trap composed of 132 places in 195 ms of which 0 ms to minimize.
[2024-05-31 04:59:49] [INFO ] Deduced a trap composed of 129 places in 205 ms of which 0 ms to minimize.
[2024-05-31 04:59:50] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 0 ms to minimize.
[2024-05-31 04:59:50] [INFO ] Deduced a trap composed of 132 places in 156 ms of which 1 ms to minimize.
[2024-05-31 04:59:50] [INFO ] Deduced a trap composed of 120 places in 167 ms of which 0 ms to minimize.
[2024-05-31 04:59:50] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 0 ms to minimize.
[2024-05-31 04:59:51] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 0 ms to minimize.
[2024-05-31 04:59:52] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 0 ms to minimize.
[2024-05-31 04:59:52] [INFO ] Deduced a trap composed of 129 places in 167 ms of which 0 ms to minimize.
[2024-05-31 04:59:53] [INFO ] Deduced a trap composed of 126 places in 188 ms of which 1 ms to minimize.
[2024-05-31 04:59:55] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 0 ms to minimize.
[2024-05-31 04:59:56] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 1 ms to minimize.
[2024-05-31 04:59:59] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 1 ms to minimize.
[2024-05-31 04:59:59] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 1 ms to minimize.
[2024-05-31 05:00:00] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 0 ms to minimize.
[2024-05-31 05:00:04] [INFO ] Deduced a trap composed of 142 places in 189 ms of which 0 ms to minimize.
[2024-05-31 05:00:05] [INFO ] Deduced a trap composed of 133 places in 201 ms of which 0 ms to minimize.
[2024-05-31 05:00:08] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 1 ms to minimize.
[2024-05-31 05:00:08] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 0 ms to minimize.
[2024-05-31 05:00:10] [INFO ] Deduced a trap composed of 141 places in 199 ms of which 1 ms to minimize.
[2024-05-31 05:00:13] [INFO ] Deduced a trap composed of 123 places in 186 ms of which 1 ms to minimize.
[2024-05-31 05:00:14] [INFO ] Deduced a trap composed of 126 places in 199 ms of which 1 ms to minimize.
[2024-05-31 05:00:17] [INFO ] Deduced a trap composed of 141 places in 198 ms of which 1 ms to minimize.
[2024-05-31 05:00:18] [INFO ] Deduced a trap composed of 135 places in 189 ms of which 1 ms to minimize.
[2024-05-31 05:00:18] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 1 ms to minimize.
[2024-05-31 05:00:19] [INFO ] Deduced a trap composed of 129 places in 198 ms of which 0 ms to minimize.
[2024-05-31 05:00:19] [INFO ] Deduced a trap composed of 126 places in 163 ms of which 1 ms to minimize.
[2024-05-31 05:00:20] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 1 ms to minimize.
[2024-05-31 05:00:22] [INFO ] Deduced a trap composed of 132 places in 201 ms of which 1 ms to minimize.
[2024-05-31 05:00:24] [INFO ] Deduced a trap composed of 126 places in 205 ms of which 1 ms to minimize.
[2024-05-31 05:00:25] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 1 ms to minimize.
[2024-05-31 05:00:27] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 1 ms to minimize.
[2024-05-31 05:00:33] [INFO ] Deduced a trap composed of 117 places in 180 ms of which 1 ms to minimize.
[2024-05-31 05:00:42] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 57614 ms
[2024-05-31 05:00:44] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 1 ms to minimize.
[2024-05-31 05:00:44] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 0 ms to minimize.
[2024-05-31 05:00:45] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 0 ms to minimize.
[2024-05-31 05:00:54] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 9888 ms
[2024-05-31 05:00:54] [INFO ] After 70447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 05:00:54] [INFO ] After 70575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 2222 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 484 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 144 place count 412 transition count 578
Applied a total of 144 rules in 47 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2024-05-31 05:00:56] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 05:00:56] [INFO ] Computed 77 invariants in 7 ms
[2024-05-31 05:00:57] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
[2024-05-31 05:00:57] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:00:57] [INFO ] Invariant cache hit.
[2024-05-31 05:00:58] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-05-31 05:00:58] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:00:58] [INFO ] Invariant cache hit.
[2024-05-31 05:00:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:01:03] [INFO ] Implicit Places using invariants and state equation in 5432 ms returned []
Implicit Place search using SMT with State Equation took 6270 ms to find 0 implicit places.
[2024-05-31 05:01:03] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 05:01:03] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:01:03] [INFO ] Invariant cache hit.
[2024-05-31 05:01:08] [INFO ] Dead Transitions using invariants and state equation in 4946 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11838 ms. Remains : 412/484 places, 578/650 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
Finished random walk after 54 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6565 reset in 509 ms.
Product exploration explored 100000 steps with 6534 reset in 570 ms.
Built C files in :
/tmp/ltsmin6715934712896957574
[2024-05-31 05:01:10] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2024-05-31 05:01:10] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:01:10] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2024-05-31 05:01:10] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:01:10] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2024-05-31 05:01:10] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:01:10] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6715934712896957574
Running compilation step : cd /tmp/ltsmin6715934712896957574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1579 ms.
Running link step : cd /tmp/ltsmin6715934712896957574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin6715934712896957574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9930944024724924771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 578/578 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 412 transition count 577
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 411 transition count 577
Applied a total of 2 rules in 23 ms. Remains 411 /412 variables (removed 1) and now considering 577/578 (removed 1) transitions.
[2024-05-31 05:01:25] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 05:01:25] [INFO ] Computed 77 invariants in 9 ms
[2024-05-31 05:01:26] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
[2024-05-31 05:01:26] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:01:26] [INFO ] Invariant cache hit.
[2024-05-31 05:01:26] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-31 05:01:26] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:01:26] [INFO ] Invariant cache hit.
[2024-05-31 05:01:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:01:30] [INFO ] Implicit Places using invariants and state equation in 3498 ms returned []
Implicit Place search using SMT with State Equation took 3891 ms to find 0 implicit places.
[2024-05-31 05:01:30] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 05:01:30] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:01:30] [INFO ] Invariant cache hit.
[2024-05-31 05:01:30] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/412 places, 577/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4859 ms. Remains : 411/412 places, 577/578 transitions.
Built C files in :
/tmp/ltsmin1530046685510885377
[2024-05-31 05:01:30] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2024-05-31 05:01:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:01:30] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2024-05-31 05:01:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:01:30] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2024-05-31 05:01:30] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:01:30] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1530046685510885377
Running compilation step : cd /tmp/ltsmin1530046685510885377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1789 ms.
Running link step : cd /tmp/ltsmin1530046685510885377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1530046685510885377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15781303624749477862.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:01:45] [INFO ] Flatten gal took : 50 ms
[2024-05-31 05:01:45] [INFO ] Flatten gal took : 45 ms
[2024-05-31 05:01:45] [INFO ] Time to serialize gal into /tmp/LTL15888396008803391883.gal : 7 ms
[2024-05-31 05:01:45] [INFO ] Time to serialize properties into /tmp/LTL7841673255934053235.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15888396008803391883.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13354178514390046721.hoa' '-atoms' '/tmp/LTL7841673255934053235.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7841673255934053235.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13354178514390046721.hoa
Detected timeout of ITS tools.
[2024-05-31 05:02:00] [INFO ] Flatten gal took : 26 ms
[2024-05-31 05:02:00] [INFO ] Flatten gal took : 26 ms
[2024-05-31 05:02:00] [INFO ] Time to serialize gal into /tmp/LTL16022586352246196692.gal : 8 ms
[2024-05-31 05:02:00] [INFO ] Time to serialize properties into /tmp/LTL9668249768337055986.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16022586352246196692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9668249768337055986.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((("(place_523_1<4)")&&(X("(Perform_Work_E_1<1)")))||(("(Perform_Work_E_1<1)")&&(G("((cJobCnt<10)||(place_782_1<1))")))))))
Formula 0 simplified : FG((!"(place_523_1<4)" | X!"(Perform_Work_E_1<1)") & (!"(Perform_Work_E_1<1)" | F!"((cJobCnt<10)||(place_782_1<1))"))
Detected timeout of ITS tools.
[2024-05-31 05:02:16] [INFO ] Flatten gal took : 51 ms
[2024-05-31 05:02:16] [INFO ] Applying decomposition
[2024-05-31 05:02:16] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17182653309448466041.txt' '-o' '/tmp/graph17182653309448466041.bin' '-w' '/tmp/graph17182653309448466041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17182653309448466041.bin' '-l' '-1' '-v' '-w' '/tmp/graph17182653309448466041.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:02:16] [INFO ] Decomposing Gal with order
[2024-05-31 05:02:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:02:16] [INFO ] Removed a total of 544 redundant transitions.
[2024-05-31 05:02:16] [INFO ] Flatten gal took : 150 ms
[2024-05-31 05:02:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 245 labels/synchronizations in 28 ms.
[2024-05-31 05:02:16] [INFO ] Time to serialize gal into /tmp/LTL4311325441471974044.gal : 19 ms
[2024-05-31 05:02:16] [INFO ] Time to serialize properties into /tmp/LTL2084752359953157729.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4311325441471974044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2084752359953157729.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((("(i23.u9.place_523_1<4)")&&(X("(i5.u7.Perform_Work_E_1<1)")))||(("(i5.u7.Perform_Work_E_1<1)")&&(G("((u1.cJobCnt<10)||(i23.u3...180
Formula 0 simplified : FG((!"(i23.u9.place_523_1<4)" | X!"(i5.u7.Perform_Work_E_1<1)") & (!"(i5.u7.Perform_Work_E_1<1)" | F!"((u1.cJobCnt<10)||(i23.u35.pla...170
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3343290706487710307
[2024-05-31 05:02:31] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3343290706487710307
Running compilation step : cd /tmp/ltsmin3343290706487710307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1282 ms.
Running link step : cd /tmp/ltsmin3343290706487710307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3343290706487710307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp0==true)&&X((LTLAPp1==true)))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-05 finished in 251061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 28 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 05:02:46] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-31 05:02:46] [INFO ] Computed 77 invariants in 29 ms
[2024-05-31 05:02:47] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
[2024-05-31 05:02:47] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:02:47] [INFO ] Invariant cache hit.
[2024-05-31 05:02:48] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-31 05:02:48] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:02:48] [INFO ] Invariant cache hit.
[2024-05-31 05:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:02:52] [INFO ] Implicit Places using invariants and state equation in 4180 ms returned []
Implicit Place search using SMT with State Equation took 4856 ms to find 0 implicit places.
[2024-05-31 05:02:52] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:02:52] [INFO ] Invariant cache hit.
[2024-05-31 05:02:53] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6253 ms. Remains : 483/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s426 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][false, false]]
Product exploration explored 100000 steps with 14814 reset in 300 ms.
Product exploration explored 100000 steps with 14806 reset in 328 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-31 05:02:54] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:02:54] [INFO ] Invariant cache hit.
[2024-05-31 05:02:54] [INFO ] [Real]Absence check using 59 positive place invariants in 23 ms returned sat
[2024-05-31 05:02:54] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 51 ms returned sat
[2024-05-31 05:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:02:55] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2024-05-31 05:02:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:02:55] [INFO ] [Nat]Absence check using 59 positive place invariants in 26 ms returned sat
[2024-05-31 05:02:55] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 63 ms returned sat
[2024-05-31 05:02:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:02:57] [INFO ] [Nat]Absence check using state equation in 2044 ms returned sat
[2024-05-31 05:02:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:02:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2024-05-31 05:02:57] [INFO ] Computed and/alt/rep : 354/814/354 causal constraints (skipped 285 transitions) in 74 ms.
[2024-05-31 05:02:58] [INFO ] Added : 30 causal constraints over 6 iterations in 492 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 483 transition count 615
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 70 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 138 place count 414 transition count 580
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 411 transition count 577
Applied a total of 144 rules in 55 ms. Remains 411 /483 variables (removed 72) and now considering 577/649 (removed 72) transitions.
[2024-05-31 05:02:58] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 05:02:58] [INFO ] Computed 77 invariants in 10 ms
[2024-05-31 05:02:58] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
[2024-05-31 05:02:58] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:02:58] [INFO ] Invariant cache hit.
[2024-05-31 05:02:59] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-31 05:02:59] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:02:59] [INFO ] Invariant cache hit.
[2024-05-31 05:02:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:03:03] [INFO ] Implicit Places using invariants and state equation in 3778 ms returned []
Implicit Place search using SMT with State Equation took 4278 ms to find 0 implicit places.
[2024-05-31 05:03:03] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 05:03:03] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:03:03] [INFO ] Invariant cache hit.
[2024-05-31 05:03:03] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/483 places, 577/649 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5335 ms. Remains : 411/483 places, 577/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
[2024-05-31 05:03:04] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:03:04] [INFO ] Invariant cache hit.
[2024-05-31 05:03:04] [INFO ] [Real]Absence check using 59 positive place invariants in 16 ms returned sat
[2024-05-31 05:03:04] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 63 ms returned sat
[2024-05-31 05:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:03:04] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-05-31 05:03:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:03:04] [INFO ] [Nat]Absence check using 59 positive place invariants in 19 ms returned sat
[2024-05-31 05:03:04] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 20 ms returned sat
[2024-05-31 05:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:03:05] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2024-05-31 05:03:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:03:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2024-05-31 05:03:05] [INFO ] Computed and/alt/rep : 282/977/282 causal constraints (skipped 285 transitions) in 42 ms.
[2024-05-31 05:03:05] [INFO ] Added : 18 causal constraints over 4 iterations in 285 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22162 reset in 467 ms.
Product exploration explored 100000 steps with 22220 reset in 512 ms.
Built C files in :
/tmp/ltsmin11910584664853195861
[2024-05-31 05:03:06] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2024-05-31 05:03:06] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:03:06] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2024-05-31 05:03:06] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:03:06] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2024-05-31 05:03:06] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:03:06] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11910584664853195861
Running compilation step : cd /tmp/ltsmin11910584664853195861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1740 ms.
Running link step : cd /tmp/ltsmin11910584664853195861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin11910584664853195861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15881000677282593339.hoa' '--buchi-type=spotba'
LTSmin run took 5176 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-06 finished in 27126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 33 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 448 transition count 579
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 413 transition count 579
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 412 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 412 transition count 578
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 410 transition count 576
Applied a total of 148 rules in 37 ms. Remains 410 /489 variables (removed 79) and now considering 576/650 (removed 74) transitions.
[2024-05-31 05:03:13] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2024-05-31 05:03:13] [INFO ] Computed 77 invariants in 14 ms
[2024-05-31 05:03:14] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
[2024-05-31 05:03:14] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 05:03:14] [INFO ] Invariant cache hit.
[2024-05-31 05:03:14] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-31 05:03:14] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 05:03:14] [INFO ] Invariant cache hit.
[2024-05-31 05:03:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:03:19] [INFO ] Implicit Places using invariants and state equation in 4604 ms returned []
Implicit Place search using SMT with State Equation took 5159 ms to find 0 implicit places.
[2024-05-31 05:03:19] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 05:03:19] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 05:03:19] [INFO ] Invariant cache hit.
[2024-05-31 05:03:19] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 410/489 places, 576/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6127 ms. Remains : 410/489 places, 576/650 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s90 1) (GEQ s100 1) (GEQ s221 1)) (AND (GEQ s90 1) (GEQ s221 1) (GEQ s265 1)) (AND (GEQ s90 1) (GEQ s104 1) (GEQ s221 1)) (AND (GEQ s90 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-07 finished in 6187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((p1 U p2)||X(p3)))||p0)))'
Support contains 5 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Applied a total of 5 rules in 8 ms. Remains 484 /489 variables (removed 5) and now considering 650/650 (removed 0) transitions.
[2024-05-31 05:03:20] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2024-05-31 05:03:20] [INFO ] Computed 77 invariants in 11 ms
[2024-05-31 05:03:20] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
[2024-05-31 05:03:20] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 05:03:20] [INFO ] Invariant cache hit.
[2024-05-31 05:03:21] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-31 05:03:21] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 05:03:21] [INFO ] Invariant cache hit.
[2024-05-31 05:03:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:03:25] [INFO ] Implicit Places using invariants and state equation in 4481 ms returned []
Implicit Place search using SMT with State Equation took 4940 ms to find 0 implicit places.
[2024-05-31 05:03:25] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 05:03:25] [INFO ] Invariant cache hit.
[2024-05-31 05:03:26] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/489 places, 650/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6383 ms. Remains : 484/489 places, 650/650 transitions.
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(OR (GEQ s217 1) (GEQ s450 1)), p3:(GEQ s450 1), p2:(AND (GEQ s197 1) (GEQ s270 1)), p1:(GEQ s357 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-08 finished in 6762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U (p2||G(!p1)))||p0)))'
Support contains 5 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 485 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 484 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 484 transition count 649
Applied a total of 6 rules in 30 ms. Remains 484 /489 variables (removed 5) and now considering 649/650 (removed 1) transitions.
[2024-05-31 05:03:26] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 484 cols
[2024-05-31 05:03:26] [INFO ] Computed 78 invariants in 11 ms
[2024-05-31 05:03:27] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
[2024-05-31 05:03:27] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:27] [INFO ] Invariant cache hit.
[2024-05-31 05:03:28] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-31 05:03:28] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:28] [INFO ] Invariant cache hit.
[2024-05-31 05:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:03:32] [INFO ] Implicit Places using invariants and state equation in 4224 ms returned []
Implicit Place search using SMT with State Equation took 4784 ms to find 0 implicit places.
[2024-05-31 05:03:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:32] [INFO ] Invariant cache hit.
[2024-05-31 05:03:32] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6180 ms. Remains : 484/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 206 ms :[p1, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), true]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GEQ s25 1) (GEQ s77 1) (GEQ s366 1) (GEQ s440 1)), p2:(GEQ s282 1), p0:(OR (LT s25 1) (LT s77 1) (LT s366 1) (LT s440 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 1213 steps with 306 reset in 11 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-09 finished in 6423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(p0)))||G(!p0)))'
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 22 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 05:03:33] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-31 05:03:33] [INFO ] Computed 77 invariants in 10 ms
[2024-05-31 05:03:33] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
[2024-05-31 05:03:33] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:33] [INFO ] Invariant cache hit.
[2024-05-31 05:03:34] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-31 05:03:34] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:34] [INFO ] Invariant cache hit.
[2024-05-31 05:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:03:39] [INFO ] Implicit Places using invariants and state equation in 5522 ms returned []
Implicit Place search using SMT with State Equation took 5973 ms to find 0 implicit places.
[2024-05-31 05:03:39] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:39] [INFO ] Invariant cache hit.
[2024-05-31 05:03:40] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7488 ms. Remains : 483/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 1416 ms :[(NOT p0), false, true, (NOT p0), false, p0]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 3}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=4, aps=[p0:(OR (LT s197 10) (LT s464 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 3 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-12 finished in 8931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 19 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 05:03:42] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:42] [INFO ] Invariant cache hit.
[2024-05-31 05:03:42] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
[2024-05-31 05:03:42] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:42] [INFO ] Invariant cache hit.
[2024-05-31 05:03:43] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-31 05:03:43] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:43] [INFO ] Invariant cache hit.
[2024-05-31 05:03:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:03:47] [INFO ] Implicit Places using invariants and state equation in 4313 ms returned []
Implicit Place search using SMT with State Equation took 4772 ms to find 0 implicit places.
[2024-05-31 05:03:47] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 05:03:47] [INFO ] Invariant cache hit.
[2024-05-31 05:03:48] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6390 ms. Remains : 483/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-13 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:(LT s230 3)], 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 650 steps with 48 reset in 3 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-13 finished in 6524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 449 transition count 581
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 415 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 414 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 46 ms. Remains 412 /489 variables (removed 77) and now considering 578/650 (removed 72) transitions.
[2024-05-31 05:03:48] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 05:03:48] [INFO ] Computed 77 invariants in 7 ms
[2024-05-31 05:03:49] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
[2024-05-31 05:03:49] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:03:49] [INFO ] Invariant cache hit.
[2024-05-31 05:03:49] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-31 05:03:49] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:03:49] [INFO ] Invariant cache hit.
[2024-05-31 05:03:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:03:53] [INFO ] Implicit Places using invariants and state equation in 4094 ms returned []
Implicit Place search using SMT with State Equation took 4536 ms to find 0 implicit places.
[2024-05-31 05:03:53] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-31 05:03:53] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:03:53] [INFO ] Invariant cache hit.
[2024-05-31 05:03:54] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/489 places, 578/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5480 ms. Remains : 412/489 places, 578/650 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s68 9) (LT s281 1) (LT s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5016 reset in 436 ms.
Product exploration explored 100000 steps with 4942 reset in 436 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 983 steps, including 48 resets, run visited all 1 properties in 11 ms. (steps per millisecond=89 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Support contains 3 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 26 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 05:03:55] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:03:55] [INFO ] Invariant cache hit.
[2024-05-31 05:03:55] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
[2024-05-31 05:03:55] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:03:55] [INFO ] Invariant cache hit.
[2024-05-31 05:03:56] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-31 05:03:56] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:03:56] [INFO ] Invariant cache hit.
[2024-05-31 05:03:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:04:00] [INFO ] Implicit Places using invariants and state equation in 4093 ms returned []
Implicit Place search using SMT with State Equation took 4680 ms to find 0 implicit places.
[2024-05-31 05:04:00] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 05:04:00] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:04:00] [INFO ] Invariant cache hit.
[2024-05-31 05:04:01] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5685 ms. Remains : 412/412 places, 578/578 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 1006 steps, including 50 resets, run visited all 1 properties in 8 ms. (steps per millisecond=125 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4875 reset in 565 ms.
Product exploration explored 100000 steps with 4909 reset in 456 ms.
Built C files in :
/tmp/ltsmin15205281234410482327
[2024-05-31 05:04:02] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2024-05-31 05:04:02] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:04:02] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2024-05-31 05:04:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:04:02] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2024-05-31 05:04:02] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:04:02] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15205281234410482327
Running compilation step : cd /tmp/ltsmin15205281234410482327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2083 ms.
Running link step : cd /tmp/ltsmin15205281234410482327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin15205281234410482327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15453820846601516362.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 15 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 05:04:17] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:04:17] [INFO ] Invariant cache hit.
[2024-05-31 05:04:18] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
[2024-05-31 05:04:18] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:04:18] [INFO ] Invariant cache hit.
[2024-05-31 05:04:18] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-31 05:04:18] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:04:18] [INFO ] Invariant cache hit.
[2024-05-31 05:04:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:04:22] [INFO ] Implicit Places using invariants and state equation in 3710 ms returned []
Implicit Place search using SMT with State Equation took 4095 ms to find 0 implicit places.
[2024-05-31 05:04:22] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 05:04:22] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:04:22] [INFO ] Invariant cache hit.
[2024-05-31 05:04:22] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4946 ms. Remains : 412/412 places, 578/578 transitions.
Built C files in :
/tmp/ltsmin5159982570956038358
[2024-05-31 05:04:22] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2024-05-31 05:04:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:04:22] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2024-05-31 05:04:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:04:22] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2024-05-31 05:04:22] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:04:22] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5159982570956038358
Running compilation step : cd /tmp/ltsmin5159982570956038358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1630 ms.
Running link step : cd /tmp/ltsmin5159982570956038358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin5159982570956038358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4058601613706310141.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:04:37] [INFO ] Flatten gal took : 21 ms
[2024-05-31 05:04:37] [INFO ] Flatten gal took : 20 ms
[2024-05-31 05:04:37] [INFO ] Time to serialize gal into /tmp/LTL3397328472611607882.gal : 4 ms
[2024-05-31 05:04:37] [INFO ] Time to serialize properties into /tmp/LTL3811561814259992853.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3397328472611607882.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8238047560975242063.hoa' '-atoms' '/tmp/LTL3811561814259992853.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3811561814259992853.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8238047560975242063.hoa
Detected timeout of ITS tools.
[2024-05-31 05:04:53] [INFO ] Flatten gal took : 43 ms
[2024-05-31 05:04:53] [INFO ] Flatten gal took : 33 ms
[2024-05-31 05:04:53] [INFO ] Time to serialize gal into /tmp/LTL16556873090581404721.gal : 7 ms
[2024-05-31 05:04:53] [INFO ] Time to serialize properties into /tmp/LTL7925280502619707629.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16556873090581404721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7925280502619707629.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((cSources<9)||(ModifiedSrc_2<1))||(place_500_1<1))"))))
Formula 0 simplified : GF!"(((cSources<9)||(ModifiedSrc_2<1))||(place_500_1<1))"
Detected timeout of ITS tools.
[2024-05-31 05:05:08] [INFO ] Flatten gal took : 19 ms
[2024-05-31 05:05:08] [INFO ] Applying decomposition
[2024-05-31 05:05:08] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7060784984083330334.txt' '-o' '/tmp/graph7060784984083330334.bin' '-w' '/tmp/graph7060784984083330334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7060784984083330334.bin' '-l' '-1' '-v' '-w' '/tmp/graph7060784984083330334.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:05:08] [INFO ] Decomposing Gal with order
[2024-05-31 05:05:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:05:08] [INFO ] Removed a total of 544 redundant transitions.
[2024-05-31 05:05:08] [INFO ] Flatten gal took : 95 ms
[2024-05-31 05:05:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 22 ms.
[2024-05-31 05:05:08] [INFO ] Time to serialize gal into /tmp/LTL7163201310293227435.gal : 8 ms
[2024-05-31 05:05:08] [INFO ] Time to serialize properties into /tmp/LTL13362813071370264620.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7163201310293227435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13362813071370264620.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i1.u8.cSources<9)||(i1.u8.ModifiedSrc_2<1))||(i1.u8.place_500_1<1))"))))
Formula 0 simplified : GF!"(((i1.u8.cSources<9)||(i1.u8.ModifiedSrc_2<1))||(i1.u8.place_500_1<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3696937281547087134
[2024-05-31 05:05:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3696937281547087134
Running compilation step : cd /tmp/ltsmin3696937281547087134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1113 ms.
Running link step : cd /tmp/ltsmin3696937281547087134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3696937281547087134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 PolyORBNT-PT-S05J30-LTLFireability-14 finished in 109958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(p1))||(p1&&G(p2))))))'
Found a Shortening insensitive property : PolyORBNT-PT-S05J30-LTLFireability-05
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 144 place count 412 transition count 578
Applied a total of 144 rules in 28 ms. Remains 412 /489 variables (removed 77) and now considering 578/650 (removed 72) transitions.
[2024-05-31 05:05:39] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 05:05:39] [INFO ] Computed 77 invariants in 7 ms
[2024-05-31 05:05:39] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
[2024-05-31 05:05:39] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:05:39] [INFO ] Invariant cache hit.
[2024-05-31 05:05:39] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-31 05:05:39] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:05:39] [INFO ] Invariant cache hit.
[2024-05-31 05:05:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:05:43] [INFO ] Implicit Places using invariants and state equation in 3210 ms returned []
Implicit Place search using SMT with State Equation took 3670 ms to find 0 implicit places.
[2024-05-31 05:05:43] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:05:43] [INFO ] Invariant cache hit.
[2024-05-31 05:05:43] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 412/489 places, 578/650 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4456 ms. Remains : 412/489 places, 578/650 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s7 4), p1:(LT s185 1), p2:(OR (LT s169 10) (LT s395 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11640 reset in 344 ms.
Product exploration explored 100000 steps with 11838 reset in 351 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
Knowledge based reduction with 15 factoid took 1048 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 579 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-31 05:05:46] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:05:46] [INFO ] Invariant cache hit.
[2024-05-31 05:05:46] [INFO ] [Real]Absence check using 58 positive place invariants in 8 ms returned sat
[2024-05-31 05:05:46] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 17 ms returned sat
[2024-05-31 05:05:46] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2024-05-31 05:05:46] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2024-05-31 05:05:46] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 18 ms returned sat
[2024-05-31 05:05:47] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2024-05-31 05:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:05:47] [INFO ] After 281ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :6 sat :2
[2024-05-31 05:05:48] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 1 ms to minimize.
[2024-05-31 05:05:48] [INFO ] Deduced a trap composed of 124 places in 156 ms of which 0 ms to minimize.
[2024-05-31 05:05:48] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 0 ms to minimize.
[2024-05-31 05:05:48] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 1 ms to minimize.
[2024-05-31 05:05:48] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 1 ms to minimize.
[2024-05-31 05:05:49] [INFO ] Deduced a trap composed of 129 places in 137 ms of which 1 ms to minimize.
[2024-05-31 05:05:49] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 0 ms to minimize.
[2024-05-31 05:05:49] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 1 ms to minimize.
[2024-05-31 05:05:49] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 1 ms to minimize.
[2024-05-31 05:05:49] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 1 ms to minimize.
[2024-05-31 05:05:50] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 0 ms to minimize.
[2024-05-31 05:05:50] [INFO ] Deduced a trap composed of 121 places in 188 ms of which 0 ms to minimize.
[2024-05-31 05:05:51] [INFO ] Deduced a trap composed of 130 places in 185 ms of which 0 ms to minimize.
[2024-05-31 05:05:51] [INFO ] Deduced a trap composed of 133 places in 415 ms of which 0 ms to minimize.
[2024-05-31 05:05:54] [INFO ] Deduced a trap composed of 132 places in 149 ms of which 0 ms to minimize.
[2024-05-31 05:05:55] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 1 ms to minimize.
[2024-05-31 05:05:56] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 1 ms to minimize.
[2024-05-31 05:05:57] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 1 ms to minimize.
[2024-05-31 05:05:59] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 0 ms to minimize.
[2024-05-31 05:06:00] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 1 ms to minimize.
[2024-05-31 05:06:01] [INFO ] Deduced a trap composed of 146 places in 170 ms of which 0 ms to minimize.
[2024-05-31 05:06:01] [INFO ] Deduced a trap composed of 134 places in 283 ms of which 1 ms to minimize.
[2024-05-31 05:06:03] [INFO ] Deduced a trap composed of 127 places in 188 ms of which 0 ms to minimize.
[2024-05-31 05:06:04] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 0 ms to minimize.
[2024-05-31 05:06:05] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 1 ms to minimize.
[2024-05-31 05:06:05] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 0 ms to minimize.
[2024-05-31 05:06:08] [INFO ] Deduced a trap composed of 143 places in 173 ms of which 0 ms to minimize.
[2024-05-31 05:06:09] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2024-05-31 05:06:09] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 0 ms to minimize.
[2024-05-31 05:06:09] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 1 ms to minimize.
[2024-05-31 05:06:10] [INFO ] Deduced a trap composed of 133 places in 133 ms of which 2 ms to minimize.
[2024-05-31 05:06:10] [INFO ] Deduced a trap composed of 127 places in 132 ms of which 0 ms to minimize.
[2024-05-31 05:06:10] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 1 ms to minimize.
[2024-05-31 05:06:11] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 23661 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 05:06:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 05:06:11] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:5
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 26 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 05:06:11] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:06:11] [INFO ] Invariant cache hit.
[2024-05-31 05:06:12] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 412/412 places, 578/578 transitions.
Incomplete random walk after 10000 steps, including 556 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 289345 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289345 steps, saw 85977 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 05:06:15] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:06:15] [INFO ] Invariant cache hit.
[2024-05-31 05:06:15] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2024-05-31 05:06:15] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 45 ms returned sat
[2024-05-31 05:06:15] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 05:06:15] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2024-05-31 05:06:15] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 22 ms returned sat
[2024-05-31 05:06:16] [INFO ] After 1067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 05:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:06:16] [INFO ] After 177ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 05:06:17] [INFO ] Deduced a trap composed of 126 places in 172 ms of which 0 ms to minimize.
[2024-05-31 05:06:17] [INFO ] Deduced a trap composed of 127 places in 180 ms of which 1 ms to minimize.
[2024-05-31 05:06:17] [INFO ] Deduced a trap composed of 126 places in 155 ms of which 0 ms to minimize.
[2024-05-31 05:06:17] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 0 ms to minimize.
[2024-05-31 05:06:18] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 1 ms to minimize.
[2024-05-31 05:06:18] [INFO ] Deduced a trap composed of 143 places in 106 ms of which 0 ms to minimize.
[2024-05-31 05:06:18] [INFO ] Deduced a trap composed of 142 places in 152 ms of which 0 ms to minimize.
[2024-05-31 05:06:18] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2024-05-31 05:06:18] [INFO ] Deduced a trap composed of 115 places in 135 ms of which 0 ms to minimize.
[2024-05-31 05:06:19] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 1 ms to minimize.
[2024-05-31 05:06:19] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 0 ms to minimize.
[2024-05-31 05:06:19] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 1 ms to minimize.
[2024-05-31 05:06:19] [INFO ] Deduced a trap composed of 139 places in 117 ms of which 1 ms to minimize.
[2024-05-31 05:06:20] [INFO ] Deduced a trap composed of 121 places in 148 ms of which 0 ms to minimize.
[2024-05-31 05:06:20] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 0 ms to minimize.
[2024-05-31 05:06:20] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 1 ms to minimize.
[2024-05-31 05:06:20] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 1 ms to minimize.
[2024-05-31 05:06:21] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 0 ms to minimize.
[2024-05-31 05:06:21] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 0 ms to minimize.
[2024-05-31 05:06:22] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 1 ms to minimize.
[2024-05-31 05:06:22] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 0 ms to minimize.
[2024-05-31 05:06:23] [INFO ] Deduced a trap composed of 130 places in 164 ms of which 1 ms to minimize.
[2024-05-31 05:06:23] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 0 ms to minimize.
[2024-05-31 05:06:23] [INFO ] Deduced a trap composed of 132 places in 145 ms of which 0 ms to minimize.
[2024-05-31 05:06:23] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 1 ms to minimize.
[2024-05-31 05:06:24] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 0 ms to minimize.
[2024-05-31 05:06:27] [INFO ] Deduced a trap composed of 118 places in 173 ms of which 1 ms to minimize.
[2024-05-31 05:06:27] [INFO ] Deduced a trap composed of 133 places in 169 ms of which 1 ms to minimize.
[2024-05-31 05:06:29] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 0 ms to minimize.
[2024-05-31 05:06:29] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 1 ms to minimize.
[2024-05-31 05:06:31] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 0 ms to minimize.
[2024-05-31 05:06:33] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 0 ms to minimize.
[2024-05-31 05:06:40] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 23444 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 05:06:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 05:06:40] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 10 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 412/412 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 9 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 05:06:40] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:06:40] [INFO ] Invariant cache hit.
[2024-05-31 05:06:40] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-31 05:06:40] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:06:40] [INFO ] Invariant cache hit.
[2024-05-31 05:06:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:06:44] [INFO ] Implicit Places using invariants and state equation in 3190 ms returned []
Implicit Place search using SMT with State Equation took 3664 ms to find 0 implicit places.
[2024-05-31 05:06:44] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 05:06:44] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:06:44] [INFO ] Invariant cache hit.
[2024-05-31 05:06:44] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4123 ms. Remains : 412/412 places, 578/578 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 412 transition count 574
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 412 transition count 573
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 411 transition count 573
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 411 transition count 568
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 406 transition count 568
Applied a total of 16 rules in 31 ms. Remains 406 /412 variables (removed 6) and now considering 568/578 (removed 10) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 568 rows 406 cols
[2024-05-31 05:06:44] [INFO ] Computed 77 invariants in 5 ms
[2024-05-31 05:06:44] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2024-05-31 05:06:44] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 21 ms returned sat
[2024-05-31 05:06:44] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 05:06:44] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2024-05-31 05:06:44] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 26 ms returned sat
[2024-05-31 05:06:45] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 05:06:46] [INFO ] Deduced a trap composed of 157 places in 163 ms of which 0 ms to minimize.
[2024-05-31 05:06:46] [INFO ] Deduced a trap composed of 126 places in 143 ms of which 1 ms to minimize.
[2024-05-31 05:06:46] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 1 ms to minimize.
[2024-05-31 05:06:46] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 0 ms to minimize.
[2024-05-31 05:06:46] [INFO ] Deduced a trap composed of 147 places in 154 ms of which 0 ms to minimize.
[2024-05-31 05:06:46] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2024-05-31 05:06:47] [INFO ] Deduced a trap composed of 130 places in 133 ms of which 0 ms to minimize.
[2024-05-31 05:06:47] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 0 ms to minimize.
[2024-05-31 05:06:47] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 14 ms to minimize.
[2024-05-31 05:06:47] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2024-05-31 05:06:47] [INFO ] Deduced a trap composed of 120 places in 132 ms of which 0 ms to minimize.
[2024-05-31 05:06:48] [INFO ] Deduced a trap composed of 129 places in 135 ms of which 1 ms to minimize.
[2024-05-31 05:06:48] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 1 ms to minimize.
[2024-05-31 05:06:48] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 1 ms to minimize.
[2024-05-31 05:06:49] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 0 ms to minimize.
[2024-05-31 05:06:49] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 0 ms to minimize.
[2024-05-31 05:06:49] [INFO ] Deduced a trap composed of 141 places in 132 ms of which 1 ms to minimize.
[2024-05-31 05:06:50] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 0 ms to minimize.
[2024-05-31 05:06:50] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 1 ms to minimize.
[2024-05-31 05:06:50] [INFO ] Deduced a trap composed of 129 places in 165 ms of which 0 ms to minimize.
[2024-05-31 05:06:51] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 0 ms to minimize.
[2024-05-31 05:06:51] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 0 ms to minimize.
[2024-05-31 05:06:52] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 0 ms to minimize.
[2024-05-31 05:06:53] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 1 ms to minimize.
[2024-05-31 05:06:55] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 1 ms to minimize.
[2024-05-31 05:06:55] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 1 ms to minimize.
[2024-05-31 05:06:58] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 0 ms to minimize.
[2024-05-31 05:06:59] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 0 ms to minimize.
[2024-05-31 05:06:59] [INFO ] Deduced a trap composed of 141 places in 148 ms of which 0 ms to minimize.
[2024-05-31 05:07:03] [INFO ] Deduced a trap composed of 142 places in 139 ms of which 0 ms to minimize.
[2024-05-31 05:07:04] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 0 ms to minimize.
[2024-05-31 05:07:07] [INFO ] Deduced a trap composed of 132 places in 151 ms of which 1 ms to minimize.
[2024-05-31 05:07:07] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 0 ms to minimize.
[2024-05-31 05:07:09] [INFO ] Deduced a trap composed of 141 places in 145 ms of which 1 ms to minimize.
[2024-05-31 05:07:12] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 0 ms to minimize.
[2024-05-31 05:07:13] [INFO ] Deduced a trap composed of 126 places in 181 ms of which 0 ms to minimize.
[2024-05-31 05:07:16] [INFO ] Deduced a trap composed of 141 places in 123 ms of which 0 ms to minimize.
[2024-05-31 05:07:17] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 1 ms to minimize.
[2024-05-31 05:07:17] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 1 ms to minimize.
[2024-05-31 05:07:18] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 0 ms to minimize.
[2024-05-31 05:07:18] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 1 ms to minimize.
[2024-05-31 05:07:18] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 0 ms to minimize.
[2024-05-31 05:07:20] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 0 ms to minimize.
[2024-05-31 05:07:23] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 0 ms to minimize.
[2024-05-31 05:07:24] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 1 ms to minimize.
[2024-05-31 05:07:25] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 0 ms to minimize.
[2024-05-31 05:07:31] [INFO ] Deduced a trap composed of 117 places in 155 ms of which 0 ms to minimize.
[2024-05-31 05:07:40] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 54812 ms
[2024-05-31 05:07:43] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2024-05-31 05:07:44] [INFO ] Deduced a trap composed of 118 places in 192 ms of which 0 ms to minimize.
[2024-05-31 05:07:46] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 1 ms to minimize.
[2024-05-31 05:07:47] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 0 ms to minimize.
[2024-05-31 05:07:52] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 0 ms to minimize.
[2024-05-31 05:08:00] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 0 ms to minimize.
[2024-05-31 05:08:02] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 0 ms to minimize.
[2024-05-31 05:08:03] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 0 ms to minimize.
[2024-05-31 05:08:03] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 1 ms to minimize.
[2024-05-31 05:08:04] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 0 ms to minimize.
[2024-05-31 05:08:04] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 1 ms to minimize.
[2024-05-31 05:08:09] [INFO ] Deduced a trap composed of 133 places in 167 ms of which 1 ms to minimize.
[2024-05-31 05:08:12] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 0 ms to minimize.
[2024-05-31 05:08:14] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 1 ms to minimize.
[2024-05-31 05:08:14] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 0 ms to minimize.
[2024-05-31 05:08:21] [INFO ] Deduced a trap composed of 134 places in 185 ms of which 0 ms to minimize.
[2024-05-31 05:08:27] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 1 ms to minimize.
[2024-05-31 05:08:36] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 52695 ms
[2024-05-31 05:08:36] [INFO ] After 111497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 05:08:36] [INFO ] After 111624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 1945 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 412 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 12 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 05:08:38] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 05:08:38] [INFO ] Computed 77 invariants in 8 ms
[2024-05-31 05:08:39] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
[2024-05-31 05:08:39] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:08:39] [INFO ] Invariant cache hit.
[2024-05-31 05:08:39] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-31 05:08:39] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:08:39] [INFO ] Invariant cache hit.
[2024-05-31 05:08:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:08:43] [INFO ] Implicit Places using invariants and state equation in 3507 ms returned []
Implicit Place search using SMT with State Equation took 4013 ms to find 0 implicit places.
[2024-05-31 05:08:43] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 05:08:43] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 05:08:43] [INFO ] Invariant cache hit.
[2024-05-31 05:08:43] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4907 ms. Remains : 412/412 places, 578/578 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
Finished random walk after 62 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6578 reset in 337 ms.
Product exploration explored 100000 steps with 6599 reset in 540 ms.
Built C files in :
/tmp/ltsmin6682218958977191305
[2024-05-31 05:08:44] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2024-05-31 05:08:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:08:44] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2024-05-31 05:08:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:08:44] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2024-05-31 05:08:44] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:08:44] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6682218958977191305
Running compilation step : cd /tmp/ltsmin6682218958977191305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1587 ms.
Running link step : cd /tmp/ltsmin6682218958977191305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin6682218958977191305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4342519919929828257.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 578/578 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 412 transition count 577
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 411 transition count 577
Applied a total of 2 rules in 11 ms. Remains 411 /412 variables (removed 1) and now considering 577/578 (removed 1) transitions.
[2024-05-31 05:08:59] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 05:08:59] [INFO ] Computed 77 invariants in 6 ms
[2024-05-31 05:09:00] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
[2024-05-31 05:09:00] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:09:00] [INFO ] Invariant cache hit.
[2024-05-31 05:09:00] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-31 05:09:00] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:09:00] [INFO ] Invariant cache hit.
[2024-05-31 05:09:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:09:03] [INFO ] Implicit Places using invariants and state equation in 3142 ms returned []
Implicit Place search using SMT with State Equation took 3505 ms to find 0 implicit places.
[2024-05-31 05:09:03] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 05:09:03] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 05:09:03] [INFO ] Invariant cache hit.
[2024-05-31 05:09:04] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/412 places, 577/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4525 ms. Remains : 411/412 places, 577/578 transitions.
Built C files in :
/tmp/ltsmin14169509295145854249
[2024-05-31 05:09:04] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2024-05-31 05:09:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:09:04] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2024-05-31 05:09:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:09:04] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2024-05-31 05:09:04] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:09:04] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14169509295145854249
Running compilation step : cd /tmp/ltsmin14169509295145854249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1341 ms.
Running link step : cd /tmp/ltsmin14169509295145854249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14169509295145854249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14176226320020674422.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:09:19] [INFO ] Flatten gal took : 19 ms
[2024-05-31 05:09:19] [INFO ] Flatten gal took : 18 ms
[2024-05-31 05:09:19] [INFO ] Time to serialize gal into /tmp/LTL15536580403921402259.gal : 4 ms
[2024-05-31 05:09:19] [INFO ] Time to serialize properties into /tmp/LTL1719270783027814936.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15536580403921402259.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15083572705908892425.hoa' '-atoms' '/tmp/LTL1719270783027814936.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1719270783027814936.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15083572705908892425.hoa
Detected timeout of ITS tools.
[2024-05-31 05:09:34] [INFO ] Flatten gal took : 17 ms
[2024-05-31 05:09:34] [INFO ] Flatten gal took : 22 ms
[2024-05-31 05:09:34] [INFO ] Time to serialize gal into /tmp/LTL1962665540498340794.gal : 4 ms
[2024-05-31 05:09:34] [INFO ] Time to serialize properties into /tmp/LTL2749407273700257787.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1962665540498340794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2749407273700257787.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((("(place_523_1<4)")&&(X("(Perform_Work_E_1<1)")))||(("(Perform_Work_E_1<1)")&&(G("((cJobCnt<10)||(place_782_1<1))")))))))
Formula 0 simplified : FG((!"(place_523_1<4)" | X!"(Perform_Work_E_1<1)") & (!"(Perform_Work_E_1<1)" | F!"((cJobCnt<10)||(place_782_1<1))"))
Detected timeout of ITS tools.
[2024-05-31 05:09:49] [INFO ] Flatten gal took : 18 ms
[2024-05-31 05:09:49] [INFO ] Applying decomposition
[2024-05-31 05:09:49] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18258322056240229688.txt' '-o' '/tmp/graph18258322056240229688.bin' '-w' '/tmp/graph18258322056240229688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18258322056240229688.bin' '-l' '-1' '-v' '-w' '/tmp/graph18258322056240229688.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:09:49] [INFO ] Decomposing Gal with order
[2024-05-31 05:09:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:09:49] [INFO ] Removed a total of 544 redundant transitions.
[2024-05-31 05:09:50] [INFO ] Flatten gal took : 160 ms
[2024-05-31 05:09:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 33 ms.
[2024-05-31 05:09:50] [INFO ] Time to serialize gal into /tmp/LTL370988584332260589.gal : 6 ms
[2024-05-31 05:09:50] [INFO ] Time to serialize properties into /tmp/LTL14694979054771410896.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL370988584332260589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14694979054771410896.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((("(i17.u27.place_523_1<4)")&&(X("(i1.u2.Perform_Work_E_1<1)")))||(("(i1.u2.Perform_Work_E_1<1)")&&(G("((u0.cJobCnt<10)||(i17.u...181
Formula 0 simplified : FG((!"(i17.u27.place_523_1<4)" | X!"(i1.u2.Perform_Work_E_1<1)") & (!"(i1.u2.Perform_Work_E_1<1)" | F!"((u0.cJobCnt<10)||(i17.u16.pl...171
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6081527165915424057
[2024-05-31 05:10:05] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6081527165915424057
Running compilation step : cd /tmp/ltsmin6081527165915424057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 992 ms.
Running link step : cd /tmp/ltsmin6081527165915424057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6081527165915424057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp0==true)&&X((LTLAPp1==true)))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-05 finished in 281445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-31 05:10:20] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9648869523384688310
[2024-05-31 05:10:20] [INFO ] Computing symmetric may disable matrix : 650 transitions.
[2024-05-31 05:10:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:10:20] [INFO ] Computing symmetric may enable matrix : 650 transitions.
[2024-05-31 05:10:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:10:20] [INFO ] Applying decomposition
[2024-05-31 05:10:20] [INFO ] Flatten gal took : 60 ms
[2024-05-31 05:10:20] [INFO ] Computing Do-Not-Accords matrix : 650 transitions.
[2024-05-31 05:10:20] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:10:20] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9648869523384688310
Running compilation step : cd /tmp/ltsmin9648869523384688310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1126910007938148475.txt' '-o' '/tmp/graph1126910007938148475.bin' '-w' '/tmp/graph1126910007938148475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1126910007938148475.bin' '-l' '-1' '-v' '-w' '/tmp/graph1126910007938148475.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:10:20] [INFO ] Decomposing Gal with order
[2024-05-31 05:10:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:10:20] [INFO ] Removed a total of 809 redundant transitions.
[2024-05-31 05:10:20] [INFO ] Flatten gal took : 107 ms
[2024-05-31 05:10:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 191 labels/synchronizations in 12 ms.
[2024-05-31 05:10:20] [INFO ] Time to serialize gal into /tmp/LTLFireability13574839102558318090.gal : 6 ms
[2024-05-31 05:10:20] [INFO ] Time to serialize properties into /tmp/LTLFireability3273664447685810993.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13574839102558318090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3273664447685810993.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F(("((((((i16.u56.TheSour_1<1)||(i27.u60.cSources<1))||((i20.u46.DataOnSrc_1<1)||(i27.u61.CanInjectEvent<1)))&&(((i27.u60.cSource...615
Formula 0 simplified : G(F!"((i11.u0.cJobCnt<10)||(i7.u37.place_782_1<1))" & FG!"((((((i16.u56.TheSour_1<1)||(i27.u60.cSources<1))||((i20.u46.DataOnSrc_1<1...608
Compilation finished in 1995 ms.
Running link step : cd /tmp/ltsmin9648869523384688310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9648869523384688310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin9648869523384688310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9648869523384688310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp2==true)&&X((LTLAPp3==true)))||((LTLAPp3==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-31 05:35:40] [INFO ] Flatten gal took : 52 ms
[2024-05-31 05:35:40] [INFO ] Time to serialize gal into /tmp/LTLFireability4880923177961950376.gal : 3 ms
[2024-05-31 05:35:40] [INFO ] Time to serialize properties into /tmp/LTLFireability16962672761485639762.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4880923177961950376.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16962672761485639762.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((G(F(("((((((TheSour_1<1)||(cSources<1))||((DataOnSrc_1<1)||(CanInjectEvent<1)))&&(((cSources<1)||(DataOnSrc_3<1))||((TheSour_3<1)||...442
Formula 0 simplified : G(F!"((cJobCnt<10)||(place_782_1<1))" & FG!"((((((TheSour_1<1)||(cSources<1))||((DataOnSrc_1<1)||(CanInjectEvent<1)))&&(((cSources<1...435
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.133: LTL layer: formula: [](<>((((LTLAPp2==true)&&X((LTLAPp3==true)))||((LTLAPp3==true)&&[]((LTLAPp1==true))))))
pins2lts-mc-linux64( 1/ 8), 0.133: "[](<>((((LTLAPp2==true)&&X((LTLAPp3==true)))||((LTLAPp3==true)&&[]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.133: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.185: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.299: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.322: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.325: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.329: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.606: There are 656 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.606: State length is 490, there are 671 groups
pins2lts-mc-linux64( 0/ 8), 0.606: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.606: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.606: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.606: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.763: [Blue] ~30 levels ~960 states ~4384 transitions
pins2lts-mc-linux64( 4/ 8), 0.816: [Blue] ~30 levels ~1920 states ~6904 transitions
pins2lts-mc-linux64( 4/ 8), 0.959: [Blue] ~30 levels ~3840 states ~11032 transitions
pins2lts-mc-linux64( 4/ 8), 1.250: [Blue] ~30 levels ~7680 states ~20792 transitions
pins2lts-mc-linux64( 4/ 8), 1.856: [Blue] ~30 levels ~15360 states ~39056 transitions
pins2lts-mc-linux64( 6/ 8), 2.930: [Blue] ~30 levels ~30720 states ~76392 transitions
pins2lts-mc-linux64( 1/ 8), 4.999: [Blue] ~30 levels ~61440 states ~149536 transitions
pins2lts-mc-linux64( 6/ 8), 8.659: [Blue] ~30 levels ~122880 states ~298352 transitions
pins2lts-mc-linux64( 6/ 8), 15.066: [Blue] ~30 levels ~245760 states ~632344 transitions
pins2lts-mc-linux64( 0/ 8), 25.603: [Blue] ~30 levels ~491520 states ~1263648 transitions
pins2lts-mc-linux64( 4/ 8), 43.661: [Blue] ~30 levels ~983040 states ~2562384 transitions
pins2lts-mc-linux64( 4/ 8), 65.435: [Blue] ~30 levels ~1966080 states ~5182544 transitions
pins2lts-mc-linux64( 4/ 8), 97.749: [Blue] ~30 levels ~3932160 states ~10540256 transitions
pins2lts-mc-linux64( 4/ 8), 167.345: [Blue] ~30 levels ~7864320 states ~21696232 transitions
pins2lts-mc-linux64( 4/ 8), 272.657: [Blue] ~30 levels ~15728640 states ~43829904 transitions
pins2lts-mc-linux64( 3/ 8), 468.235: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 468.272:
pins2lts-mc-linux64( 0/ 8), 468.272: Explored 28773269 states 80462756 transitions, fanout: 2.796
pins2lts-mc-linux64( 0/ 8), 468.272: Total exploration time 467.650 sec (467.590 sec minimum, 467.615 sec on average)
pins2lts-mc-linux64( 0/ 8), 468.272: States per second: 61527, Transitions per second: 172058
pins2lts-mc-linux64( 0/ 8), 468.272:
pins2lts-mc-linux64( 0/ 8), 468.272: State space has 28775272 states, 14 are accepting
pins2lts-mc-linux64( 0/ 8), 468.272: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 468.272: blue states: 28773269 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 468.272: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 468.272: all-red states: 14 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 468.272:
pins2lts-mc-linux64( 0/ 8), 468.272: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 468.272:
pins2lts-mc-linux64( 0/ 8), 468.272: Queue width: 8B, total height: 240, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 468.272: Tree memory: 475.5MB, 17.3 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 468.272: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 468.272: Stored 670 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 468.272: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 468.272: Est. total memory use: 475.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9648869523384688310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp2==true)&&X((LTLAPp3==true)))||((LTLAPp3==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9648869523384688310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp2==true)&&X((LTLAPp3==true)))||((LTLAPp3==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 138812 kB
After kill :
MemTotal: 16393340 kB
MemFree: 12412816 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J30"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-PT-S05J30, 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 r307-tajo-171654460800283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J30.tgz
mv PolyORBNT-PT-S05J30 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 ;