About the Execution of 2023-gold for StigmergyCommit-PT-09b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16218.747 | 2946534.00 | 2135372.00 | 1158757.50 | ?F????T?F??????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r417-tall-171690555800133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is StigmergyCommit-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555800133
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 126M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 126M 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 StigmergyCommit-PT-09b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-09b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717119896956
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=StigmergyCommit-PT-09b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 01:45:01] [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 01:45:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 01:45:05] [INFO ] Load time of PNML (sax parser for PT used): 4134 ms
[2024-05-31 01:45:05] [INFO ] Transformed 3049 places.
[2024-05-31 01:45:05] [INFO ] Transformed 122340 transitions.
[2024-05-31 01:45:05] [INFO ] Found NUPN structural information;
[2024-05-31 01:45:05] [INFO ] Parsed PT model containing 3049 places and 122340 transitions and 2389246 arcs in 4819 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyCommit-PT-09b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 3049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3049/3049 places, 122340/122340 transitions.
Discarding 243 places :
Symmetric choice reduction at 0 with 243 rule applications. Total rules 243 place count 2806 transition count 122097
Iterating global reduction 0 with 243 rules applied. Total rules applied 486 place count 2806 transition count 122097
Discarding 152 places :
Symmetric choice reduction at 0 with 152 rule applications. Total rules 638 place count 2654 transition count 121945
Iterating global reduction 0 with 152 rules applied. Total rules applied 790 place count 2654 transition count 121945
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 880 place count 2564 transition count 121855
Iterating global reduction 0 with 90 rules applied. Total rules applied 970 place count 2564 transition count 121855
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 1050 place count 2484 transition count 121775
Iterating global reduction 0 with 80 rules applied. Total rules applied 1130 place count 2484 transition count 121775
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 1200 place count 2414 transition count 121705
Iterating global reduction 0 with 70 rules applied. Total rules applied 1270 place count 2414 transition count 121705
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 1340 place count 2344 transition count 121635
Iterating global reduction 0 with 70 rules applied. Total rules applied 1410 place count 2344 transition count 121635
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 1480 place count 2274 transition count 121565
Iterating global reduction 0 with 70 rules applied. Total rules applied 1550 place count 2274 transition count 121565
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 1620 place count 2204 transition count 121495
Iterating global reduction 0 with 70 rules applied. Total rules applied 1690 place count 2204 transition count 121495
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 1750 place count 2144 transition count 121435
Iterating global reduction 0 with 60 rules applied. Total rules applied 1810 place count 2144 transition count 121435
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 1860 place count 2094 transition count 121385
Iterating global reduction 0 with 50 rules applied. Total rules applied 1910 place count 2094 transition count 121385
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 1920 place count 2094 transition count 121375
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1940 place count 2074 transition count 121355
Iterating global reduction 1 with 20 rules applied. Total rules applied 1960 place count 2074 transition count 121355
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1980 place count 2054 transition count 121335
Iterating global reduction 1 with 20 rules applied. Total rules applied 2000 place count 2054 transition count 121335
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2010 place count 2044 transition count 121325
Iterating global reduction 1 with 10 rules applied. Total rules applied 2020 place count 2044 transition count 121325
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2030 place count 2034 transition count 121315
Iterating global reduction 1 with 10 rules applied. Total rules applied 2040 place count 2034 transition count 121315
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2050 place count 2024 transition count 121305
Iterating global reduction 1 with 10 rules applied. Total rules applied 2060 place count 2024 transition count 121305
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2070 place count 2014 transition count 121295
Iterating global reduction 1 with 10 rules applied. Total rules applied 2080 place count 2014 transition count 121295
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2090 place count 2004 transition count 121285
Iterating global reduction 1 with 10 rules applied. Total rules applied 2100 place count 2004 transition count 121285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2110 place count 1994 transition count 121275
Iterating global reduction 1 with 10 rules applied. Total rules applied 2120 place count 1994 transition count 121275
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2130 place count 1984 transition count 121265
Iterating global reduction 1 with 10 rules applied. Total rules applied 2140 place count 1984 transition count 121265
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2150 place count 1974 transition count 121255
Iterating global reduction 1 with 10 rules applied. Total rules applied 2160 place count 1974 transition count 121255
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2170 place count 1964 transition count 121245
Iterating global reduction 1 with 10 rules applied. Total rules applied 2180 place count 1964 transition count 121245
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 2190 place count 1954 transition count 121235
Iterating global reduction 1 with 10 rules applied. Total rules applied 2200 place count 1954 transition count 121235
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 2210 place count 1954 transition count 121225
Applied a total of 2210 rules in 16873 ms. Remains 1954 /3049 variables (removed 1095) and now considering 121225/122340 (removed 1115) transitions.
// Phase 1: matrix 121225 rows 1954 cols
[2024-05-31 01:45:28] [INFO ] Computed 11 invariants in 4851 ms
[2024-05-31 01:45:29] [INFO ] Implicit Places using invariants in 5736 ms returned []
Implicit Place search using SMT only with invariants took 5764 ms to find 0 implicit places.
[2024-05-31 01:45:29] [INFO ] Invariant cache hit.
[2024-05-31 01:46:00] [INFO ] Performed 52586/121225 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-31 01:46:29] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... after 60119 ms
Starting structural reductions in LTL mode, iteration 1 : 1954/3049 places, 121225/122340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82779 ms. Remains : 1954/3049 places, 121225/122340 transitions.
Support contains 70 out of 1954 places after structural reductions.
[2024-05-31 01:46:45] [INFO ] Flatten gal took : 13290 ms
[2024-05-31 01:46:57] [INFO ] Flatten gal took : 12409 ms
[2024-05-31 01:47:20] [INFO ] Input system was already deterministic with 121225 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 969 ms. (steps per millisecond=10 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Interrupted probabilistic random walk after 7124 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7124 steps, saw 5610 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 32 properties.
[2024-05-31 01:47:26] [INFO ] Invariant cache hit.
[2024-05-31 01:47:27] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-05-31 01:47:51] [INFO ] After 23661ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:29
[2024-05-31 01:47:51] [INFO ] After 23818ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:29
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-31 01:47:51] [INFO ] After 25207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:29
[2024-05-31 01:47:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-05-31 01:48:16] [INFO ] After 23095ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :29
[2024-05-31 01:48:16] [INFO ] After 23097ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :29
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-31 01:48:16] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :29
Fused 32 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 70 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 121225/121225 transitions.
Graph (trivial) has 1848 edges and 1954 vertex of which 170 / 1954 are part of one of the 30 SCC in 26 ms
Free SCC test removed 140 places
Drop transitions removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Graph (complete) has 4246 edges and 1814 vertex of which 1804 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.327 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 1279 transitions
Trivial Post-agglo rules discarded 1279 transitions
Performed 1279 trivial Post agglomeration. Transition count delta: 1279
Iterating post reduction 0 with 1289 rules applied. Total rules applied 1291 place count 1804 transition count 119746
Reduce places removed 1279 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1309 rules applied. Total rules applied 2600 place count 525 transition count 119716
Reduce places removed 10 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 40 rules applied. Total rules applied 2640 place count 515 transition count 119686
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 2670 place count 485 transition count 119686
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 106 Pre rules applied. Total rules applied 2670 place count 485 transition count 119580
Deduced a syphon composed of 106 places in 91 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 2882 place count 379 transition count 119580
Performed 47 Post agglomeration using F-continuation condition.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 50 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 3024 place count 308 transition count 119509
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 3044 place count 308 transition count 119489
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 3085 place count 267 transition count 119429
Iterating global reduction 5 with 41 rules applied. Total rules applied 3126 place count 267 transition count 119429
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 3137 place count 267 transition count 119418
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 3167 place count 237 transition count 119388
Iterating global reduction 6 with 30 rules applied. Total rules applied 3197 place count 237 transition count 119388
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 3217 place count 217 transition count 119368
Iterating global reduction 6 with 20 rules applied. Total rules applied 3237 place count 217 transition count 119368
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 3247 place count 217 transition count 119358
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 47 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 3267 place count 207 transition count 119348
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 49 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 3273 place count 204 transition count 119356
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 3304 place count 204 transition count 119325
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 3335 place count 173 transition count 119325
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 3345 place count 163 transition count 119315
Iterating global reduction 8 with 10 rules applied. Total rules applied 3355 place count 163 transition count 119315
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 3361 place count 163 transition count 119309
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 3367 place count 157 transition count 119309
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 3389 place count 157 transition count 119309
Applied a total of 3389 rules in 65825 ms. Remains 157 /1954 variables (removed 1797) and now considering 119309/121225 (removed 1916) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65829 ms. Remains : 157/1954 places, 119309/121225 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 410 stabilizing places and 430 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(G(((p1 U G(!p1))||p0))))'
Support contains 20 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 121225/121225 transitions.
Applied a total of 0 rules in 1232 ms. Remains 1954 /1954 variables (removed 0) and now considering 121225/121225 (removed 0) transitions.
[2024-05-31 01:49:24] [INFO ] Invariant cache hit.
[2024-05-31 01:49:45] [INFO ] Implicit Places using invariants in 20373 ms returned []
Implicit Place search using SMT only with invariants took 20374 ms to find 0 implicit places.
[2024-05-31 01:49:45] [INFO ] Invariant cache hit.
[2024-05-31 01:50:15] [INFO ] Performed 52839/121225 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-31 01:50:45] [INFO ] Dead Transitions using invariants and state equation in 60107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81718 ms. Remains : 1954/1954 places, 121225/121225 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 283 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Running random walk in product with property : StigmergyCommit-PT-09b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s125 1) (EQ s318 1) (EQ s511 1) (EQ s704 1) (EQ s855 1) (EQ s1048 1) (EQ s1262 1) (EQ s1455 1) (EQ s1669 1) (EQ s1862 1)), p0:(OR (EQ s69 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Product exploration explored 100000 steps with 550 reset in 4996 ms.
Product exploration explored 100000 steps with 554 reset in 4914 ms.
Computed a total of 410 stabilizing places and 430 stable transitions
Computed a total of 410 stabilizing places and 430 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 118 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 316 ms :[true, p1, (AND p1 (NOT p0)), p1]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 716 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 7737 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7737 steps, saw 5735 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-31 01:51:03] [INFO ] Invariant cache hit.
[2024-05-31 01:51:03] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-05-31 01:51:28] [INFO ] After 24682ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:3
[2024-05-31 01:51:28] [INFO ] After 24798ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 01:51:28] [INFO ] After 25131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 01:51:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-05-31 01:51:53] [INFO ] After 24653ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 01:51:53] [INFO ] After 24654ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-31 01:51:53] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 121225/121225 transitions.
Graph (trivial) has 1933 edges and 1954 vertex of which 170 / 1954 are part of one of the 30 SCC in 6 ms
Free SCC test removed 140 places
Drop transitions removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Graph (complete) has 4246 edges and 1814 vertex of which 1804 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.224 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 1349 transitions
Trivial Post-agglo rules discarded 1349 transitions
Performed 1349 trivial Post agglomeration. Transition count delta: 1349
Iterating post reduction 0 with 1359 rules applied. Total rules applied 1361 place count 1804 transition count 119676
Reduce places removed 1349 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1379 rules applied. Total rules applied 2740 place count 455 transition count 119646
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2750 place count 445 transition count 119646
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 2750 place count 445 transition count 119535
Deduced a syphon composed of 111 places in 82 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 2972 place count 334 transition count 119535
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2973 place count 334 transition count 119534
Performed 47 Post agglomeration using F-continuation condition.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 37 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 3115 place count 263 transition count 119463
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 3135 place count 263 transition count 119443
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 3181 place count 217 transition count 45025
Iterating global reduction 5 with 46 rules applied. Total rules applied 3227 place count 217 transition count 45025
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 3243 place count 217 transition count 45009
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 3273 place count 187 transition count 44979
Iterating global reduction 6 with 30 rules applied. Total rules applied 3303 place count 187 transition count 44979
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 3323 place count 167 transition count 44959
Iterating global reduction 6 with 20 rules applied. Total rules applied 3343 place count 167 transition count 44959
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 3353 place count 167 transition count 44949
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 13 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 3373 place count 157 transition count 44939
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 3379 place count 154 transition count 44947
Free-agglomeration rule applied 66 times.
Iterating global reduction 7 with 66 rules applied. Total rules applied 3445 place count 154 transition count 44881
Reduce places removed 66 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 99 rules applied. Total rules applied 3544 place count 88 transition count 44848
Renaming transitions due to excessive name length > 1024 char.
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 3554 place count 78 transition count 44838
Iterating global reduction 8 with 10 rules applied. Total rules applied 3564 place count 78 transition count 44838
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 3570 place count 78 transition count 44832
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 3576 place count 72 transition count 44832
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 3590 place count 72 transition count 44832
Applied a total of 3590 rules in 87427 ms. Remains 72 /1954 variables (removed 1882) and now considering 44832/121225 (removed 76393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87429 ms. Remains : 72/1954 places, 44832/121225 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[true, p1, (AND p1 (NOT p0))]
Support contains 20 out of 1954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1954/1954 places, 121225/121225 transitions.
Graph (trivial) has 1933 edges and 1954 vertex of which 170 / 1954 are part of one of the 30 SCC in 4 ms
Free SCC test removed 140 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1329 transitions
Trivial Post-agglo rules discarded 1329 transitions
Performed 1329 trivial Post agglomeration. Transition count delta: 1329
Iterating post reduction 0 with 1329 rules applied. Total rules applied 1330 place count 1813 transition count 119735
Reduce places removed 1329 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1359 rules applied. Total rules applied 2689 place count 484 transition count 119705
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2699 place count 474 transition count 119705
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 2699 place count 474 transition count 119604
Deduced a syphon composed of 101 places in 75 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2901 place count 373 transition count 119604
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2910 place count 364 transition count 119595
Iterating global reduction 3 with 9 rules applied. Total rules applied 2919 place count 364 transition count 119595
Performed 52 Post agglomeration using F-continuation condition.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 48 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 3077 place count 285 transition count 119516
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 3122 place count 240 transition count 45108
Iterating global reduction 3 with 45 rules applied. Total rules applied 3167 place count 240 transition count 45108
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 3182 place count 240 transition count 45093
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 3212 place count 210 transition count 45053
Iterating global reduction 4 with 30 rules applied. Total rules applied 3242 place count 210 transition count 45053
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 3272 place count 180 transition count 45013
Iterating global reduction 4 with 30 rules applied. Total rules applied 3302 place count 180 transition count 45013
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 3312 place count 180 transition count 45003
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 14 places in 14 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 3340 place count 166 transition count 45010
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3341 place count 165 transition count 44990
Iterating global reduction 5 with 1 rules applied. Total rules applied 3342 place count 165 transition count 44990
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3343 place count 165 transition count 44989
Applied a total of 3343 rules in 63650 ms. Remains 165 /1954 variables (removed 1789) and now considering 44989/121225 (removed 76236) transitions.
[2024-05-31 01:54:24] [INFO ] Flow matrix only has 44978 transitions (discarded 11 similar events)
// Phase 1: matrix 44978 rows 165 cols
[2024-05-31 01:54:25] [INFO ] Computed 2 invariants in 764 ms
[2024-05-31 01:54:33] [INFO ] Implicit Places using invariants in 9047 ms returned []
Implicit Place search using SMT only with invariants took 9048 ms to find 0 implicit places.
[2024-05-31 01:54:33] [INFO ] Flow matrix only has 44978 transitions (discarded 11 similar events)
[2024-05-31 01:54:33] [INFO ] Invariant cache hit.
[2024-05-31 01:54:47] [INFO ] Dead Transitions using invariants and state equation in 13136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/1954 places, 44989/121225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85839 ms. Remains : 165/1954 places, 44989/121225 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 96 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[true, p1, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 514 resets, run finished after 1269 ms. (steps per millisecond=7 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 28447 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 28447 steps, saw 13676 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-31 01:54:52] [INFO ] Flow matrix only has 44978 transitions (discarded 11 similar events)
[2024-05-31 01:54:52] [INFO ] Invariant cache hit.
[2024-05-31 01:54:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 01:55:10] [INFO ] After 18326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-31 01:55:25] [INFO ] State equation strengthened by 1023 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
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:261)
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 01:55:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 01:55:25] [INFO ] After 32823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 20 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 44989/44989 transitions.
Graph (complete) has 1508 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.87 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 164 transition count 44967
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 10 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 154 transition count 44957
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 52 place count 154 transition count 44947
Free-agglomeration rule applied 66 times.
Iterating global reduction 2 with 66 rules applied. Total rules applied 118 place count 154 transition count 44881
Reduce places removed 67 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 110 rules applied. Total rules applied 228 place count 87 transition count 44838
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 238 place count 77 transition count 44838
Renaming transitions due to excessive name length > 1024 char.
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 248 place count 67 transition count 44828
Iterating global reduction 4 with 10 rules applied. Total rules applied 258 place count 67 transition count 44828
Performed 20 Post agglomeration using F-continuation condition with reduction of 38157 identical transitions.
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 298 place count 47 transition count 6651
Drop transitions removed 10 transitions
Ensure Unique test removed 3535 transitions
Reduce isomorphic transitions removed 3545 transitions.
Iterating post reduction 4 with 3545 rules applied. Total rules applied 3843 place count 47 transition count 3106
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 3849 place count 41 transition count 3100
Iterating global reduction 5 with 6 rules applied. Total rules applied 3855 place count 41 transition count 3100
Performed 10 Post agglomeration using F-continuation condition with reduction of 1013 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 3875 place count 31 transition count 2077
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 3885 place count 31 transition count 2067
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3886 place count 30 transition count 2066
Applied a total of 3886 rules in 36277 ms. Remains 30 /165 variables (removed 135) and now considering 2066/44989 (removed 42923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36280 ms. Remains : 30/165 places, 2066/44989 transitions.
Incomplete random walk after 10000 steps, including 879 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 2066 rows 30 cols
[2024-05-31 01:56:01] [INFO ] Computed 10 invariants in 15 ms
[2024-05-31 01:56:02] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 01:56:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-31 01:56:02] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 4719 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[true, p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[true, p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[true, p1, (AND p1 (NOT p0))]
Product exploration timeout after 99220 steps with 5126 reset in 10235 ms.
Product exploration explored 100000 steps with 5137 reset in 7975 ms.
Built C files in :
/tmp/ltsmin18198911741846827124
[2024-05-31 01:56:25] [INFO ] Too many transitions (44989) to apply POR reductions. Disabling POR matrices.
[2024-05-31 01:56:26] [INFO ] Built C files in 1073ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18198911741846827124
Running compilation step : cd /tmp/ltsmin18198911741846827124;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18198911741846827124;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18198911741846827124;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 20 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 44989/44989 transitions.
Applied a total of 0 rules in 595 ms. Remains 165 /165 variables (removed 0) and now considering 44989/44989 (removed 0) transitions.
[2024-05-31 01:56:30] [INFO ] Flow matrix only has 44978 transitions (discarded 11 similar events)
// Phase 1: matrix 44978 rows 165 cols
[2024-05-31 01:56:31] [INFO ] Computed 2 invariants in 704 ms
[2024-05-31 01:56:42] [INFO ] Implicit Places using invariants in 11764 ms returned []
Implicit Place search using SMT only with invariants took 11765 ms to find 0 implicit places.
[2024-05-31 01:56:42] [INFO ] Flow matrix only has 44978 transitions (discarded 11 similar events)
[2024-05-31 01:56:42] [INFO ] Invariant cache hit.
[2024-05-31 01:56:55] [INFO ] Dead Transitions using invariants and state equation in 13253 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25617 ms. Remains : 165/165 places, 44989/44989 transitions.
Built C files in :
/tmp/ltsmin14091517927783837100
[2024-05-31 01:56:55] [INFO ] Too many transitions (44989) to apply POR reductions. Disabling POR matrices.
[2024-05-31 01:56:56] [INFO ] Built C files in 706ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14091517927783837100
Running compilation step : cd /tmp/ltsmin14091517927783837100;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14091517927783837100;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14091517927783837100;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 01:57:19] [INFO ] Flatten gal took : 7429 ms
[2024-05-31 01:57:25] [INFO ] Flatten gal took : 6348 ms
[2024-05-31 01:57:26] [INFO ] Time to serialize gal into /tmp/LTL9023548243534671834.gal : 670 ms
[2024-05-31 01:57:26] [INFO ] Time to serialize properties into /tmp/LTL963908102014195446.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/LTL9023548243534671834.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17329478270674434704.hoa' '-atoms' '/tmp/LTL963908102014195446.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
Detected timeout of ITS tools.
[2024-05-31 01:58:02] [INFO ] Flatten gal took : 7245 ms
[2024-05-31 01:58:08] [INFO ] Flatten gal took : 6868 ms
[2024-05-31 01:58:09] [INFO ] Time to serialize gal into /tmp/LTL4295673436239139744.gal : 769 ms
[2024-05-31 01:58:09] [INFO ] Time to serialize properties into /tmp/LTL7769374322139953069.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4295673436239139744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7769374322139953069.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
Detected timeout of ITS tools.
[2024-05-31 01:58:32] [INFO ] Flatten gal took : 7387 ms
[2024-05-31 01:58:32] [INFO ] Applying decomposition
[2024-05-31 01:58:39] [INFO ] Flatten gal took : 6565 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/graph2073026462519143174.txt' '-o' '/tmp/graph2073026462519143174.bin' '-w' '/tmp/graph2073026462519143174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2073026462519143174.bin' '-l' '-1' '-v' '-w' '/tmp/graph2073026462519143174.weights' '-q' '0' '-e' '0.001'
[2024-05-31 01:58:55] [INFO ] Decomposing Gal with order
[2024-05-31 01:58:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 01:59:08] [INFO ] Removed a total of 447755 redundant transitions.
[2024-05-31 01:59:09] [INFO ] Flatten gal took : 10207 ms
[2024-05-31 01:59:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 2922 ms.
[2024-05-31 01:59:13] [INFO ] Time to serialize gal into /tmp/LTL6277061827085255598.gal : 42 ms
[2024-05-31 01:59:13] [INFO ] Time to serialize properties into /tmp/LTL10835630036014214030.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/LTL6277061827085255598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10835630036014214030.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 : !((X(G(("((((i0.u1.p78==0)||(i2.u4.p335==0))||((i2.u7.p659==0)||(i2.u10.p961==0)))||(((i2.u13.p1286==0)||(i2.u16.p1565==0))||((i0.u19....657
Formula 0 simplified : XF(!"((((i0.u1.p78==0)||(i2.u4.p335==0))||((i2.u7.p659==0)||(i2.u10.p961==0)))||(((i2.u13.p1286==0)||(i2.u16.p1565==0))||((i0.u19.p1...644
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13345059494958116362
[2024-05-31 01:59:29] [INFO ] Built C files in 842ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13345059494958116362
Running compilation step : cd /tmp/ltsmin13345059494958116362;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13345059494958116362;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13345059494958116362;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property StigmergyCommit-PT-09b-LTLFireability-00 finished in 609082 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 U X(p0)))))'
Support contains 10 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 121225/121225 transitions.
Applied a total of 0 rules in 1606 ms. Remains 1954 /1954 variables (removed 0) and now considering 121225/121225 (removed 0) transitions.
// Phase 1: matrix 121225 rows 1954 cols
[2024-05-31 01:59:40] [INFO ] Computed 11 invariants in 5797 ms
[2024-05-31 02:00:06] [INFO ] Implicit Places using invariants in 32478 ms returned []
Implicit Place search using SMT only with invariants took 32479 ms to find 0 implicit places.
[2024-05-31 02:00:06] [INFO ] Invariant cache hit.
[2024-05-31 02:00:37] [INFO ] Performed 51962/121225 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-31 02:01:06] [INFO ] Dead Transitions using invariants and state equation in 60100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94190 ms. Remains : 1954/1954 places, 121225/121225 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s27 1) (EQ s220 1) (EQ s413 1) (EQ s606 1) (EQ s841 1) (EQ s992 1) (EQ s1227 1) (EQ s1378 1) (EQ s1571 1) (EQ s1806 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 14 ms.
FORMULA StigmergyCommit-PT-09b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09b-LTLFireability-01 finished in 94785 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((!p0&&X((!p0 U (p1||G(!p0)))))))'
Support contains 10 out of 1954 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 : 1954/1954 places, 121225/121225 transitions.
Graph (trivial) has 1924 edges and 1954 vertex of which 170 / 1954 are part of one of the 30 SCC in 4 ms
Free SCC test removed 140 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1320 transitions
Trivial Post-agglo rules discarded 1320 transitions
Performed 1320 trivial Post agglomeration. Transition count delta: 1320
Iterating post reduction 0 with 1320 rules applied. Total rules applied 1321 place count 1813 transition count 119744
Reduce places removed 1320 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1350 rules applied. Total rules applied 2671 place count 493 transition count 119714
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2681 place count 483 transition count 119714
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 2681 place count 483 transition count 119613
Deduced a syphon composed of 101 places in 81 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2883 place count 382 transition count 119613
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2892 place count 373 transition count 119604
Iterating global reduction 3 with 9 rules applied. Total rules applied 2901 place count 373 transition count 119604
Performed 52 Post agglomeration using F-continuation condition.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 50 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 3059 place count 294 transition count 119525
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 3102 place count 251 transition count 66987
Iterating global reduction 3 with 43 rules applied. Total rules applied 3145 place count 251 transition count 66987
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 3158 place count 251 transition count 66974
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 3188 place count 221 transition count 66934
Iterating global reduction 4 with 30 rules applied. Total rules applied 3218 place count 221 transition count 66934
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 3248 place count 191 transition count 66894
Iterating global reduction 4 with 30 rules applied. Total rules applied 3278 place count 191 transition count 66894
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 3288 place count 191 transition count 66884
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 14 places in 14 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 3316 place count 177 transition count 66891
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3317 place count 176 transition count 66871
Iterating global reduction 5 with 1 rules applied. Total rules applied 3318 place count 176 transition count 66871
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3319 place count 176 transition count 66870
Applied a total of 3319 rules in 62226 ms. Remains 176 /1954 variables (removed 1778) and now considering 66870/121225 (removed 54355) transitions.
[2024-05-31 02:02:09] [INFO ] Flow matrix only has 66859 transitions (discarded 11 similar events)
// Phase 1: matrix 66859 rows 176 cols
[2024-05-31 02:02:11] [INFO ] Computed 2 invariants in 1706 ms
[2024-05-31 02:02:20] [INFO ] Implicit Places using invariants in 10501 ms returned []
Implicit Place search using SMT only with invariants took 10502 ms to find 0 implicit places.
[2024-05-31 02:02:20] [INFO ] Flow matrix only has 66859 transitions (discarded 11 similar events)
[2024-05-31 02:02:20] [INFO ] Invariant cache hit.
[2024-05-31 02:02:40] [INFO ] Dead Transitions using invariants and state equation in 20221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 176/1954 places, 66870/121225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92954 ms. Remains : 176/1954 places, 66870/121225 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, p0]
Running random walk in product with property : StigmergyCommit-PT-09b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s7 1) (EQ s25 1) (EQ s40 1) (EQ s56 1) (EQ s75 1) (EQ s92 1) (EQ s110 1) (EQ s128 1) (EQ s145 1) (EQ s161 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 87600 steps with 4360 reset in 10002 ms.
Product exploration timeout after 96690 steps with 4830 reset in 10001 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 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 47 ms :[true, p0]
Incomplete random walk after 10000 steps, including 491 resets, run finished after 1820 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19172 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19172 steps, saw 11631 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 02:03:07] [INFO ] Flow matrix only has 66859 transitions (discarded 11 similar events)
[2024-05-31 02:03:07] [INFO ] Invariant cache hit.
[2024-05-31 02:03:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 02:03:22] [INFO ] After 15230ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 02:33:20] [INFO ] State equation strengthened by 1023 read => feed constraints.
BK_STOP 1717122843490
--------------------
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="StigmergyCommit-PT-09b"
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 StigmergyCommit-PT-09b, 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 r417-tall-171690555800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09b.tgz
mv StigmergyCommit-PT-09b 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 ;