About the Execution of ITS-Tools for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16213.876 | 3600000.00 | 10072012.00 | 73138.30 | FFFFTF???F??TFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025600700.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600700
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 13:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.9M May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653038306363
Running Version 202205111006
[2022-05-20 09:18:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 09:18:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:18:27] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2022-05-20 09:18:28] [INFO ] Transformed 7803 places.
[2022-05-20 09:18:28] [INFO ] Transformed 7103 transitions.
[2022-05-20 09:18:28] [INFO ] Found NUPN structural information;
[2022-05-20 09:18:28] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 706 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-100B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1094 places :
Symmetric choice reduction at 0 with 1094 rule applications. Total rules 1094 place count 6709 transition count 6009
Iterating global reduction 0 with 1094 rules applied. Total rules applied 2188 place count 6709 transition count 6009
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2189 place count 6708 transition count 6008
Iterating global reduction 0 with 1 rules applied. Total rules applied 2190 place count 6708 transition count 6008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2191 place count 6707 transition count 6007
Iterating global reduction 0 with 1 rules applied. Total rules applied 2192 place count 6707 transition count 6007
Applied a total of 2192 rules in 6262 ms. Remains 6707 /7803 variables (removed 1096) and now considering 6007/7103 (removed 1096) transitions.
// Phase 1: matrix 6007 rows 6707 cols
[2022-05-20 09:18:35] [INFO ] Computed 1101 place invariants in 80 ms
[2022-05-20 09:18:37] [INFO ] Implicit Places using invariants in 2602 ms returned []
// Phase 1: matrix 6007 rows 6707 cols
[2022-05-20 09:18:37] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 09:18:39] [INFO ] Implicit Places using invariants and state equation in 2372 ms returned []
Implicit Place search using SMT with State Equation took 5105 ms to find 0 implicit places.
// Phase 1: matrix 6007 rows 6707 cols
[2022-05-20 09:18:40] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 09:18:44] [INFO ] Dead Transitions using invariants and state equation in 4170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6707/7803 places, 6007/7103 transitions.
Finished structural reductions, in 1 iterations. Remains : 6707/7803 places, 6007/7103 transitions.
Support contains 38 out of 6707 places after structural reductions.
[2022-05-20 09:18:44] [INFO ] Flatten gal took : 338 ms
[2022-05-20 09:18:45] [INFO ] Flatten gal took : 215 ms
[2022-05-20 09:18:45] [INFO ] Input system was already deterministic with 6007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=13 ) properties (out of 36) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 6007 rows 6707 cols
[2022-05-20 09:18:46] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 09:18:49] [INFO ] [Real]Absence check using 1101 positive place invariants in 624 ms returned sat
[2022-05-20 09:19:00] [INFO ] After 14203ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2022-05-20 09:19:03] [INFO ] [Nat]Absence check using 1101 positive place invariants in 743 ms returned sat
[2022-05-20 09:19:14] [INFO ] After 8981ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2022-05-20 09:19:17] [INFO ] Deduced a trap composed of 22 places in 2517 ms of which 17 ms to minimize.
[2022-05-20 09:19:19] [INFO ] Deduced a trap composed of 24 places in 2330 ms of which 10 ms to minimize.
[2022-05-20 09:19:22] [INFO ] Deduced a trap composed of 19 places in 2413 ms of which 5 ms to minimize.
[2022-05-20 09:19:24] [INFO ] Deduced a trap composed of 20 places in 2353 ms of which 4 ms to minimize.
[2022-05-20 09:19:27] [INFO ] Deduced a trap composed of 21 places in 2192 ms of which 11 ms to minimize.
[2022-05-20 09:19:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:19:27] [INFO ] After 26528ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:19
Fused 20 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 4851 ms.
Support contains 23 out of 6707 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Drop transitions removed 1384 transitions
Trivial Post-agglo rules discarded 1384 transitions
Performed 1384 trivial Post agglomeration. Transition count delta: 1384
Iterating post reduction 0 with 1384 rules applied. Total rules applied 1384 place count 6707 transition count 4623
Reduce places removed 1384 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1389 rules applied. Total rules applied 2773 place count 5323 transition count 4618
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2778 place count 5318 transition count 4618
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 792 Pre rules applied. Total rules applied 2778 place count 5318 transition count 3826
Deduced a syphon composed of 792 places in 13 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 3 with 1584 rules applied. Total rules applied 4362 place count 4526 transition count 3826
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 4364 place count 4524 transition count 3824
Iterating global reduction 3 with 2 rules applied. Total rules applied 4366 place count 4524 transition count 3824
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4366 place count 4524 transition count 3822
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4370 place count 4522 transition count 3822
Performed 1693 Post agglomeration using F-continuation condition.Transition count delta: 1693
Deduced a syphon composed of 1693 places in 5 ms
Reduce places removed 1693 places and 0 transitions.
Iterating global reduction 3 with 3386 rules applied. Total rules applied 7756 place count 2829 transition count 2129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7757 place count 2829 transition count 2128
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7759 place count 2828 transition count 2127
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7961 place count 2727 transition count 2127
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8163 place count 2626 transition count 2127
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 25 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 8347 place count 2534 transition count 2127
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8349 place count 2534 transition count 2125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8351 place count 2532 transition count 2125
Partial Free-agglomeration rule applied 295 times.
Drop transitions removed 295 transitions
Iterating global reduction 5 with 295 rules applied. Total rules applied 8646 place count 2532 transition count 2125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8647 place count 2531 transition count 2124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8648 place count 2530 transition count 2124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8648 place count 2530 transition count 2122
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 8652 place count 2528 transition count 2122
Applied a total of 8652 rules in 3303 ms. Remains 2528 /6707 variables (removed 4179) and now considering 2122/6007 (removed 3885) transitions.
Finished structural reductions, in 1 iterations. Remains : 2528/6707 places, 2122/6007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 51783 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51783 steps, saw 36082 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 2122 rows 2528 cols
[2022-05-20 09:19:39] [INFO ] Computed 1100 place invariants in 9 ms
[2022-05-20 09:19:40] [INFO ] [Real]Absence check using 1100 positive place invariants in 200 ms returned sat
[2022-05-20 09:19:43] [INFO ] After 4351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-20 09:19:44] [INFO ] [Nat]Absence check using 1100 positive place invariants in 195 ms returned sat
[2022-05-20 09:19:47] [INFO ] After 2359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-20 09:19:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-20 09:19:49] [INFO ] After 1377ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2022-05-20 09:19:49] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2022-05-20 09:19:49] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2022-05-20 09:19:49] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2022-05-20 09:19:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 874 ms
[2022-05-20 09:19:52] [INFO ] After 4543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1407 ms.
[2022-05-20 09:19:53] [INFO ] After 10117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 410 ms.
Support contains 21 out of 2528 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2528/2528 places, 2122/2122 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 2528 transition count 2121
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2527 transition count 2121
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 2527 transition count 2121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2526 transition count 2120
Applied a total of 4 rules in 420 ms. Remains 2526 /2528 variables (removed 2) and now considering 2120/2122 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2526/2528 places, 2120/2122 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 822 ms. (steps per millisecond=12 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 47591 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47591 steps, saw 32909 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 2120 rows 2526 cols
[2022-05-20 09:19:58] [INFO ] Computed 1100 place invariants in 4 ms
[2022-05-20 09:19:59] [INFO ] [Real]Absence check using 1100 positive place invariants in 198 ms returned sat
[2022-05-20 09:20:02] [INFO ] After 4297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-20 09:20:03] [INFO ] [Nat]Absence check using 1100 positive place invariants in 188 ms returned sat
[2022-05-20 09:20:07] [INFO ] After 2379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-20 09:20:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-20 09:20:08] [INFO ] After 1378ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2022-05-20 09:20:10] [INFO ] After 3786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1367 ms.
[2022-05-20 09:20:12] [INFO ] After 9346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 332 ms.
Support contains 21 out of 2526 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2526/2526 places, 2120/2120 transitions.
Applied a total of 0 rules in 132 ms. Remains 2526 /2526 variables (removed 0) and now considering 2120/2120 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2526/2526 places, 2120/2120 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2526/2526 places, 2120/2120 transitions.
Applied a total of 0 rules in 120 ms. Remains 2526 /2526 variables (removed 0) and now considering 2120/2120 (removed 0) transitions.
// Phase 1: matrix 2120 rows 2526 cols
[2022-05-20 09:20:12] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 09:20:14] [INFO ] Implicit Places using invariants in 1858 ms returned [2509, 2513]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1862 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2524/2526 places, 2120/2120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2522 transition count 2118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2522 transition count 2118
Applied a total of 4 rules in 241 ms. Remains 2522 /2524 variables (removed 2) and now considering 2118/2120 (removed 2) transitions.
// Phase 1: matrix 2118 rows 2522 cols
[2022-05-20 09:20:14] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:20:16] [INFO ] Implicit Places using invariants in 1758 ms returned []
// Phase 1: matrix 2118 rows 2522 cols
[2022-05-20 09:20:16] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:20:18] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:20:20] [INFO ] Implicit Places using invariants and state equation in 3950 ms returned []
Implicit Place search using SMT with State Equation took 5712 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2522/2526 places, 2118/2120 transitions.
Finished structural reductions, in 2 iterations. Remains : 2522/2526 places, 2118/2120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 53320 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53320 steps, saw 38363 distinct states, run finished after 3003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 2118 rows 2522 cols
[2022-05-20 09:20:24] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:20:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 187 ms returned sat
[2022-05-20 09:20:28] [INFO ] After 4147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-20 09:20:29] [INFO ] [Nat]Absence check using 1098 positive place invariants in 192 ms returned sat
[2022-05-20 09:20:32] [INFO ] After 2355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-20 09:20:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:20:34] [INFO ] After 1344ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2022-05-20 09:20:34] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2022-05-20 09:20:34] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2022-05-20 09:20:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 565 ms
[2022-05-20 09:20:37] [INFO ] After 4162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1362 ms.
[2022-05-20 09:20:38] [INFO ] After 9601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 288 ms.
Support contains 21 out of 2522 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2522/2522 places, 2118/2118 transitions.
Applied a total of 0 rules in 118 ms. Remains 2522 /2522 variables (removed 0) and now considering 2118/2118 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2522/2522 places, 2118/2118 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2522/2522 places, 2118/2118 transitions.
Applied a total of 0 rules in 120 ms. Remains 2522 /2522 variables (removed 0) and now considering 2118/2118 (removed 0) transitions.
// Phase 1: matrix 2118 rows 2522 cols
[2022-05-20 09:20:38] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:20:40] [INFO ] Implicit Places using invariants in 1684 ms returned []
// Phase 1: matrix 2118 rows 2522 cols
[2022-05-20 09:20:40] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:20:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:20:44] [INFO ] Implicit Places using invariants and state equation in 3821 ms returned []
Implicit Place search using SMT with State Equation took 5509 ms to find 0 implicit places.
[2022-05-20 09:20:44] [INFO ] Redundant transitions in 141 ms returned []
// Phase 1: matrix 2118 rows 2522 cols
[2022-05-20 09:20:44] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:20:45] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2522/2522 places, 2118/2118 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 1600 stabilizing places and 1600 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((false U G(p0)))&&F((X(p2)&&p1))))'
Support contains 4 out of 6707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6701 transition count 6001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6701 transition count 6001
Applied a total of 12 rules in 3058 ms. Remains 6701 /6707 variables (removed 6) and now considering 6001/6007 (removed 6) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:20:49] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:20:51] [INFO ] Implicit Places using invariants in 2279 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:20:51] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 09:20:53] [INFO ] Implicit Places using invariants and state equation in 2301 ms returned []
Implicit Place search using SMT with State Equation took 4598 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:20:54] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:20:58] [INFO ] Dead Transitions using invariants and state equation in 4146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6707 places, 6001/6007 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6707 places, 6001/6007 transitions.
Stuttering acceptance computed with spot in 966 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s31 1), p2:(EQ s3589 1), p1:(AND (EQ s1981 1) (EQ s2007 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 5 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-00 finished in 12923 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 6707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6701 transition count 6001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6701 transition count 6001
Applied a total of 12 rules in 3104 ms. Remains 6701 /6707 variables (removed 6) and now considering 6001/6007 (removed 6) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:21:02] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:21:04] [INFO ] Implicit Places using invariants in 2274 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:21:04] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 09:21:06] [INFO ] Implicit Places using invariants and state equation in 2152 ms returned []
Implicit Place search using SMT with State Equation took 4445 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:21:06] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 09:21:10] [INFO ] Dead Transitions using invariants and state equation in 4043 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6707 places, 6001/6007 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6707 places, 6001/6007 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-02 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:(EQ s902 1)], 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 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-02 finished in 11742 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((p0 U X(F((G(X(p0)) U p1))))))))'
Support contains 1 out of 6707 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6701 transition count 6001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6701 transition count 6001
Applied a total of 12 rules in 3078 ms. Remains 6701 /6707 variables (removed 6) and now considering 6001/6007 (removed 6) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:21:14] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:21:16] [INFO ] Implicit Places using invariants in 2341 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:21:16] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 09:21:18] [INFO ] Implicit Places using invariants and state equation in 2174 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:21:18] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 09:21:22] [INFO ] Dead Transitions using invariants and state equation in 4310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6707 places, 6001/6007 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6707 places, 6001/6007 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s3137 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1536 ms.
Stack based approach found an accepted trace after 8498 steps with 0 reset with depth 8499 and stack size 8499 in 141 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-03 finished in 13822 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 6707 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1401 transitions
Trivial Post-agglo rules discarded 1401 transitions
Performed 1401 trivial Post agglomeration. Transition count delta: 1401
Iterating post reduction 0 with 1401 rules applied. Total rules applied 1401 place count 6706 transition count 4605
Reduce places removed 1401 places and 0 transitions.
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2802 place count 5305 transition count 4605
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2802 place count 5305 transition count 3809
Deduced a syphon composed of 796 places in 12 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 4394 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4398 place count 4505 transition count 3805
Iterating global reduction 2 with 4 rules applied. Total rules applied 4402 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4402 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4410 place count 4501 transition count 3801
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 5 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7804 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7805 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7807 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8009 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8211 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8405 place count 2504 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8407 place count 2502 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8408 place count 2501 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8408 place count 2501 transition count 2098
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8412 place count 2499 transition count 2098
Applied a total of 8412 rules in 2818 ms. Remains 2499 /6707 variables (removed 4208) and now considering 2098/6007 (removed 3909) transitions.
// Phase 1: matrix 2098 rows 2499 cols
[2022-05-20 09:21:27] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 09:21:29] [INFO ] Implicit Places using invariants in 1683 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1690 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6707 places, 2098/6007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2495 transition count 2096
Applied a total of 4 rules in 228 ms. Remains 2495 /2497 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:21:29] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:21:31] [INFO ] Implicit Places using invariants in 1629 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:21:31] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:21:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:21:34] [INFO ] Implicit Places using invariants and state equation in 3409 ms returned []
Implicit Place search using SMT with State Equation took 5042 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6707 places, 2096/6007 transitions.
Finished structural reductions, in 2 iterations. Remains : 2495/6707 places, 2096/6007 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s126 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]]
Product exploration explored 100000 steps with 19354 reset in 2068 ms.
Stack based approach found an accepted trace after 8 steps with 1 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-05 finished in 11918 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!(F(p1)&&X(p0)&&p2)))))'
Support contains 4 out of 6707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6702 transition count 6002
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6702 transition count 6002
Applied a total of 10 rules in 3126 ms. Remains 6702 /6707 variables (removed 5) and now considering 6002/6007 (removed 5) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:21:39] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 09:21:42] [INFO ] Implicit Places using invariants in 2219 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:21:42] [INFO ] Computed 1101 place invariants in 42 ms
[2022-05-20 09:21:44] [INFO ] Implicit Places using invariants and state equation in 2289 ms returned []
Implicit Place search using SMT with State Equation took 4535 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:21:44] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:21:48] [INFO ] Dead Transitions using invariants and state equation in 4511 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6707 places, 6002/6007 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6707 places, 6002/6007 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2 p1), p0, (AND p1 p0), true, p1]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s6604 1), p2:(OR (AND (EQ s2963 1) (EQ s2965 1)) (EQ s4385 1)), p1:(EQ s4385 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33221 reset in 3266 ms.
Product exploration explored 100000 steps with 33308 reset in 3317 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6702 stabilizing places and 1598/6002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 447 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 224 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:21:57] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:21:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 696 ms returned sat
[2022-05-20 09:22:04] [INFO ] After 5399ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-20 09:22:07] [INFO ] Deduced a trap composed of 17 places in 2281 ms of which 3 ms to minimize.
[2022-05-20 09:22:09] [INFO ] Deduced a trap composed of 17 places in 2247 ms of which 3 ms to minimize.
[2022-05-20 09:22:12] [INFO ] Deduced a trap composed of 32 places in 2292 ms of which 3 ms to minimize.
[2022-05-20 09:22:14] [INFO ] Deduced a trap composed of 19 places in 2227 ms of which 4 ms to minimize.
[2022-05-20 09:22:16] [INFO ] Deduced a trap composed of 18 places in 2201 ms of which 4 ms to minimize.
[2022-05-20 09:22:19] [INFO ] Deduced a trap composed of 27 places in 2216 ms of which 4 ms to minimize.
[2022-05-20 09:22:21] [INFO ] Deduced a trap composed of 20 places in 2156 ms of which 3 ms to minimize.
[2022-05-20 09:22:24] [INFO ] Deduced a trap composed of 23 places in 2207 ms of which 4 ms to minimize.
[2022-05-20 09:22:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:22:24] [INFO ] After 26920ms 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 258 ms.
Support contains 4 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6702 transition count 4605
Reduce places removed 1397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2795 place count 5305 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2796 place count 5304 transition count 4604
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 801 Pre rules applied. Total rules applied 2796 place count 5304 transition count 3803
Deduced a syphon composed of 801 places in 16 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 3 with 1602 rules applied. Total rules applied 4398 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 7796 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7797 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7799 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8001 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8203 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8397 place count 2504 transition count 2102
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 4 with 298 rules applied. Total rules applied 8695 place count 2504 transition count 2102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8696 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8697 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8697 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8701 place count 2500 transition count 2099
Applied a total of 8701 rules in 2223 ms. Remains 2500 /6702 variables (removed 4202) and now considering 2099/6002 (removed 3903) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/6702 places, 2099/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:22:27] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 09:22:27] [INFO ] [Real]Absence check using 1100 positive place invariants in 200 ms returned sat
[2022-05-20 09:22:27] [INFO ] After 588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:22:28] [INFO ] [Nat]Absence check using 1100 positive place invariants in 189 ms returned sat
[2022-05-20 09:22:29] [INFO ] After 1111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:22:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-20 09:22:29] [INFO ] After 150ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:22:29] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2022-05-20 09:22:30] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 2 ms to minimize.
[2022-05-20 09:22:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 582 ms
[2022-05-20 09:22:30] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2022-05-20 09:22:30] [INFO ] After 2733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 115 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2099/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68732 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68732 steps, saw 47390 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:22:34] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 09:22:34] [INFO ] [Real]Absence check using 1100 positive place invariants in 197 ms returned sat
[2022-05-20 09:22:34] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:22:35] [INFO ] [Nat]Absence check using 1100 positive place invariants in 199 ms returned sat
[2022-05-20 09:22:36] [INFO ] After 1181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:22:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-20 09:22:36] [INFO ] After 156ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:22:36] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2022-05-20 09:22:37] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2022-05-20 09:22:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 584 ms
[2022-05-20 09:22:37] [INFO ] After 921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 152 ms.
[2022-05-20 09:22:37] [INFO ] After 2832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 117 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2099/2099 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 117 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:22:37] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 09:22:39] [INFO ] Implicit Places using invariants in 1699 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1706 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2498/2500 places, 2099/2099 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2496 transition count 2097
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 243 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:22:39] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:22:41] [INFO ] Implicit Places using invariants in 1685 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:22:41] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:22:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:22:45] [INFO ] Implicit Places using invariants and state equation in 3412 ms returned []
Implicit Place search using SMT with State Equation took 5099 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2496/2500 places, 2097/2099 transitions.
Finished structural reductions, in 2 iterations. Remains : 2496/2500 places, 2097/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 67955 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67955 steps, saw 47702 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:22:48] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:22:49] [INFO ] [Real]Absence check using 1098 positive place invariants in 196 ms returned sat
[2022-05-20 09:22:49] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:22:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 196 ms returned sat
[2022-05-20 09:22:50] [INFO ] After 1132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:22:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:22:50] [INFO ] After 158ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:22:51] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
[2022-05-20 09:22:51] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2022-05-20 09:22:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 562 ms
[2022-05-20 09:22:51] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 0 ms to minimize.
[2022-05-20 09:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2022-05-20 09:22:51] [INFO ] After 1156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 157 ms.
[2022-05-20 09:22:52] [INFO ] After 3026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 77 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 121 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 117 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:22:52] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:22:54] [INFO ] Implicit Places using invariants in 1707 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:22:54] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:22:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:22:57] [INFO ] Implicit Places using invariants and state equation in 3657 ms returned []
Implicit Place search using SMT with State Equation took 5366 ms to find 0 implicit places.
[2022-05-20 09:22:57] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:22:57] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:22:59] [INFO ] Dead Transitions using invariants and state equation in 1377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2496 transition count 2097
Applied a total of 594 rules in 282 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:22:59] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:23:00] [INFO ] [Real]Absence check using 1098 positive place invariants in 202 ms returned sat
[2022-05-20 09:23:00] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:23:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 195 ms returned sat
[2022-05-20 09:23:01] [INFO ] After 1169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:23:01] [INFO ] State equation strengthened by 592 read => feed constraints.
[2022-05-20 09:23:02] [INFO ] After 505ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:23:03] [INFO ] Deduced a trap composed of 7 places in 613 ms of which 1 ms to minimize.
[2022-05-20 09:23:03] [INFO ] Deduced a trap composed of 5 places in 648 ms of which 1 ms to minimize.
[2022-05-20 09:23:04] [INFO ] Deduced a trap composed of 5 places in 626 ms of which 1 ms to minimize.
[2022-05-20 09:23:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2301 ms
[2022-05-20 09:23:05] [INFO ] After 3104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 253 ms.
[2022-05-20 09:23:05] [INFO ] After 5108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1 p2)), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (AND p1 p2)), (F p1)]
Knowledge based reduction with 11 factoid took 609 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 280 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Stuttering acceptance computed with spot in 215 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Support contains 4 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 1541 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:23:07] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 09:23:10] [INFO ] Implicit Places using invariants in 2243 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:23:10] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 09:23:12] [INFO ] Implicit Places using invariants and state equation in 2247 ms returned []
Implicit Place search using SMT with State Equation took 4492 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:23:12] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:23:16] [INFO ] Dead Transitions using invariants and state equation in 4470 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6702 places, 6002/6002 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6702 stabilizing places and 1598/6002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 436 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 246 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:23:18] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:23:19] [INFO ] [Real]Absence check using 1101 positive place invariants in 631 ms returned sat
[2022-05-20 09:23:25] [INFO ] After 5354ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-20 09:23:28] [INFO ] Deduced a trap composed of 17 places in 2294 ms of which 4 ms to minimize.
[2022-05-20 09:23:30] [INFO ] Deduced a trap composed of 17 places in 2236 ms of which 4 ms to minimize.
[2022-05-20 09:23:33] [INFO ] Deduced a trap composed of 32 places in 2227 ms of which 3 ms to minimize.
[2022-05-20 09:23:35] [INFO ] Deduced a trap composed of 19 places in 2256 ms of which 3 ms to minimize.
[2022-05-20 09:23:37] [INFO ] Deduced a trap composed of 18 places in 2141 ms of which 3 ms to minimize.
[2022-05-20 09:23:40] [INFO ] Deduced a trap composed of 27 places in 2067 ms of which 4 ms to minimize.
[2022-05-20 09:23:42] [INFO ] Deduced a trap composed of 20 places in 2128 ms of which 4 ms to minimize.
[2022-05-20 09:23:44] [INFO ] Deduced a trap composed of 23 places in 2077 ms of which 3 ms to minimize.
[2022-05-20 09:23:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:23:44] [INFO ] After 26450ms 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 298 ms.
Support contains 4 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6702 transition count 4605
Reduce places removed 1397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2795 place count 5305 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2796 place count 5304 transition count 4604
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 801 Pre rules applied. Total rules applied 2796 place count 5304 transition count 3803
Deduced a syphon composed of 801 places in 11 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 3 with 1602 rules applied. Total rules applied 4398 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 7796 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7797 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7799 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8001 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8203 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8397 place count 2504 transition count 2102
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 4 with 298 rules applied. Total rules applied 8695 place count 2504 transition count 2102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8696 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8697 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8697 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8701 place count 2500 transition count 2099
Applied a total of 8701 rules in 2136 ms. Remains 2500 /6702 variables (removed 4202) and now considering 2099/6002 (removed 3903) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/6702 places, 2099/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:23:48] [INFO ] Computed 1100 place invariants in 5 ms
[2022-05-20 09:23:48] [INFO ] [Real]Absence check using 1100 positive place invariants in 201 ms returned sat
[2022-05-20 09:23:48] [INFO ] After 602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:23:49] [INFO ] [Nat]Absence check using 1100 positive place invariants in 193 ms returned sat
[2022-05-20 09:23:50] [INFO ] After 1130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:23:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-20 09:23:50] [INFO ] After 156ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:23:50] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2022-05-20 09:23:51] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2022-05-20 09:23:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 620 ms
[2022-05-20 09:23:51] [INFO ] After 961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 158 ms.
[2022-05-20 09:23:51] [INFO ] After 2830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 120 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2099/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 72056 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72056 steps, saw 49729 distinct states, run finished after 3009 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:23:55] [INFO ] Computed 1100 place invariants in 4 ms
[2022-05-20 09:23:55] [INFO ] [Real]Absence check using 1100 positive place invariants in 190 ms returned sat
[2022-05-20 09:23:55] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:23:56] [INFO ] [Nat]Absence check using 1100 positive place invariants in 186 ms returned sat
[2022-05-20 09:23:57] [INFO ] After 1102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:23:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-20 09:23:57] [INFO ] After 165ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:23:57] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2022-05-20 09:23:58] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2022-05-20 09:23:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 653 ms
[2022-05-20 09:23:58] [INFO ] After 1005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2022-05-20 09:23:58] [INFO ] After 2814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 79 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 115 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2099/2099 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 116 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:23:58] [INFO ] Computed 1100 place invariants in 12 ms
[2022-05-20 09:24:00] [INFO ] Implicit Places using invariants in 1671 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1683 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2498/2500 places, 2099/2099 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2496 transition count 2097
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 223 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:24:00] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:24:02] [INFO ] Implicit Places using invariants in 1600 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:24:02] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:24:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:24:05] [INFO ] Implicit Places using invariants and state equation in 3584 ms returned []
Implicit Place search using SMT with State Equation took 5216 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2496/2500 places, 2097/2099 transitions.
Finished structural reductions, in 2 iterations. Remains : 2496/2500 places, 2097/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 71377 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71377 steps, saw 50005 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:24:09] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:24:09] [INFO ] [Real]Absence check using 1098 positive place invariants in 194 ms returned sat
[2022-05-20 09:24:10] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:24:10] [INFO ] [Nat]Absence check using 1098 positive place invariants in 185 ms returned sat
[2022-05-20 09:24:11] [INFO ] After 1101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:24:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:24:11] [INFO ] After 192ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:24:12] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2022-05-20 09:24:12] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 11 ms to minimize.
[2022-05-20 09:24:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
[2022-05-20 09:24:12] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2022-05-20 09:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2022-05-20 09:24:12] [INFO ] After 1239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2022-05-20 09:24:13] [INFO ] After 3047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 82 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 117 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 113 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:24:13] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:24:15] [INFO ] Implicit Places using invariants in 1782 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:24:15] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:24:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:24:18] [INFO ] Implicit Places using invariants and state equation in 3603 ms returned []
Implicit Place search using SMT with State Equation took 5403 ms to find 0 implicit places.
[2022-05-20 09:24:18] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:24:18] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:24:20] [INFO ] Dead Transitions using invariants and state equation in 1338 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2496 transition count 2097
Applied a total of 594 rules in 277 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:24:20] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:24:21] [INFO ] [Real]Absence check using 1098 positive place invariants in 184 ms returned sat
[2022-05-20 09:24:21] [INFO ] After 593ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:24:21] [INFO ] [Nat]Absence check using 1098 positive place invariants in 184 ms returned sat
[2022-05-20 09:24:22] [INFO ] After 1103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:24:22] [INFO ] State equation strengthened by 592 read => feed constraints.
[2022-05-20 09:24:23] [INFO ] After 467ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:24:23] [INFO ] Deduced a trap composed of 7 places in 616 ms of which 1 ms to minimize.
[2022-05-20 09:24:24] [INFO ] Deduced a trap composed of 5 places in 594 ms of which 1 ms to minimize.
[2022-05-20 09:24:25] [INFO ] Deduced a trap composed of 5 places in 643 ms of which 8 ms to minimize.
[2022-05-20 09:24:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2242 ms
[2022-05-20 09:24:25] [INFO ] After 3000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 248 ms.
[2022-05-20 09:24:26] [INFO ] After 4929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1 p2)), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (AND p1 p2)), (F p1)]
Knowledge based reduction with 11 factoid took 578 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 222 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Stuttering acceptance computed with spot in 207 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Stuttering acceptance computed with spot in 234 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Product exploration explored 100000 steps with 33424 reset in 3185 ms.
Product exploration explored 100000 steps with 33377 reset in 3252 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 240 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Support contains 4 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Performed 1398 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6702 transition count 6002
Performed 502 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 502 Pre rules applied. Total rules applied 1398 place count 6702 transition count 6403
Deduced a syphon composed of 1900 places in 19 ms
Iterating global reduction 1 with 502 rules applied. Total rules applied 1900 place count 6702 transition count 6403
Performed 1898 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3798 places in 25 ms
Iterating global reduction 1 with 1898 rules applied. Total rules applied 3798 place count 6702 transition count 6403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3799 place count 6702 transition count 6402
Renaming transitions due to excessive name length > 1024 char.
Discarding 700 places :
Symmetric choice reduction at 2 with 700 rule applications. Total rules 4499 place count 6002 transition count 5702
Deduced a syphon composed of 3098 places in 22 ms
Iterating global reduction 2 with 700 rules applied. Total rules applied 5199 place count 6002 transition count 5702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3099 places in 21 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5200 place count 6002 transition count 5702
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5202 place count 6000 transition count 5700
Deduced a syphon composed of 3097 places in 21 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5204 place count 6000 transition count 5700
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3198 places in 23 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5305 place count 6000 transition count 6130
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5406 place count 5899 transition count 5928
Deduced a syphon composed of 3097 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5507 place count 5899 transition count 5928
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3198 places in 23 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5608 place count 5899 transition count 6355
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5709 place count 5798 transition count 6153
Deduced a syphon composed of 3097 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5810 place count 5798 transition count 6153
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3198 places in 18 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5911 place count 5798 transition count 6583
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6012 place count 5697 transition count 6381
Deduced a syphon composed of 3097 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6113 place count 5697 transition count 6381
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -407
Deduced a syphon composed of 3193 places in 14 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6209 place count 5697 transition count 6788
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 6306 place count 5600 transition count 6594
Deduced a syphon composed of 3096 places in 12 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 6403 place count 5600 transition count 6594
Deduced a syphon composed of 3096 places in 13 ms
Applied a total of 6403 rules in 8945 ms. Remains 5600 /6702 variables (removed 1102) and now considering 6594/6002 (removed -592) transitions.
[2022-05-20 09:24:43] [INFO ] Redundant transitions in 313 ms returned []
// Phase 1: matrix 6594 rows 5600 cols
[2022-05-20 09:24:43] [INFO ] Computed 1101 place invariants in 135 ms
[2022-05-20 09:24:47] [INFO ] Dead Transitions using invariants and state equation in 4523 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5600/6702 places, 6594/6002 transitions.
Finished structural reductions, in 1 iterations. Remains : 5600/6702 places, 6594/6002 transitions.
Product exploration explored 100000 steps with 33251 reset in 3309 ms.
Product exploration explored 100000 steps with 33468 reset in 3311 ms.
Built C files in :
/tmp/ltsmin70940844223998181
[2022-05-20 09:24:54] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin70940844223998181
Running compilation step : cd /tmp/ltsmin70940844223998181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin70940844223998181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin70940844223998181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 997 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:24:58] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:25:00] [INFO ] Implicit Places using invariants in 2252 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:25:01] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 09:25:03] [INFO ] Implicit Places using invariants and state equation in 2229 ms returned []
Implicit Place search using SMT with State Equation took 4492 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:25:03] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:25:07] [INFO ] Dead Transitions using invariants and state equation in 4110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6702 places, 6002/6002 transitions.
Built C files in :
/tmp/ltsmin10712459503518259704
[2022-05-20 09:25:07] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10712459503518259704
Running compilation step : cd /tmp/ltsmin10712459503518259704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10712459503518259704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10712459503518259704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:25:11] [INFO ] Flatten gal took : 173 ms
[2022-05-20 09:25:11] [INFO ] Flatten gal took : 191 ms
[2022-05-20 09:25:11] [INFO ] Time to serialize gal into /tmp/LTL16903302142976136547.gal : 78 ms
[2022-05-20 09:25:11] [INFO ] Time to serialize properties into /tmp/LTL8355120394234541152.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16903302142976136547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8355120394234541152.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1690330...267
Read 1 LTL properties
Checking formula 0 : !((G(("(p7682==1)")U(X(!(((F("(p5097==1)"))&&(X("(p7682==1)")))&&("(((p3436==1)&&(p3438==1))||(p5097==1))")))))))
Formula 0 simplified : !G("(p7682==1)" U X!("(((p3436==1)&&(p3438==1))||(p5097==1))" & F"(p5097==1)" & X"(p7682==1)"))
Detected timeout of ITS tools.
[2022-05-20 09:25:26] [INFO ] Flatten gal took : 151 ms
[2022-05-20 09:25:26] [INFO ] Applying decomposition
[2022-05-20 09:25:27] [INFO ] Flatten gal took : 151 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11580049612382852338.txt' '-o' '/tmp/graph11580049612382852338.bin' '-w' '/tmp/graph11580049612382852338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11580049612382852338.bin' '-l' '-1' '-v' '-w' '/tmp/graph11580049612382852338.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:25:28] [INFO ] Decomposing Gal with order
[2022-05-20 09:25:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:25:30] [INFO ] Removed a total of 993 redundant transitions.
[2022-05-20 09:25:30] [INFO ] Flatten gal took : 418 ms
[2022-05-20 09:25:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 54 ms.
[2022-05-20 09:25:30] [INFO ] Time to serialize gal into /tmp/LTL961286092567580288.gal : 87 ms
[2022-05-20 09:25:30] [INFO ] Time to serialize properties into /tmp/LTL1223008442508152589.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL961286092567580288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1223008442508152589.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9612860...244
Read 1 LTL properties
Checking formula 0 : !((G(("(i66.u2365.p7682==1)")U(X(!(((F("(i46.i1.i8.u1572.p5097==1)"))&&(X("(i66.u2365.p7682==1)")))&&("(((i33.i1.i1.u1066.p3436==1)&&(...218
Formula 0 simplified : !G("(i66.u2365.p7682==1)" U X!("(((i33.i1.i1.u1066.p3436==1)&&(i33.i1.i1.u1066.p3438==1))||(i46.i1.i8.u1572.p5097==1))" & F"(i46.i1....202
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1460605288583138668
[2022-05-20 09:25:45] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1460605288583138668
Running compilation step : cd /tmp/ltsmin1460605288583138668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1460605288583138668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1460605288583138668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-06 finished in 252263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))||G(p1))))'
Support contains 2 out of 6707 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1401 transitions
Trivial Post-agglo rules discarded 1401 transitions
Performed 1401 trivial Post agglomeration. Transition count delta: 1401
Iterating post reduction 0 with 1401 rules applied. Total rules applied 1401 place count 6706 transition count 4605
Reduce places removed 1401 places and 0 transitions.
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2802 place count 5305 transition count 4605
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2802 place count 5305 transition count 3809
Deduced a syphon composed of 796 places in 12 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 4394 place count 4509 transition count 3809
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 4397 place count 4506 transition count 3806
Iterating global reduction 2 with 3 rules applied. Total rules applied 4400 place count 4506 transition count 3806
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4400 place count 4506 transition count 3803
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 4406 place count 4503 transition count 3803
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7802 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7805 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8007 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8209 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8403 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8405 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8406 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8406 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8410 place count 2500 transition count 2099
Applied a total of 8410 rules in 2241 ms. Remains 2500 /6707 variables (removed 4207) and now considering 2099/6007 (removed 3908) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:25:51] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 09:25:52] [INFO ] Implicit Places using invariants in 1593 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1597 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6707 places, 2099/6007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 180 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:25:53] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:25:54] [INFO ] Implicit Places using invariants in 1647 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:25:54] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:25:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:25:58] [INFO ] Implicit Places using invariants and state equation in 3458 ms returned []
Implicit Place search using SMT with State Equation took 5106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6707 places, 2097/6007 transitions.
Finished structural reductions, in 2 iterations. Remains : 2496/6707 places, 2097/6007 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s1571 1), p0:(EQ s2248 0)], nbAcceptance=2, 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 0 reset in 1483 ms.
Product exploration explored 100000 steps with 0 reset in 2104 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2496 stabilizing places and 2/2097 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 379 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:02] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:26:03] [INFO ] [Real]Absence check using 1098 positive place invariants in 187 ms returned sat
[2022-05-20 09:26:04] [INFO ] After 1522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:26:04] [INFO ] [Nat]Absence check using 1098 positive place invariants in 185 ms returned sat
[2022-05-20 09:26:05] [INFO ] After 1114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:26:06] [INFO ] After 155ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-20 09:26:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-20 09:26:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2022-05-20 09:26:06] [INFO ] After 682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2022-05-20 09:26:06] [INFO ] After 2502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 77 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 76660 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76660 steps, saw 54935 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:10] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:26:10] [INFO ] [Real]Absence check using 1098 positive place invariants in 199 ms returned sat
[2022-05-20 09:26:12] [INFO ] After 1619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:26:12] [INFO ] [Nat]Absence check using 1098 positive place invariants in 199 ms returned sat
[2022-05-20 09:26:13] [INFO ] After 1170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:26:13] [INFO ] After 157ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-20 09:26:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-20 09:26:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2022-05-20 09:26:14] [INFO ] After 646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2022-05-20 09:26:14] [INFO ] After 2564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 75 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 76 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:14] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:26:16] [INFO ] Implicit Places using invariants in 1706 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:16] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:26:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:26:20] [INFO ] Implicit Places using invariants and state equation in 3620 ms returned []
Implicit Place search using SMT with State Equation took 5333 ms to find 0 implicit places.
[2022-05-20 09:26:20] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:20] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:26:21] [INFO ] Dead Transitions using invariants and state equation in 1459 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 180 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:21] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:26:22] [INFO ] [Real]Absence check using 1098 positive place invariants in 200 ms returned sat
[2022-05-20 09:26:23] [INFO ] After 1658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:26:24] [INFO ] [Nat]Absence check using 1098 positive place invariants in 197 ms returned sat
[2022-05-20 09:26:25] [INFO ] After 1148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-20 09:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-20 09:26:25] [INFO ] After 1520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-05-20 09:26:25] [INFO ] After 2263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 315 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 84 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:26] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:26:27] [INFO ] Implicit Places using invariants in 1678 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:27] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:26:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:26:31] [INFO ] Implicit Places using invariants and state equation in 3311 ms returned []
Implicit Place search using SMT with State Equation took 4995 ms to find 0 implicit places.
[2022-05-20 09:26:31] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:31] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:26:32] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2496 stabilizing places and 2/2097 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 364 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:33] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:26:34] [INFO ] [Real]Absence check using 1098 positive place invariants in 189 ms returned sat
[2022-05-20 09:26:35] [INFO ] After 1531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:26:35] [INFO ] [Nat]Absence check using 1098 positive place invariants in 186 ms returned sat
[2022-05-20 09:26:36] [INFO ] After 1122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:26:36] [INFO ] After 155ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-20 09:26:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
[2022-05-20 09:26:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2022-05-20 09:26:37] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 155 ms.
[2022-05-20 09:26:37] [INFO ] After 2448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 74 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 72 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 78789 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78789 steps, saw 56554 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:41] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:26:41] [INFO ] [Real]Absence check using 1098 positive place invariants in 198 ms returned sat
[2022-05-20 09:26:42] [INFO ] After 1604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:26:43] [INFO ] [Nat]Absence check using 1098 positive place invariants in 248 ms returned sat
[2022-05-20 09:26:44] [INFO ] After 1132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:26:44] [INFO ] After 155ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-20 09:26:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-20 09:26:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2022-05-20 09:26:45] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-05-20 09:26:45] [INFO ] After 2545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 93 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 75 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 75 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:45] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:26:47] [INFO ] Implicit Places using invariants in 1681 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:47] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:26:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:26:50] [INFO ] Implicit Places using invariants and state equation in 3612 ms returned []
Implicit Place search using SMT with State Equation took 5299 ms to find 0 implicit places.
[2022-05-20 09:26:50] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:50] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:26:52] [INFO ] Dead Transitions using invariants and state equation in 1342 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 181 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:26:52] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:26:53] [INFO ] [Real]Absence check using 1098 positive place invariants in 199 ms returned sat
[2022-05-20 09:26:54] [INFO ] After 1594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:26:54] [INFO ] [Nat]Absence check using 1098 positive place invariants in 208 ms returned sat
[2022-05-20 09:26:55] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:26:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-20 09:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-20 09:26:56] [INFO ] After 1489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-05-20 09:26:56] [INFO ] After 2228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 423 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1422 ms.
Product exploration explored 100000 steps with 0 reset in 1896 ms.
Built C files in :
/tmp/ltsmin10644234411264042228
[2022-05-20 09:27:00] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2022-05-20 09:27:00] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10644234411264042228
Running compilation step : cd /tmp/ltsmin10644234411264042228;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10644234411264042228;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10644234411264042228;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 75 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:27:03] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:27:04] [INFO ] Implicit Places using invariants in 1637 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:27:04] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:27:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:27:08] [INFO ] Implicit Places using invariants and state equation in 3453 ms returned []
Implicit Place search using SMT with State Equation took 5094 ms to find 0 implicit places.
[2022-05-20 09:27:08] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:27:08] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:27:09] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Built C files in :
/tmp/ltsmin2930873102880760504
[2022-05-20 09:27:10] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2022-05-20 09:27:10] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2930873102880760504
Running compilation step : cd /tmp/ltsmin2930873102880760504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2930873102880760504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2930873102880760504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:27:13] [INFO ] Flatten gal took : 103 ms
[2022-05-20 09:27:13] [INFO ] Flatten gal took : 94 ms
[2022-05-20 09:27:13] [INFO ] Time to serialize gal into /tmp/LTL7850726658153995204.gal : 7 ms
[2022-05-20 09:27:13] [INFO ] Time to serialize properties into /tmp/LTL4008544956272983579.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7850726658153995204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4008544956272983579.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7850726...266
Read 1 LTL properties
Checking formula 0 : !((F((G(X("(p6999==0)")))||(G("(p4917==1)")))))
Formula 0 simplified : !F(GX"(p6999==0)" | G"(p4917==1)")
Detected timeout of ITS tools.
[2022-05-20 09:27:28] [INFO ] Flatten gal took : 58 ms
[2022-05-20 09:27:28] [INFO ] Applying decomposition
[2022-05-20 09:27:28] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7342958323057255545.txt' '-o' '/tmp/graph7342958323057255545.bin' '-w' '/tmp/graph7342958323057255545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7342958323057255545.bin' '-l' '-1' '-v' '-w' '/tmp/graph7342958323057255545.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:27:29] [INFO ] Decomposing Gal with order
[2022-05-20 09:27:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:27:29] [INFO ] Removed a total of 608 redundant transitions.
[2022-05-20 09:27:29] [INFO ] Flatten gal took : 156 ms
[2022-05-20 09:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 25 ms.
[2022-05-20 09:27:29] [INFO ] Time to serialize gal into /tmp/LTL14751143483386730601.gal : 19 ms
[2022-05-20 09:27:29] [INFO ] Time to serialize properties into /tmp/LTL5866239685072030858.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14751143483386730601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5866239685072030858.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1475114...246
Read 1 LTL properties
Checking formula 0 : !((F((G(X("(i39.i1.i0.u721.p6999==0)")))||(G("(i27.i1.i2.u504.p4917==1)")))))
Formula 0 simplified : !F(GX"(i39.i1.i0.u721.p6999==0)" | G"(i27.i1.i2.u504.p4917==1)")
Reverse transition relation is NOT exact ! Due to transitions i39.i1.t267, i39.i1.t268, i39.i1.i0.u721.t300, i40.i0.t271, Intersection with reachable at e...223
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7997774664329226744
[2022-05-20 09:27:44] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7997774664329226744
Running compilation step : cd /tmp/ltsmin7997774664329226744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7997774664329226744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7997774664329226744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-07 finished in 118727 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(X(p0) U G(p1))&&G(p2))))'
Support contains 2 out of 6707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6701 transition count 6001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6701 transition count 6001
Applied a total of 12 rules in 1998 ms. Remains 6701 /6707 variables (removed 6) and now considering 6001/6007 (removed 6) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:27:50] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 09:27:52] [INFO ] Implicit Places using invariants in 2208 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:27:52] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 09:27:54] [INFO ] Implicit Places using invariants and state equation in 2327 ms returned []
Implicit Place search using SMT with State Equation took 4541 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:27:54] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 09:27:59] [INFO ] Dead Transitions using invariants and state equation in 4359 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6707 places, 6001/6007 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6707 places, 6001/6007 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s5621 0), p1:(EQ s2308 1), p0:(EQ s5621 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 1598 ms.
Product exploration explored 100000 steps with 1 reset in 2040 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6701 stabilizing places and 1598/6001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 573 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:28:04] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:28:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 711 ms returned sat
[2022-05-20 09:28:12] [INFO ] After 7836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:28:13] [INFO ] [Nat]Absence check using 1101 positive place invariants in 754 ms returned sat
[2022-05-20 09:28:20] [INFO ] After 6444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:28:22] [INFO ] Deduced a trap composed of 21 places in 2115 ms of which 3 ms to minimize.
[2022-05-20 09:28:25] [INFO ] Deduced a trap composed of 18 places in 2088 ms of which 3 ms to minimize.
[2022-05-20 09:28:27] [INFO ] Deduced a trap composed of 24 places in 2073 ms of which 3 ms to minimize.
[2022-05-20 09:28:29] [INFO ] Deduced a trap composed of 23 places in 2120 ms of which 4 ms to minimize.
[2022-05-20 09:28:32] [INFO ] Deduced a trap composed of 24 places in 2120 ms of which 4 ms to minimize.
[2022-05-20 09:28:34] [INFO ] Deduced a trap composed of 27 places in 2129 ms of which 3 ms to minimize.
[2022-05-20 09:28:36] [INFO ] Deduced a trap composed of 19 places in 2045 ms of which 4 ms to minimize.
[2022-05-20 09:28:39] [INFO ] Deduced a trap composed of 16 places in 2077 ms of which 3 ms to minimize.
[2022-05-20 09:28:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:28:39] [INFO ] After 26895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 507 ms.
Support contains 2 out of 6701 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6701 transition count 4602
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5302 transition count 4602
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2798 place count 5302 transition count 3802
Deduced a syphon composed of 800 places in 12 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4398 place count 4502 transition count 3802
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 5 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7794 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7795 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7797 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7999 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8201 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8395 place count 2504 transition count 2102
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8694 place count 2504 transition count 2102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8695 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8696 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8696 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8700 place count 2500 transition count 2099
Applied a total of 8700 rules in 1610 ms. Remains 2500 /6701 variables (removed 4201) and now considering 2099/6001 (removed 3902) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/6701 places, 2099/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 58502 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58502 steps, saw 39891 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:28:44] [INFO ] Computed 1100 place invariants in 9 ms
[2022-05-20 09:28:45] [INFO ] [Real]Absence check using 1100 positive place invariants in 197 ms returned sat
[2022-05-20 09:28:46] [INFO ] After 1858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:28:47] [INFO ] [Nat]Absence check using 1100 positive place invariants in 199 ms returned sat
[2022-05-20 09:28:48] [INFO ] After 1256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:28:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 09:28:48] [INFO ] After 236ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:28:49] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2022-05-20 09:28:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2022-05-20 09:28:49] [INFO ] After 895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 239 ms.
[2022-05-20 09:28:49] [INFO ] After 3060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 165 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 77 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2099/2099 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 80 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:28:50] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 09:28:51] [INFO ] Implicit Places using invariants in 1638 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1641 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2498/2500 places, 2099/2099 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2496 transition count 2097
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 151 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:28:51] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:28:53] [INFO ] Implicit Places using invariants in 1608 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:28:53] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:28:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:28:57] [INFO ] Implicit Places using invariants and state equation in 3698 ms returned []
Implicit Place search using SMT with State Equation took 5308 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2496/2500 places, 2097/2099 transitions.
Finished structural reductions, in 2 iterations. Remains : 2496/2500 places, 2097/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 65494 steps, run timeout after 3025 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65494 steps, saw 47266 distinct states, run finished after 3025 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:29:00] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:29:01] [INFO ] [Real]Absence check using 1098 positive place invariants in 186 ms returned sat
[2022-05-20 09:29:02] [INFO ] After 1934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:29:03] [INFO ] [Nat]Absence check using 1098 positive place invariants in 192 ms returned sat
[2022-05-20 09:29:04] [INFO ] After 1221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:29:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:29:04] [INFO ] After 232ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:29:05] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2022-05-20 09:29:05] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2022-05-20 09:29:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 553 ms
[2022-05-20 09:29:05] [INFO ] After 1097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 239 ms.
[2022-05-20 09:29:06] [INFO ] After 3165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 144 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 77 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 79 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:29:06] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:29:08] [INFO ] Implicit Places using invariants in 1765 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:29:08] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:29:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:29:11] [INFO ] Implicit Places using invariants and state equation in 3704 ms returned []
Implicit Place search using SMT with State Equation took 5470 ms to find 0 implicit places.
[2022-05-20 09:29:11] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:29:11] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:29:13] [INFO ] Dead Transitions using invariants and state equation in 1454 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2496 transition count 2097
Applied a total of 596 rules in 183 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:29:13] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:29:14] [INFO ] [Real]Absence check using 1098 positive place invariants in 203 ms returned sat
[2022-05-20 09:29:15] [INFO ] After 1285ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-20 09:29:15] [INFO ] State equation strengthened by 592 read => feed constraints.
[2022-05-20 09:29:15] [INFO ] After 192ms SMT Verify possible using 592 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:29:15] [INFO ] After 2177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:29:16] [INFO ] [Nat]Absence check using 1098 positive place invariants in 200 ms returned sat
[2022-05-20 09:29:17] [INFO ] After 1269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:29:18] [INFO ] After 635ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:29:19] [INFO ] Deduced a trap composed of 5 places in 627 ms of which 2 ms to minimize.
[2022-05-20 09:29:19] [INFO ] Deduced a trap composed of 5 places in 624 ms of which 1 ms to minimize.
[2022-05-20 09:29:20] [INFO ] Deduced a trap composed of 5 places in 629 ms of which 2 ms to minimize.
[2022-05-20 09:29:21] [INFO ] Deduced a trap composed of 5 places in 623 ms of which 2 ms to minimize.
[2022-05-20 09:29:22] [INFO ] Deduced a trap composed of 7 places in 628 ms of which 2 ms to minimize.
[2022-05-20 09:29:22] [INFO ] Deduced a trap composed of 5 places in 634 ms of which 1 ms to minimize.
[2022-05-20 09:29:23] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 1 ms to minimize.
[2022-05-20 09:29:24] [INFO ] Deduced a trap composed of 7 places in 640 ms of which 2 ms to minimize.
[2022-05-20 09:29:25] [INFO ] Deduced a trap composed of 5 places in 650 ms of which 2 ms to minimize.
[2022-05-20 09:29:25] [INFO ] Deduced a trap composed of 5 places in 628 ms of which 1 ms to minimize.
[2022-05-20 09:29:26] [INFO ] Deduced a trap composed of 5 places in 644 ms of which 1 ms to minimize.
[2022-05-20 09:29:27] [INFO ] Deduced a trap composed of 5 places in 613 ms of which 1 ms to minimize.
[2022-05-20 09:29:28] [INFO ] Deduced a trap composed of 9 places in 644 ms of which 2 ms to minimize.
[2022-05-20 09:29:28] [INFO ] Deduced a trap composed of 7 places in 604 ms of which 1 ms to minimize.
[2022-05-20 09:29:29] [INFO ] Deduced a trap composed of 5 places in 645 ms of which 2 ms to minimize.
[2022-05-20 09:29:30] [INFO ] Deduced a trap composed of 13 places in 639 ms of which 1 ms to minimize.
[2022-05-20 09:29:31] [INFO ] Deduced a trap composed of 5 places in 632 ms of which 1 ms to minimize.
[2022-05-20 09:29:31] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 12787 ms
[2022-05-20 09:29:31] [INFO ] After 13932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 467 ms.
[2022-05-20 09:29:32] [INFO ] After 16352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F p0)]
Knowledge based reduction with 13 factoid took 584 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Support contains 2 out of 6701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 974 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:29:34] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 09:29:36] [INFO ] Implicit Places using invariants in 2328 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:29:36] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 09:29:38] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 4534 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:29:38] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:29:42] [INFO ] Dead Transitions using invariants and state equation in 3957 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6701 places, 6001/6001 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6701 stabilizing places and 1598/6001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p1))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 521 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:29:43] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 09:29:45] [INFO ] [Real]Absence check using 1101 positive place invariants in 693 ms returned sat
[2022-05-20 09:29:51] [INFO ] After 7498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:29:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 667 ms returned sat
[2022-05-20 09:29:58] [INFO ] After 5906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:30:01] [INFO ] Deduced a trap composed of 21 places in 2149 ms of which 3 ms to minimize.
[2022-05-20 09:30:03] [INFO ] Deduced a trap composed of 18 places in 2091 ms of which 3 ms to minimize.
[2022-05-20 09:30:05] [INFO ] Deduced a trap composed of 24 places in 2085 ms of which 3 ms to minimize.
[2022-05-20 09:30:08] [INFO ] Deduced a trap composed of 23 places in 2148 ms of which 3 ms to minimize.
[2022-05-20 09:30:10] [INFO ] Deduced a trap composed of 24 places in 2093 ms of which 3 ms to minimize.
[2022-05-20 09:30:12] [INFO ] Deduced a trap composed of 27 places in 2005 ms of which 3 ms to minimize.
[2022-05-20 09:30:15] [INFO ] Deduced a trap composed of 19 places in 2051 ms of which 3 ms to minimize.
[2022-05-20 09:30:17] [INFO ] Deduced a trap composed of 16 places in 2037 ms of which 3 ms to minimize.
[2022-05-20 09:30:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:30:17] [INFO ] After 25999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 575 ms.
Support contains 2 out of 6701 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6701 transition count 4602
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5302 transition count 4602
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2798 place count 5302 transition count 3802
Deduced a syphon composed of 800 places in 12 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4398 place count 4502 transition count 3802
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 5 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7794 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7795 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7797 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7999 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8201 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8395 place count 2504 transition count 2102
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8694 place count 2504 transition count 2102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8695 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8696 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8696 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8700 place count 2500 transition count 2099
Applied a total of 8700 rules in 1691 ms. Remains 2500 /6701 variables (removed 4201) and now considering 2099/6001 (removed 3902) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/6701 places, 2099/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 62125 steps, run timeout after 3012 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62125 steps, saw 42151 distinct states, run finished after 3012 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:30:23] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 09:30:23] [INFO ] [Real]Absence check using 1100 positive place invariants in 185 ms returned sat
[2022-05-20 09:30:25] [INFO ] After 1881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:30:25] [INFO ] [Nat]Absence check using 1100 positive place invariants in 216 ms returned sat
[2022-05-20 09:30:26] [INFO ] After 1170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:30:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 09:30:27] [INFO ] After 226ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:30:27] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2022-05-20 09:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2022-05-20 09:30:27] [INFO ] After 903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 234 ms.
[2022-05-20 09:30:28] [INFO ] After 2972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 318 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2099/2099 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:30:28] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 09:30:30] [INFO ] Implicit Places using invariants in 1664 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1676 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2498/2500 places, 2099/2099 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2496 transition count 2097
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 146 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:30:30] [INFO ] Computed 1098 place invariants in 18 ms
[2022-05-20 09:30:32] [INFO ] Implicit Places using invariants in 1658 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:30:32] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:30:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:30:35] [INFO ] Implicit Places using invariants and state equation in 3536 ms returned []
Implicit Place search using SMT with State Equation took 5217 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2496/2500 places, 2097/2099 transitions.
Finished structural reductions, in 2 iterations. Remains : 2496/2500 places, 2097/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 59172 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59172 steps, saw 42829 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:30:39] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:30:39] [INFO ] [Real]Absence check using 1098 positive place invariants in 184 ms returned sat
[2022-05-20 09:30:41] [INFO ] After 1874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:30:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 185 ms returned sat
[2022-05-20 09:30:42] [INFO ] After 1176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:30:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:30:43] [INFO ] After 225ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:30:43] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2022-05-20 09:30:43] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 0 ms to minimize.
[2022-05-20 09:30:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 595 ms
[2022-05-20 09:30:44] [INFO ] After 1160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 227 ms.
[2022-05-20 09:30:44] [INFO ] After 3210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 129 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 75 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 74 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:30:44] [INFO ] Computed 1098 place invariants in 25 ms
[2022-05-20 09:30:46] [INFO ] Implicit Places using invariants in 1843 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:30:46] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:30:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:30:49] [INFO ] Implicit Places using invariants and state equation in 3506 ms returned []
Implicit Place search using SMT with State Equation took 5372 ms to find 0 implicit places.
[2022-05-20 09:30:50] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:30:50] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:30:51] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2496 transition count 2097
Applied a total of 596 rules in 200 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:30:51] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:30:52] [INFO ] [Real]Absence check using 1098 positive place invariants in 183 ms returned sat
[2022-05-20 09:30:53] [INFO ] After 1224ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-20 09:30:53] [INFO ] State equation strengthened by 592 read => feed constraints.
[2022-05-20 09:30:53] [INFO ] After 190ms SMT Verify possible using 592 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:30:53] [INFO ] After 2099ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:30:54] [INFO ] [Nat]Absence check using 1098 positive place invariants in 187 ms returned sat
[2022-05-20 09:30:55] [INFO ] After 1204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:30:56] [INFO ] After 581ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:30:56] [INFO ] Deduced a trap composed of 5 places in 626 ms of which 2 ms to minimize.
[2022-05-20 09:30:57] [INFO ] Deduced a trap composed of 5 places in 639 ms of which 1 ms to minimize.
[2022-05-20 09:30:58] [INFO ] Deduced a trap composed of 5 places in 624 ms of which 2 ms to minimize.
[2022-05-20 09:30:59] [INFO ] Deduced a trap composed of 5 places in 605 ms of which 1 ms to minimize.
[2022-05-20 09:30:59] [INFO ] Deduced a trap composed of 7 places in 668 ms of which 2 ms to minimize.
[2022-05-20 09:31:00] [INFO ] Deduced a trap composed of 5 places in 623 ms of which 1 ms to minimize.
[2022-05-20 09:31:01] [INFO ] Deduced a trap composed of 5 places in 614 ms of which 1 ms to minimize.
[2022-05-20 09:31:01] [INFO ] Deduced a trap composed of 7 places in 605 ms of which 1 ms to minimize.
[2022-05-20 09:31:02] [INFO ] Deduced a trap composed of 5 places in 603 ms of which 1 ms to minimize.
[2022-05-20 09:31:03] [INFO ] Deduced a trap composed of 5 places in 602 ms of which 1 ms to minimize.
[2022-05-20 09:31:04] [INFO ] Deduced a trap composed of 5 places in 600 ms of which 1 ms to minimize.
[2022-05-20 09:31:04] [INFO ] Deduced a trap composed of 5 places in 605 ms of which 2 ms to minimize.
[2022-05-20 09:31:05] [INFO ] Deduced a trap composed of 9 places in 610 ms of which 1 ms to minimize.
[2022-05-20 09:31:06] [INFO ] Deduced a trap composed of 7 places in 598 ms of which 1 ms to minimize.
[2022-05-20 09:31:06] [INFO ] Deduced a trap composed of 5 places in 591 ms of which 2 ms to minimize.
[2022-05-20 09:31:07] [INFO ] Deduced a trap composed of 13 places in 634 ms of which 1 ms to minimize.
[2022-05-20 09:31:08] [INFO ] Deduced a trap composed of 5 places in 595 ms of which 1 ms to minimize.
[2022-05-20 09:31:08] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 12354 ms
[2022-05-20 09:31:08] [INFO ] After 13406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 439 ms.
[2022-05-20 09:31:09] [INFO ] After 15704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p1))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F p0)]
Knowledge based reduction with 13 factoid took 672 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Product exploration explored 100000 steps with 2 reset in 1355 ms.
Product exploration explored 100000 steps with 1 reset in 1781 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Support contains 2 out of 6701 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Performed 1399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6701 transition count 6001
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 500 Pre rules applied. Total rules applied 1399 place count 6701 transition count 6401
Deduced a syphon composed of 1899 places in 20 ms
Iterating global reduction 1 with 500 rules applied. Total rules applied 1899 place count 6701 transition count 6401
Performed 1898 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3797 places in 23 ms
Iterating global reduction 1 with 1898 rules applied. Total rules applied 3797 place count 6701 transition count 6401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3798 place count 6701 transition count 6400
Renaming transitions due to excessive name length > 1024 char.
Discarding 701 places :
Symmetric choice reduction at 2 with 701 rule applications. Total rules 4499 place count 6000 transition count 5699
Deduced a syphon composed of 3096 places in 20 ms
Iterating global reduction 2 with 701 rules applied. Total rules applied 5200 place count 6000 transition count 5699
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3097 places in 19 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5201 place count 6000 transition count 5699
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5203 place count 5998 transition count 5697
Deduced a syphon composed of 3095 places in 20 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5205 place count 5998 transition count 5697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3196 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5306 place count 5998 transition count 6127
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5407 place count 5897 transition count 5925
Deduced a syphon composed of 3095 places in 19 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5508 place count 5897 transition count 5925
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3196 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5609 place count 5897 transition count 6352
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5710 place count 5796 transition count 6150
Deduced a syphon composed of 3095 places in 19 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5811 place count 5796 transition count 6150
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3196 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5912 place count 5796 transition count 6580
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6013 place count 5695 transition count 6378
Deduced a syphon composed of 3095 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6114 place count 5695 transition count 6378
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -408
Deduced a syphon composed of 3191 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6210 place count 5695 transition count 6786
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6306 place count 5599 transition count 6594
Deduced a syphon composed of 3095 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6402 place count 5599 transition count 6594
Deduced a syphon composed of 3095 places in 12 ms
Applied a total of 6402 rules in 7748 ms. Remains 5599 /6701 variables (removed 1102) and now considering 6594/6001 (removed -593) transitions.
[2022-05-20 09:31:21] [INFO ] Redundant transitions in 323 ms returned []
// Phase 1: matrix 6594 rows 5599 cols
[2022-05-20 09:31:22] [INFO ] Computed 1101 place invariants in 156 ms
[2022-05-20 09:31:26] [INFO ] Dead Transitions using invariants and state equation in 4297 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5599/6701 places, 6594/6001 transitions.
Finished structural reductions, in 1 iterations. Remains : 5599/6701 places, 6594/6001 transitions.
Product exploration explored 100000 steps with 5 reset in 1357 ms.
Product exploration explored 100000 steps with 0 reset in 1831 ms.
Built C files in :
/tmp/ltsmin14540349084873314661
[2022-05-20 09:31:29] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14540349084873314661
Running compilation step : cd /tmp/ltsmin14540349084873314661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14540349084873314661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14540349084873314661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 6701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 1047 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:31:33] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 09:31:37] [INFO ] Implicit Places using invariants in 3951 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:31:37] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:31:41] [INFO ] Implicit Places using invariants and state equation in 4022 ms returned []
Implicit Place search using SMT with State Equation took 7983 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:31:41] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 09:31:42] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6701 places, 6001/6001 transitions.
Built C files in :
/tmp/ltsmin1010483965635747159
[2022-05-20 09:31:42] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1010483965635747159
Running compilation step : cd /tmp/ltsmin1010483965635747159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1010483965635747159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1010483965635747159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:31:46] [INFO ] Flatten gal took : 285 ms
[2022-05-20 09:31:46] [INFO ] Flatten gal took : 486 ms
[2022-05-20 09:31:46] [INFO ] Time to serialize gal into /tmp/LTL1795108471645666262.gal : 51 ms
[2022-05-20 09:31:46] [INFO ] Time to serialize properties into /tmp/LTL17643189451560836415.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1795108471645666262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17643189451560836415.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1795108...267
Read 1 LTL properties
Checking formula 0 : !((F((!((X("(p6537==1)"))U(G("(p2671==1)"))))&&(G("(p6537==0)")))))
Formula 0 simplified : !F(!(X"(p6537==1)" U G"(p2671==1)") & G"(p6537==0)")
Detected timeout of ITS tools.
[2022-05-20 09:32:02] [INFO ] Flatten gal took : 141 ms
[2022-05-20 09:32:02] [INFO ] Applying decomposition
[2022-05-20 09:32:02] [INFO ] Flatten gal took : 158 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7192418187591611482.txt' '-o' '/tmp/graph7192418187591611482.bin' '-w' '/tmp/graph7192418187591611482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7192418187591611482.bin' '-l' '-1' '-v' '-w' '/tmp/graph7192418187591611482.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:32:02] [INFO ] Decomposing Gal with order
[2022-05-20 09:32:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:32:06] [INFO ] Removed a total of 994 redundant transitions.
[2022-05-20 09:32:06] [INFO ] Flatten gal took : 439 ms
[2022-05-20 09:32:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 45 ms.
[2022-05-20 09:32:06] [INFO ] Time to serialize gal into /tmp/LTL6651261371367047759.gal : 64 ms
[2022-05-20 09:32:06] [INFO ] Time to serialize properties into /tmp/LTL6781122013124907024.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6651261371367047759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6781122013124907024.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6651261...245
Read 1 LTL properties
Checking formula 0 : !((F((!((X("(i59.u2002.p6537==1)"))U(G("(i25.u827.p2671==1)"))))&&(G("(i59.u2002.p6537==0)")))))
Formula 0 simplified : !F(!(X"(i59.u2002.p6537==1)" U G"(i25.u827.p2671==1)") & G"(i59.u2002.p6537==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8633048407786699672
[2022-05-20 09:32:22] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8633048407786699672
Running compilation step : cd /tmp/ltsmin8633048407786699672;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8633048407786699672;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8633048407786699672;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-08 finished in 277363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G((F(G(p0))&&G(p1))))) U G((X(p2)||p3))))'
Support contains 5 out of 6707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6701 transition count 6001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6701 transition count 6001
Applied a total of 12 rules in 1872 ms. Remains 6701 /6707 variables (removed 6) and now considering 6001/6007 (removed 6) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:32:26] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 09:32:30] [INFO ] Implicit Places using invariants in 3631 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:32:30] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 09:32:32] [INFO ] Implicit Places using invariants and state equation in 2371 ms returned []
Implicit Place search using SMT with State Equation took 6026 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:32:33] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:32:37] [INFO ] Dead Transitions using invariants and state equation in 4902 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6707 places, 6001/6007 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6707 places, 6001/6007 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s499 1), p2:(EQ s795 1), p1:(EQ s474 1), p0:(AND (EQ s3149 1) (EQ s3186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1460 ms.
Stack based approach found an accepted trace after 5217 steps with 0 reset with depth 5218 and stack size 5218 in 76 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-09 finished in 14740 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&!(p1 U p2)))'
Support contains 3 out of 6707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6702 transition count 6002
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6702 transition count 6002
Applied a total of 10 rules in 2001 ms. Remains 6702 /6707 variables (removed 5) and now considering 6002/6007 (removed 5) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:32:41] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:32:45] [INFO ] Implicit Places using invariants in 4082 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:32:45] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 09:32:46] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 4864 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:32:46] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:32:50] [INFO ] Dead Transitions using invariants and state equation in 3945 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6707 places, 6002/6007 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6707 places, 6002/6007 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) p2), true, p2, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s1138 1), p1:(EQ s3825 1), p0:(OR (EQ s3825 1) (EQ s3997 0))], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 2532 ms.
Product exploration explored 100000 steps with 25000 reset in 2519 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:32:56] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 09:32:57] [INFO ] [Real]Absence check using 1101 positive place invariants in 703 ms returned sat
[2022-05-20 09:33:03] [INFO ] After 5200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 09:33:05] [INFO ] Deduced a trap composed of 20 places in 2105 ms of which 3 ms to minimize.
[2022-05-20 09:33:07] [INFO ] Deduced a trap composed of 16 places in 2047 ms of which 3 ms to minimize.
[2022-05-20 09:33:10] [INFO ] Deduced a trap composed of 19 places in 2069 ms of which 4 ms to minimize.
[2022-05-20 09:33:12] [INFO ] Deduced a trap composed of 17 places in 2029 ms of which 3 ms to minimize.
[2022-05-20 09:33:14] [INFO ] Deduced a trap composed of 26 places in 2033 ms of which 4 ms to minimize.
[2022-05-20 09:33:16] [INFO ] Deduced a trap composed of 22 places in 1993 ms of which 3 ms to minimize.
[2022-05-20 09:33:19] [INFO ] Deduced a trap composed of 21 places in 2017 ms of which 3 ms to minimize.
[2022-05-20 09:33:21] [INFO ] Deduced a trap composed of 31 places in 2021 ms of which 4 ms to minimize.
[2022-05-20 09:33:23] [INFO ] Deduced a trap composed of 28 places in 1971 ms of which 3 ms to minimize.
[2022-05-20 09:33:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:33:23] [INFO ] After 26907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6702 transition count 4602
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5302 transition count 4602
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2800 place count 5302 transition count 3803
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4398 place count 4503 transition count 3803
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4399 place count 4502 transition count 3802
Iterating global reduction 2 with 1 rules applied. Total rules applied 4400 place count 4502 transition count 3802
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4400 place count 4502 transition count 3801
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4402 place count 4501 transition count 3801
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 5 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7800 place count 2802 transition count 2102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7801 place count 2802 transition count 2101
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7803 place count 2801 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8005 place count 2700 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8207 place count 2599 transition count 2100
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8401 place count 2502 transition count 2100
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 3 with 298 rules applied. Total rules applied 8699 place count 2502 transition count 2100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8700 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8701 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8701 place count 2500 transition count 2097
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8705 place count 2498 transition count 2097
Applied a total of 8705 rules in 1931 ms. Remains 2498 /6702 variables (removed 4204) and now considering 2097/6002 (removed 3905) transitions.
Finished structural reductions, in 1 iterations. Remains : 2498/6702 places, 2097/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Finished probabilistic random walk after 39401 steps, run visited all 1 properties in 1676 ms. (steps per millisecond=23 )
Probabilistic random walk after 39401 steps, saw 26723 distinct states, run finished after 1676 ms. (steps per millisecond=23 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 6702 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 928 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:33:28] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:33:31] [INFO ] Implicit Places using invariants in 2423 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:33:31] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 09:33:33] [INFO ] Implicit Places using invariants and state equation in 2293 ms returned []
Implicit Place search using SMT with State Equation took 4717 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:33:33] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 09:33:37] [INFO ] Dead Transitions using invariants and state equation in 4259 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6702 places, 6002/6002 transitions.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 877 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=109 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 2558 ms.
Product exploration explored 100000 steps with 25000 reset in 2595 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Performed 1399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6702 transition count 6002
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 499 Pre rules applied. Total rules applied 1399 place count 6702 transition count 6401
Deduced a syphon composed of 1898 places in 19 ms
Iterating global reduction 1 with 499 rules applied. Total rules applied 1898 place count 6702 transition count 6401
Performed 1900 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3798 places in 23 ms
Iterating global reduction 1 with 1900 rules applied. Total rules applied 3798 place count 6702 transition count 6401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3799 place count 6702 transition count 6400
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 2 with 702 rule applications. Total rules 4501 place count 6000 transition count 5698
Deduced a syphon composed of 3096 places in 21 ms
Iterating global reduction 2 with 702 rules applied. Total rules applied 5203 place count 6000 transition count 5698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3097 places in 29 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5204 place count 6000 transition count 5698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5206 place count 5998 transition count 5696
Deduced a syphon composed of 3095 places in 20 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5208 place count 5998 transition count 5696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3196 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5309 place count 5998 transition count 6126
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5410 place count 5897 transition count 5924
Deduced a syphon composed of 3095 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5511 place count 5897 transition count 5924
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3196 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5612 place count 5897 transition count 6351
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5713 place count 5796 transition count 6149
Deduced a syphon composed of 3095 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5814 place count 5796 transition count 6149
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 3196 places in 17 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5915 place count 5796 transition count 6577
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6016 place count 5695 transition count 6375
Deduced a syphon composed of 3095 places in 17 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6117 place count 5695 transition count 6375
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -408
Deduced a syphon composed of 3191 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6213 place count 5695 transition count 6783
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6309 place count 5599 transition count 6591
Deduced a syphon composed of 3095 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6405 place count 5599 transition count 6591
Deduced a syphon composed of 3095 places in 13 ms
Applied a total of 6405 rules in 7833 ms. Remains 5599 /6702 variables (removed 1103) and now considering 6591/6002 (removed -589) transitions.
[2022-05-20 09:33:52] [INFO ] Redundant transitions in 331 ms returned []
// Phase 1: matrix 6591 rows 5599 cols
[2022-05-20 09:33:52] [INFO ] Computed 1101 place invariants in 128 ms
[2022-05-20 09:33:56] [INFO ] Dead Transitions using invariants and state equation in 4297 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5599/6702 places, 6591/6002 transitions.
Finished structural reductions, in 1 iterations. Remains : 5599/6702 places, 6591/6002 transitions.
Product exploration timeout after 87790 steps with 21947 reset in 10002 ms.
Product exploration timeout after 87750 steps with 21937 reset in 10001 ms.
Built C files in :
/tmp/ltsmin1879224773264172430
[2022-05-20 09:34:16] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1879224773264172430
Running compilation step : cd /tmp/ltsmin1879224773264172430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1879224773264172430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1879224773264172430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 903 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:34:20] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 09:34:24] [INFO ] Implicit Places using invariants in 3781 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:34:24] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 09:34:27] [INFO ] Implicit Places using invariants and state equation in 2399 ms returned []
Implicit Place search using SMT with State Equation took 6193 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:34:27] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:34:31] [INFO ] Dead Transitions using invariants and state equation in 4299 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6702 places, 6002/6002 transitions.
Built C files in :
/tmp/ltsmin2893777714506611759
[2022-05-20 09:34:31] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2893777714506611759
Running compilation step : cd /tmp/ltsmin2893777714506611759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2893777714506611759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2893777714506611759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:34:34] [INFO ] Flatten gal took : 167 ms
[2022-05-20 09:34:35] [INFO ] Flatten gal took : 166 ms
[2022-05-20 09:34:35] [INFO ] Time to serialize gal into /tmp/LTL3765515440836475070.gal : 17 ms
[2022-05-20 09:34:35] [INFO ] Time to serialize properties into /tmp/LTL375041901326117637.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3765515440836475070.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL375041901326117637.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3765515...265
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F("((p4441==1)||(p4645==0))")))))&&(!(("(p4441==1)")U("(p1307==1)")))))
Formula 0 simplified : !(XXXF"((p4441==1)||(p4645==0))" & !("(p4441==1)" U "(p1307==1)"))
Detected timeout of ITS tools.
[2022-05-20 09:34:50] [INFO ] Flatten gal took : 154 ms
[2022-05-20 09:34:50] [INFO ] Applying decomposition
[2022-05-20 09:34:50] [INFO ] Flatten gal took : 170 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph410598966453579173.txt' '-o' '/tmp/graph410598966453579173.bin' '-w' '/tmp/graph410598966453579173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph410598966453579173.bin' '-l' '-1' '-v' '-w' '/tmp/graph410598966453579173.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:34:50] [INFO ] Decomposing Gal with order
[2022-05-20 09:34:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:34:52] [INFO ] Removed a total of 989 redundant transitions.
[2022-05-20 09:34:52] [INFO ] Flatten gal took : 242 ms
[2022-05-20 09:34:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2022-05-20 09:34:52] [INFO ] Time to serialize gal into /tmp/LTL288222400548711940.gal : 31 ms
[2022-05-20 09:34:52] [INFO ] Time to serialize properties into /tmp/LTL16699138868545286460.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL288222400548711940.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16699138868545286460.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2882224...245
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F("((i45.u1370.p4441==1)||(i46.u1433.p4645==0))")))))&&(!(("(i45.u1370.p4441==1)")U("(i14.u414.p1307==1)")))))
Formula 0 simplified : !(XXXF"((i45.u1370.p4441==1)||(i46.u1433.p4645==0))" & !("(i45.u1370.p4441==1)" U "(i14.u414.p1307==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7564355205069853328
[2022-05-20 09:35:08] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7564355205069853328
Running compilation step : cd /tmp/ltsmin7564355205069853328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7564355205069853328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7564355205069853328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-10 finished in 151298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(p1)))'
Support contains 2 out of 6707 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6706 transition count 4606
Reduce places removed 1400 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2801 place count 5306 transition count 4605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2802 place count 5305 transition count 4605
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2802 place count 5305 transition count 3810
Deduced a syphon composed of 795 places in 46 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 4392 place count 4510 transition count 3810
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 4396 place count 4506 transition count 3806
Iterating global reduction 3 with 4 rules applied. Total rules applied 4400 place count 4506 transition count 3806
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4400 place count 4506 transition count 3802
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4408 place count 4502 transition count 3802
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7802 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7803 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7805 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8007 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8209 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8403 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8405 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8406 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8406 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8410 place count 2500 transition count 2099
Applied a total of 8410 rules in 1994 ms. Remains 2500 /6707 variables (removed 4207) and now considering 2099/6007 (removed 3908) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:35:13] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 09:35:14] [INFO ] Implicit Places using invariants in 1698 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1700 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6707 places, 2099/6007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 146 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:35:14] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:35:16] [INFO ] Implicit Places using invariants in 1663 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:35:16] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:35:20] [INFO ] Implicit Places using invariants and state equation in 3414 ms returned []
Implicit Place search using SMT with State Equation took 5078 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6707 places, 2097/6007 transitions.
Finished structural reductions, in 2 iterations. Remains : 2496/6707 places, 2097/6007 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(NEQ s1367 1), p0:(OR (EQ s523 1) (EQ s1367 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1323 ms.
Product exploration explored 100000 steps with 1 reset in 1650 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 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 326 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98784 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98784 steps, saw 71206 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:35:26] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:35:27] [INFO ] [Real]Absence check using 1098 positive place invariants in 357 ms returned sat
[2022-05-20 09:35:29] [INFO ] After 2999ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:35:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 319 ms returned sat
[2022-05-20 09:35:31] [INFO ] After 1070ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:35:31] [INFO ] After 1190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-05-20 09:35:32] [INFO ] After 2169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 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 2496 transition count 2096
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2495 transition count 2096
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 2095
Applied a total of 4 rules in 154 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2494/2496 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96440 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96440 steps, saw 69589 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:35:35] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:35:35] [INFO ] [Real]Absence check using 1098 positive place invariants in 190 ms returned sat
[2022-05-20 09:35:36] [INFO ] After 1020ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 09:35:37] [INFO ] After 1148ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-05-20 09:35:37] [INFO ] After 1722ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 72 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2494/2494 places, 2095/2095 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 72 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:35:37] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:35:39] [INFO ] Implicit Places using invariants in 1669 ms returned []
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:35:39] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:35:42] [INFO ] Implicit Places using invariants and state equation in 3343 ms returned []
Implicit Place search using SMT with State Equation took 5024 ms to find 0 implicit places.
[2022-05-20 09:35:42] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:35:42] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:35:43] [INFO ] Dead Transitions using invariants and state equation in 1369 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2494/2494 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2494 transition count 2095
Applied a total of 596 rules in 174 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:35:43] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:35:44] [INFO ] [Real]Absence check using 1098 positive place invariants in 189 ms returned sat
[2022-05-20 09:35:45] [INFO ] After 1501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:35:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 188 ms returned sat
[2022-05-20 09:35:46] [INFO ] After 1033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:35:47] [INFO ] After 1163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-20 09:35:47] [INFO ] After 1705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 279 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 2496 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 73 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:35:47] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:35:49] [INFO ] Implicit Places using invariants in 1668 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:35:49] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:35:52] [INFO ] Implicit Places using invariants and state equation in 3557 ms returned []
Implicit Place search using SMT with State Equation took 5242 ms to find 0 implicit places.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:35:53] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:35:54] [INFO ] Dead Transitions using invariants and state equation in 1430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 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), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99156 steps, run timeout after 3045 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 99156 steps, saw 71467 distinct states, run finished after 3045 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:35:58] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:35:58] [INFO ] [Real]Absence check using 1098 positive place invariants in 189 ms returned sat
[2022-05-20 09:35:59] [INFO ] After 1478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:35:59] [INFO ] [Nat]Absence check using 1098 positive place invariants in 182 ms returned sat
[2022-05-20 09:36:01] [INFO ] After 1020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:36:01] [INFO ] After 1150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-20 09:36:01] [INFO ] After 1692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 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 2496 transition count 2096
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2495 transition count 2096
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 2095
Applied a total of 4 rules in 186 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2494/2496 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97653 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97653 steps, saw 70442 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:36:04] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:36:05] [INFO ] [Real]Absence check using 1098 positive place invariants in 205 ms returned sat
[2022-05-20 09:36:06] [INFO ] After 1009ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 09:36:06] [INFO ] After 1142ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-20 09:36:06] [INFO ] After 1731ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 71 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2494/2494 places, 2095/2095 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 71 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:36:06] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:36:08] [INFO ] Implicit Places using invariants in 1636 ms returned []
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:36:08] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:36:11] [INFO ] Implicit Places using invariants and state equation in 3320 ms returned []
Implicit Place search using SMT with State Equation took 4969 ms to find 0 implicit places.
[2022-05-20 09:36:11] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:36:11] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:36:13] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2494/2494 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2494 transition count 2095
Applied a total of 596 rules in 181 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2022-05-20 09:36:13] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:36:13] [INFO ] [Real]Absence check using 1098 positive place invariants in 195 ms returned sat
[2022-05-20 09:36:14] [INFO ] After 1557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:36:15] [INFO ] [Nat]Absence check using 1098 positive place invariants in 198 ms returned sat
[2022-05-20 09:36:16] [INFO ] After 1085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:36:16] [INFO ] After 1219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-20 09:36:16] [INFO ] After 1825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1402 ms.
Product exploration explored 100000 steps with 0 reset in 1883 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 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 2496 transition count 2098
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2496 transition count 2098
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2496 transition count 2099
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2495 transition count 2097
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2495 transition count 2097
Deduced a syphon composed of 1 places in 5 ms
Applied a total of 4 rules in 232 ms. Remains 2495 /2496 variables (removed 1) and now considering 2097/2097 (removed 0) transitions.
[2022-05-20 09:36:20] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 2097 rows 2495 cols
[2022-05-20 09:36:20] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:36:22] [INFO ] Dead Transitions using invariants and state equation in 1420 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2495/2496 places, 2097/2097 transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2496 places, 2097/2097 transitions.
Product exploration explored 100000 steps with 0 reset in 1406 ms.
Product exploration explored 100000 steps with 0 reset in 1792 ms.
Built C files in :
/tmp/ltsmin15148744265210328921
[2022-05-20 09:36:25] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15148744265210328921
Running compilation step : cd /tmp/ltsmin15148744265210328921;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15148744265210328921;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15148744265210328921;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 2496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 73 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:36:28] [INFO ] Computed 1098 place invariants in 11 ms
[2022-05-20 09:36:30] [INFO ] Implicit Places using invariants in 1659 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:36:30] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:36:33] [INFO ] Implicit Places using invariants and state equation in 3445 ms returned []
Implicit Place search using SMT with State Equation took 5106 ms to find 0 implicit places.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:36:33] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:36:35] [INFO ] Dead Transitions using invariants and state equation in 1422 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Built C files in :
/tmp/ltsmin7313269753382574612
[2022-05-20 09:36:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7313269753382574612
Running compilation step : cd /tmp/ltsmin7313269753382574612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7313269753382574612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7313269753382574612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:36:38] [INFO ] Flatten gal took : 57 ms
[2022-05-20 09:36:38] [INFO ] Flatten gal took : 59 ms
[2022-05-20 09:36:38] [INFO ] Time to serialize gal into /tmp/LTL1556829463390935648.gal : 6 ms
[2022-05-20 09:36:38] [INFO ] Time to serialize properties into /tmp/LTL4058677758499123773.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1556829463390935648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4058677758499123773.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1556829...266
Read 1 LTL properties
Checking formula 0 : !(((F("((p1692==1)||(p4287==0))"))&&(G("(p4287!=1)"))))
Formula 0 simplified : !(F"((p1692==1)||(p4287==0))" & G"(p4287!=1)")
Detected timeout of ITS tools.
[2022-05-20 09:36:53] [INFO ] Flatten gal took : 56 ms
[2022-05-20 09:36:53] [INFO ] Applying decomposition
[2022-05-20 09:36:53] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11201343881638752091.txt' '-o' '/tmp/graph11201343881638752091.bin' '-w' '/tmp/graph11201343881638752091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11201343881638752091.bin' '-l' '-1' '-v' '-w' '/tmp/graph11201343881638752091.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:36:53] [INFO ] Decomposing Gal with order
[2022-05-20 09:36:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:36:53] [INFO ] Removed a total of 605 redundant transitions.
[2022-05-20 09:36:53] [INFO ] Flatten gal took : 103 ms
[2022-05-20 09:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 15 ms.
[2022-05-20 09:36:53] [INFO ] Time to serialize gal into /tmp/LTL7810147325264675137.gal : 16 ms
[2022-05-20 09:36:54] [INFO ] Time to serialize properties into /tmp/LTL16853140800163405981.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7810147325264675137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16853140800163405981.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7810147...246
Read 1 LTL properties
Checking formula 0 : !(((F("((i8.i1.i0.u169.p1692==1)||(i23.i1.i0.u440.p4287==0))"))&&(G("(i23.i1.i0.u440.p4287!=1)"))))
Formula 0 simplified : !(F"((i8.i1.i0.u169.p1692==1)||(i23.i1.i0.u440.p4287==0))" & G"(i23.i1.i0.u440.p4287!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1560316173874546003
[2022-05-20 09:37:09] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1560316173874546003
Running compilation step : cd /tmp/ltsmin1560316173874546003;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1560316173874546003;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1560316173874546003;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-11 finished in 120957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(((G(p1)&&p2)||p3))))'
Support contains 3 out of 6707 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6706 transition count 4608
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5308 transition count 4608
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2796 place count 5308 transition count 3811
Deduced a syphon composed of 797 places in 12 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4390 place count 4511 transition count 3811
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 4393 place count 4508 transition count 3808
Iterating global reduction 2 with 3 rules applied. Total rules applied 4396 place count 4508 transition count 3808
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4396 place count 4508 transition count 3805
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 4402 place count 4505 transition count 3805
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7798 place count 2807 transition count 2107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2807 transition count 2106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7801 place count 2806 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8003 place count 2705 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8205 place count 2604 transition count 2105
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8399 place count 2507 transition count 2105
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8400 place count 2507 transition count 2105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8402 place count 2505 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8403 place count 2504 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8403 place count 2504 transition count 2101
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8407 place count 2502 transition count 2101
Applied a total of 8407 rules in 2374 ms. Remains 2502 /6707 variables (removed 4205) and now considering 2101/6007 (removed 3906) transitions.
// Phase 1: matrix 2101 rows 2502 cols
[2022-05-20 09:37:14] [INFO ] Computed 1100 place invariants in 5 ms
[2022-05-20 09:37:16] [INFO ] Implicit Places using invariants in 1619 ms returned [2485, 2489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1623 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/6707 places, 2101/6007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 2099
Applied a total of 4 rules in 160 ms. Remains 2498 /2500 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:37:16] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:37:17] [INFO ] Implicit Places using invariants in 1625 ms returned []
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:37:17] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:37:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:37:21] [INFO ] Implicit Places using invariants and state equation in 3490 ms returned []
Implicit Place search using SMT with State Equation took 5126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2498/6707 places, 2099/6007 transitions.
Finished structural reductions, in 2 iterations. Remains : 2498/6707 places, 2099/6007 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 p3 p1) (AND p0 p2 p1)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p1))), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p3:(EQ s1024 0), p2:(OR (EQ s717 1) (EQ s22 1)), p1:(AND (EQ s717 1) (EQ s22 1)), p0:(EQ s1024 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1376 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-13 finished in 10862 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(F(X(X(p0))))||(X(p1)&&p2)))))'
Support contains 3 out of 6707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6701 transition count 6001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6701 transition count 6001
Applied a total of 12 rules in 1891 ms. Remains 6701 /6707 variables (removed 6) and now considering 6001/6007 (removed 6) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:37:24] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:37:27] [INFO ] Implicit Places using invariants in 2226 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:37:27] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 09:37:29] [INFO ] Implicit Places using invariants and state equation in 2176 ms returned []
Implicit Place search using SMT with State Equation took 4445 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:37:29] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:37:33] [INFO ] Dead Transitions using invariants and state equation in 4176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6707 places, 6001/6007 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6707 places, 6001/6007 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (AND (NOT p0) p2 (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(EQ s56 1), p0:(EQ s3901 1), p1:(EQ s1666 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]]
Product exploration explored 100000 steps with 0 reset in 1426 ms.
Stack based approach found an accepted trace after 5515 steps with 0 reset with depth 5516 and stack size 5516 in 79 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-14 finished in 12484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!F(p0)) U (G((X(p1) U p2))||p3)))'
Support contains 4 out of 6707 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6702 transition count 6002
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6702 transition count 6002
Applied a total of 10 rules in 1929 ms. Remains 6702 /6707 variables (removed 5) and now considering 6002/6007 (removed 5) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:37:37] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 09:37:39] [INFO ] Implicit Places using invariants in 2286 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:37:39] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 09:37:41] [INFO ] Implicit Places using invariants and state equation in 2193 ms returned []
Implicit Place search using SMT with State Equation took 4500 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:37:41] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:37:45] [INFO ] Dead Transitions using invariants and state equation in 4150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6707 places, 6002/6007 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6707 places, 6002/6007 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2)), true, p0]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s5367 1), p0:(OR (NEQ s750 1) (EQ s5367 1)), p2:(EQ s2143 1), p1:(EQ s3347 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-15 finished in 10941 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!(F(p1)&&X(p0)&&p2)))))'
Found a SL insensitive property : ShieldPPPt-PT-100B-LTLFireability-06
Stuttering acceptance computed with spot in 211 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2 p1), p0, (AND p1 p0), true, p1]
Support contains 4 out of 6707 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6706 transition count 4606
Reduce places removed 1400 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2801 place count 5306 transition count 4605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2802 place count 5305 transition count 4605
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2802 place count 5305 transition count 3808
Deduced a syphon composed of 797 places in 12 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 4396 place count 4508 transition count 3808
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 4399 place count 4505 transition count 3805
Iterating global reduction 3 with 3 rules applied. Total rules applied 4402 place count 4505 transition count 3805
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4402 place count 4505 transition count 3802
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4408 place count 4502 transition count 3802
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 5 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7802 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7803 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7805 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8007 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8209 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8403 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8405 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8406 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8406 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8410 place count 2500 transition count 2099
Applied a total of 8410 rules in 2038 ms. Remains 2500 /6707 variables (removed 4207) and now considering 2099/6007 (removed 3908) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:37:48] [INFO ] Computed 1100 place invariants in 2 ms
[2022-05-20 09:37:50] [INFO ] Implicit Places using invariants in 1615 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1617 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2498/6707 places, 2099/6007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 144 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:37:50] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:37:52] [INFO ] Implicit Places using invariants in 1598 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:37:52] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:37:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:37:55] [INFO ] Implicit Places using invariants and state equation in 3462 ms returned []
Implicit Place search using SMT with State Equation took 5087 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 2496/6707 places, 2097/6007 transitions.
Finished structural reductions, in 2 iterations. Remains : 2496/6707 places, 2097/6007 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s2471 1), p2:(OR (AND (EQ s1086 1) (EQ s1088 1)) (EQ s1626 1)), p1:(EQ s1626 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30330 reset in 2401 ms.
Product exploration explored 100000 steps with 30259 reset in 2654 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2496 stabilizing places and 2/2097 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1)))]
Knowledge based reduction with 10 factoid took 499 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:02] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:38:02] [INFO ] [Real]Absence check using 1098 positive place invariants in 186 ms returned sat
[2022-05-20 09:38:02] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:38:03] [INFO ] [Nat]Absence check using 1098 positive place invariants in 185 ms returned sat
[2022-05-20 09:38:04] [INFO ] After 1085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:38:04] [INFO ] After 152ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:04] [INFO ] After 423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2022-05-20 09:38:04] [INFO ] After 2232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 75 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2496 transition count 2097
Applied a total of 3 rules in 145 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 88158 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88158 steps, saw 63205 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:08] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:38:09] [INFO ] [Real]Absence check using 1098 positive place invariants in 180 ms returned sat
[2022-05-20 09:38:09] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:38:09] [INFO ] [Nat]Absence check using 1098 positive place invariants in 203 ms returned sat
[2022-05-20 09:38:10] [INFO ] After 1093ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:38:11] [INFO ] After 155ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:11] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-05-20 09:38:11] [INFO ] After 2251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 91 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 87 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 74 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:11] [INFO ] Computed 1098 place invariants in 17 ms
[2022-05-20 09:38:13] [INFO ] Implicit Places using invariants in 1704 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:13] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:38:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:38:16] [INFO ] Implicit Places using invariants and state equation in 3469 ms returned []
Implicit Place search using SMT with State Equation took 5184 ms to find 0 implicit places.
[2022-05-20 09:38:16] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:16] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:38:18] [INFO ] Dead Transitions using invariants and state equation in 1357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2496 transition count 2097
Applied a total of 594 rules in 176 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:18] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:38:18] [INFO ] [Real]Absence check using 1098 positive place invariants in 185 ms returned sat
[2022-05-20 09:38:19] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:38:19] [INFO ] [Nat]Absence check using 1098 positive place invariants in 188 ms returned sat
[2022-05-20 09:38:20] [INFO ] After 1117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:38:20] [INFO ] After 159ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:21] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2022-05-20 09:38:21] [INFO ] After 2257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (AND p1 p2)), (F p1)]
Knowledge based reduction with 10 factoid took 638 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 184 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Stuttering acceptance computed with spot in 174 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 68 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:22] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:38:24] [INFO ] Implicit Places using invariants in 1596 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:24] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:38:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:38:27] [INFO ] Implicit Places using invariants and state equation in 3418 ms returned []
Implicit Place search using SMT with State Equation took 5027 ms to find 0 implicit places.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:27] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:38:28] [INFO ] Dead Transitions using invariants and state equation in 1352 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2496 stabilizing places and 2/2097 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2)))]
Knowledge based reduction with 10 factoid took 457 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 297 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:30] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:38:31] [INFO ] [Real]Absence check using 1098 positive place invariants in 187 ms returned sat
[2022-05-20 09:38:31] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:38:31] [INFO ] [Nat]Absence check using 1098 positive place invariants in 187 ms returned sat
[2022-05-20 09:38:32] [INFO ] After 1084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:38:32] [INFO ] After 151ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:33] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2022-05-20 09:38:33] [INFO ] After 2203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 81 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2496 transition count 2097
Applied a total of 3 rules in 146 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 86048 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86048 steps, saw 61478 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:36] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:38:37] [INFO ] [Real]Absence check using 1098 positive place invariants in 195 ms returned sat
[2022-05-20 09:38:37] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:38:38] [INFO ] [Nat]Absence check using 1098 positive place invariants in 180 ms returned sat
[2022-05-20 09:38:39] [INFO ] After 1075ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:38:39] [INFO ] After 144ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:39] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 175 ms.
[2022-05-20 09:38:39] [INFO ] After 2240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 81 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 91 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 73 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:40] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:38:41] [INFO ] Implicit Places using invariants in 1584 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:41] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:38:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:38:44] [INFO ] Implicit Places using invariants and state equation in 3365 ms returned []
Implicit Place search using SMT with State Equation took 4959 ms to find 0 implicit places.
[2022-05-20 09:38:45] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:45] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:38:46] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2496 transition count 2097
Applied a total of 594 rules in 177 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:46] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:38:47] [INFO ] [Real]Absence check using 1098 positive place invariants in 181 ms returned sat
[2022-05-20 09:38:47] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:38:47] [INFO ] [Nat]Absence check using 1098 positive place invariants in 196 ms returned sat
[2022-05-20 09:38:48] [INFO ] After 1101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:48] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:38:48] [INFO ] After 152ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:38:49] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 155 ms.
[2022-05-20 09:38:49] [INFO ] After 2229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (AND p1 p2)), (F p1)]
Knowledge based reduction with 10 factoid took 661 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 228 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Stuttering acceptance computed with spot in 185 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Stuttering acceptance computed with spot in 198 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Product exploration explored 100000 steps with 30132 reset in 2327 ms.
Product exploration explored 100000 steps with 30157 reset in 2617 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 229 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0, (AND p1 p0), true, p1]
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 76 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2022-05-20 09:38:56] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:38:56] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:38:57] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Product exploration explored 100000 steps with 30197 reset in 5354 ms.
Product exploration explored 100000 steps with 30336 reset in 5665 ms.
Built C files in :
/tmp/ltsmin2234417547955857118
[2022-05-20 09:39:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2234417547955857118
Running compilation step : cd /tmp/ltsmin2234417547955857118;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2234417547955857118;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2234417547955857118;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 83 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:39:11] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:39:14] [INFO ] Implicit Places using invariants in 2388 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:39:14] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:39:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:39:17] [INFO ] Implicit Places using invariants and state equation in 3304 ms returned []
Implicit Place search using SMT with State Equation took 5720 ms to find 0 implicit places.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:39:17] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:39:18] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Built C files in :
/tmp/ltsmin190999672424322015
[2022-05-20 09:39:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin190999672424322015
Running compilation step : cd /tmp/ltsmin190999672424322015;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin190999672424322015;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin190999672424322015;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:39:21] [INFO ] Flatten gal took : 56 ms
[2022-05-20 09:39:21] [INFO ] Flatten gal took : 56 ms
[2022-05-20 09:39:21] [INFO ] Time to serialize gal into /tmp/LTL5392791976020360651.gal : 22 ms
[2022-05-20 09:39:21] [INFO ] Time to serialize properties into /tmp/LTL5488728924151100014.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5392791976020360651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5488728924151100014.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5392791...266
Read 1 LTL properties
Checking formula 0 : !((G(("(p7682==1)")U(X(!(((F("(p5097==1)"))&&(X("(p7682==1)")))&&("(((p3436==1)&&(p3438==1))||(p5097==1))")))))))
Formula 0 simplified : !G("(p7682==1)" U X!("(((p3436==1)&&(p3438==1))||(p5097==1))" & F"(p5097==1)" & X"(p7682==1)"))
Detected timeout of ITS tools.
[2022-05-20 09:39:37] [INFO ] Flatten gal took : 55 ms
[2022-05-20 09:39:37] [INFO ] Applying decomposition
[2022-05-20 09:39:37] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2445257819820484540.txt' '-o' '/tmp/graph2445257819820484540.bin' '-w' '/tmp/graph2445257819820484540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2445257819820484540.bin' '-l' '-1' '-v' '-w' '/tmp/graph2445257819820484540.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:39:37] [INFO ] Decomposing Gal with order
[2022-05-20 09:39:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:39:37] [INFO ] Removed a total of 602 redundant transitions.
[2022-05-20 09:39:37] [INFO ] Flatten gal took : 91 ms
[2022-05-20 09:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 12 ms.
[2022-05-20 09:39:37] [INFO ] Time to serialize gal into /tmp/LTL12423048178771719092.gal : 15 ms
[2022-05-20 09:39:37] [INFO ] Time to serialize properties into /tmp/LTL580459934977761663.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12423048178771719092.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL580459934977761663.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1242304...245
Read 1 LTL properties
Checking formula 0 : !((G(("(i44.i0.i2.u792.p7682==1)")U(X(!(((F("(i28.i1.i2.u521.p5097==1)"))&&(X("(i44.i0.i2.u792.p7682==1)")))&&("(((i19.i0.i0.u349.p343...224
Formula 0 simplified : !G("(i44.i0.i2.u792.p7682==1)" U X!("(((i19.i0.i0.u349.p3436==1)&&(i19.i0.i1.u350.p3438==1))||(i28.i1.i2.u521.p5097==1))" & F"(i28.i...208
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i2.u1.t1602, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i2.u10.t...4045
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13215263203450417116
[2022-05-20 09:39:52] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13215263203450417116
Running compilation step : cd /tmp/ltsmin13215263203450417116;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13215263203450417116;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13215263203450417116;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-06 finished in 129257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))||G(p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(X(p0) U G(p1))&&G(p2))))'
Found a CL insensitive property : ShieldPPPt-PT-100B-LTLFireability-08
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Support contains 2 out of 6707 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1401 transitions
Trivial Post-agglo rules discarded 1401 transitions
Performed 1401 trivial Post agglomeration. Transition count delta: 1401
Iterating post reduction 0 with 1401 rules applied. Total rules applied 1401 place count 6706 transition count 4605
Reduce places removed 1401 places and 0 transitions.
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2802 place count 5305 transition count 4605
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2802 place count 5305 transition count 3809
Deduced a syphon composed of 796 places in 12 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 4394 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4398 place count 4505 transition count 3805
Iterating global reduction 2 with 4 rules applied. Total rules applied 4402 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4402 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4410 place count 4501 transition count 3801
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 4 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 2 with 3392 rules applied. Total rules applied 7802 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7805 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8007 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8209 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8403 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8405 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8406 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8406 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8410 place count 2500 transition count 2099
Applied a total of 8410 rules in 2078 ms. Remains 2500 /6707 variables (removed 4207) and now considering 2099/6007 (removed 3908) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:39:58] [INFO ] Computed 1100 place invariants in 2 ms
[2022-05-20 09:39:59] [INFO ] Implicit Places using invariants in 1596 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1612 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2498/6707 places, 2099/6007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 143 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:39:59] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:40:01] [INFO ] Implicit Places using invariants in 1594 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:01] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:40:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:40:04] [INFO ] Implicit Places using invariants and state equation in 3375 ms returned []
Implicit Place search using SMT with State Equation took 4991 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 2496/6707 places, 2097/6007 transitions.
Finished structural reductions, in 2 iterations. Remains : 2496/6707 places, 2097/6007 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s2098 0), p1:(EQ s840 1), p0:(EQ s2098 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 1249 ms.
Product exploration explored 100000 steps with 3 reset in 1661 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2496 stabilizing places and 2/2097 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 515 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:08] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:40:09] [INFO ] [Real]Absence check using 1098 positive place invariants in 183 ms returned sat
[2022-05-20 09:40:10] [INFO ] After 1799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:40:11] [INFO ] [Nat]Absence check using 1098 positive place invariants in 189 ms returned sat
[2022-05-20 09:40:12] [INFO ] After 1173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:40:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:40:12] [INFO ] After 228ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:40:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-05-20 09:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-20 09:40:13] [INFO ] After 732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 229 ms.
[2022-05-20 09:40:13] [INFO ] After 2751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 127 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 75 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 75991 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75991 steps, saw 54441 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:17] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:40:17] [INFO ] [Real]Absence check using 1098 positive place invariants in 195 ms returned sat
[2022-05-20 09:40:19] [INFO ] After 1837ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:40:19] [INFO ] [Nat]Absence check using 1098 positive place invariants in 203 ms returned sat
[2022-05-20 09:40:20] [INFO ] After 1170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:40:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:40:21] [INFO ] After 221ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:40:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-20 09:40:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-20 09:40:21] [INFO ] After 705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 219 ms.
[2022-05-20 09:40:21] [INFO ] After 2766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 72 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 72 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:22] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:40:23] [INFO ] Implicit Places using invariants in 1715 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:23] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:40:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:40:27] [INFO ] Implicit Places using invariants and state equation in 3348 ms returned []
Implicit Place search using SMT with State Equation took 5078 ms to find 0 implicit places.
[2022-05-20 09:40:27] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:27] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:40:28] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2496 transition count 2097
Applied a total of 596 rules in 174 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:28] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:40:29] [INFO ] [Real]Absence check using 1098 positive place invariants in 195 ms returned sat
[2022-05-20 09:40:30] [INFO ] After 1230ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-20 09:40:31] [INFO ] After 1637ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-20 09:40:31] [INFO ] After 2384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-05-20 09:40:31] [INFO ] [Nat]Absence check using 1098 positive place invariants in 194 ms returned sat
[2022-05-20 09:40:33] [INFO ] After 1247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:40:33] [INFO ] After 1642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 230 ms.
[2022-05-20 09:40:33] [INFO ] After 2525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F p0)]
Knowledge based reduction with 9 factoid took 619 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 90 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:34] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:40:36] [INFO ] Implicit Places using invariants in 1690 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:36] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:40:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:40:39] [INFO ] Implicit Places using invariants and state equation in 3531 ms returned []
Implicit Place search using SMT with State Equation took 5231 ms to find 0 implicit places.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:39] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:40:41] [INFO ] Dead Transitions using invariants and state equation in 1383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2496 stabilizing places and 2/2097 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 501 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:42] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:40:43] [INFO ] [Real]Absence check using 1098 positive place invariants in 192 ms returned sat
[2022-05-20 09:40:44] [INFO ] After 1856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:40:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 194 ms returned sat
[2022-05-20 09:40:46] [INFO ] After 1204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:40:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:40:46] [INFO ] After 232ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:40:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-20 09:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-20 09:40:47] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 231 ms.
[2022-05-20 09:40:47] [INFO ] After 2826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 107 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 77 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 70981 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70981 steps, saw 50540 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:51] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:40:51] [INFO ] [Real]Absence check using 1098 positive place invariants in 183 ms returned sat
[2022-05-20 09:40:52] [INFO ] After 1803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 09:40:53] [INFO ] [Nat]Absence check using 1098 positive place invariants in 195 ms returned sat
[2022-05-20 09:40:54] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:40:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:40:55] [INFO ] After 225ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 09:40:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-05-20 09:40:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-20 09:40:55] [INFO ] After 702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 231 ms.
[2022-05-20 09:40:55] [INFO ] After 2761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 76 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 72 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:56] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:40:57] [INFO ] Implicit Places using invariants in 1645 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:40:57] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:40:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:41:00] [INFO ] Implicit Places using invariants and state equation in 3340 ms returned []
Implicit Place search using SMT with State Equation took 4995 ms to find 0 implicit places.
[2022-05-20 09:41:01] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:41:01] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:41:02] [INFO ] Dead Transitions using invariants and state equation in 1375 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2496 transition count 2097
Applied a total of 596 rules in 175 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:41:02] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:41:03] [INFO ] [Real]Absence check using 1098 positive place invariants in 196 ms returned sat
[2022-05-20 09:41:04] [INFO ] After 1238ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-20 09:41:04] [INFO ] After 1654ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-20 09:41:05] [INFO ] After 2401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-05-20 09:41:05] [INFO ] [Nat]Absence check using 1098 positive place invariants in 191 ms returned sat
[2022-05-20 09:41:06] [INFO ] After 1210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 09:41:07] [INFO ] After 1604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 226 ms.
[2022-05-20 09:41:07] [INFO ] After 2459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F p0)]
Knowledge based reduction with 9 factoid took 630 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Product exploration explored 100000 steps with 2 reset in 1394 ms.
Product exploration explored 100000 steps with 0 reset in 1778 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), p1]
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 89 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2022-05-20 09:41:12] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:41:12] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:41:13] [INFO ] Dead Transitions using invariants and state equation in 1459 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Product exploration explored 100000 steps with 2 reset in 1315 ms.
Product exploration explored 100000 steps with 0 reset in 1667 ms.
Built C files in :
/tmp/ltsmin1590146013692539060
[2022-05-20 09:41:16] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1590146013692539060
Running compilation step : cd /tmp/ltsmin1590146013692539060;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1590146013692539060;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1590146013692539060;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 69 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:41:19] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:41:21] [INFO ] Implicit Places using invariants in 1653 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:41:21] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:41:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:41:24] [INFO ] Implicit Places using invariants and state equation in 3553 ms returned []
Implicit Place search using SMT with State Equation took 5207 ms to find 0 implicit places.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:41:24] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:41:26] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Built C files in :
/tmp/ltsmin2514453153608041219
[2022-05-20 09:41:26] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2514453153608041219
Running compilation step : cd /tmp/ltsmin2514453153608041219;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2514453153608041219;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2514453153608041219;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:41:29] [INFO ] Flatten gal took : 58 ms
[2022-05-20 09:41:29] [INFO ] Flatten gal took : 59 ms
[2022-05-20 09:41:29] [INFO ] Time to serialize gal into /tmp/LTL9724039152197149608.gal : 6 ms
[2022-05-20 09:41:29] [INFO ] Time to serialize properties into /tmp/LTL7947866942202284966.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9724039152197149608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7947866942202284966.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9724039...266
Read 1 LTL properties
Checking formula 0 : !((F((!((X("(p6537==1)"))U(G("(p2671==1)"))))&&(G("(p6537==0)")))))
Formula 0 simplified : !F(!(X"(p6537==1)" U G"(p2671==1)") & G"(p6537==0)")
Detected timeout of ITS tools.
[2022-05-20 09:41:44] [INFO ] Flatten gal took : 57 ms
[2022-05-20 09:41:44] [INFO ] Applying decomposition
[2022-05-20 09:41:44] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13465021371762322460.txt' '-o' '/tmp/graph13465021371762322460.bin' '-w' '/tmp/graph13465021371762322460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13465021371762322460.bin' '-l' '-1' '-v' '-w' '/tmp/graph13465021371762322460.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:41:44] [INFO ] Decomposing Gal with order
[2022-05-20 09:41:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:41:45] [INFO ] Removed a total of 611 redundant transitions.
[2022-05-20 09:41:45] [INFO ] Flatten gal took : 106 ms
[2022-05-20 09:41:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 19 ms.
[2022-05-20 09:41:45] [INFO ] Time to serialize gal into /tmp/LTL16977093804764209501.gal : 16 ms
[2022-05-20 09:41:45] [INFO ] Time to serialize properties into /tmp/LTL9494823062344310462.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16977093804764209501.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9494823062344310462.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1697709...246
Read 1 LTL properties
Checking formula 0 : !((F((!((X("(i36.i1.i1.u674.p6537==1)"))U(G("(i15.i0.i2.u271.p2671==1)"))))&&(G("(i36.i1.i1.u674.p6537==0)")))))
Formula 0 simplified : !F(!(X"(i36.i1.i1.u674.p6537==1)" U G"(i15.i0.i2.u271.p2671==1)") & G"(i36.i1.i1.u674.p6537==0)")
Reverse transition relation is NOT exact ! Due to transitions i36.i1.t249, i36.i1.t250, i36.i1.i1.u674.t300, i37.i0.t253, Intersection with reachable at e...223
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7244840590560471437
[2022-05-20 09:42:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7244840590560471437
Running compilation step : cd /tmp/ltsmin7244840590560471437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7244840590560471437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7244840590560471437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-08 finished in 127633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&!(p1 U p2)))'
Found a CL insensitive property : ShieldPPPt-PT-100B-LTLFireability-10
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) p2), true, p2, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 6707 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 6707/6707 places, 6007/6007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6706 transition count 4607
Reduce places removed 1399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2799 place count 5307 transition count 4606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2800 place count 5306 transition count 4606
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2800 place count 5306 transition count 3811
Deduced a syphon composed of 795 places in 13 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 4390 place count 4511 transition count 3811
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 4393 place count 4508 transition count 3808
Iterating global reduction 3 with 3 rules applied. Total rules applied 4396 place count 4508 transition count 3808
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4396 place count 4508 transition count 3805
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4402 place count 4505 transition count 3805
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 5 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 3 with 3396 rules applied. Total rules applied 7798 place count 2807 transition count 2107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7799 place count 2807 transition count 2106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7801 place count 2806 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8003 place count 2705 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8205 place count 2604 transition count 2105
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8399 place count 2507 transition count 2105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8401 place count 2505 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8402 place count 2504 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8402 place count 2504 transition count 2101
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8406 place count 2502 transition count 2101
Applied a total of 8406 rules in 2004 ms. Remains 2502 /6707 variables (removed 4205) and now considering 2101/6007 (removed 3906) transitions.
// Phase 1: matrix 2101 rows 2502 cols
[2022-05-20 09:42:05] [INFO ] Computed 1100 place invariants in 5 ms
[2022-05-20 09:42:07] [INFO ] Implicit Places using invariants in 1712 ms returned [2485, 2489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1713 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2500/6707 places, 2101/6007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 2099
Applied a total of 4 rules in 145 ms. Remains 2498 /2500 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:42:07] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:42:09] [INFO ] Implicit Places using invariants in 1681 ms returned []
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:42:09] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:42:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:42:12] [INFO ] Implicit Places using invariants and state equation in 3579 ms returned []
Implicit Place search using SMT with State Equation took 5261 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 2498/6707 places, 2099/6007 transitions.
Finished structural reductions, in 2 iterations. Remains : 2498/6707 places, 2099/6007 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s398 1), p1:(EQ s1417 1), p0:(OR (EQ s1417 1) (EQ s1481 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16996 reset in 1925 ms.
Stack based approach found an accepted trace after 132 steps with 21 reset with depth 16 and stack size 16 in 4 ms.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-10 finished in 11349 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(p1)))'
[2022-05-20 09:42:14] [INFO ] Flatten gal took : 147 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2404598365853361427
[2022-05-20 09:42:14] [INFO ] Too many transitions (6007) to apply POR reductions. Disabling POR matrices.
[2022-05-20 09:42:15] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2404598365853361427
Running compilation step : cd /tmp/ltsmin2404598365853361427;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 09:42:15] [INFO ] Applying decomposition
[2022-05-20 09:42:15] [INFO ] Flatten gal took : 154 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13168234485243759876.txt' '-o' '/tmp/graph13168234485243759876.bin' '-w' '/tmp/graph13168234485243759876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13168234485243759876.bin' '-l' '-1' '-v' '-w' '/tmp/graph13168234485243759876.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:42:15] [INFO ] Decomposing Gal with order
[2022-05-20 09:42:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:42:17] [INFO ] Removed a total of 991 redundant transitions.
[2022-05-20 09:42:17] [INFO ] Flatten gal took : 285 ms
[2022-05-20 09:42:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-20 09:42:17] [INFO ] Time to serialize gal into /tmp/LTLFireability4620927403626364946.gal : 22 ms
[2022-05-20 09:42:17] [INFO ] Time to serialize properties into /tmp/LTLFireability5511597392191219865.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4620927403626364946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5511597392191219865.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 5 LTL properties
Checking formula 0 : !((G(("(i70.u2362.p7682==1)")U(X(!(((F("(i45.u1574.p5097==1)"))&&(X("(i70.u2362.p7682==1)")))&&("(((i31.u1069.p3436==1)&&(i31.u1069.p3...194
Formula 0 simplified : !G("(i70.u2362.p7682==1)" U X!("(((i31.u1069.p3436==1)&&(i31.u1069.p3438==1))||(i45.u1574.p5097==1))" & F"(i45.u1574.p5097==1)" & X"...178
Compilation finished in 24585 ms.
Running link step : cd /tmp/ltsmin2404598365853361427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin2404598365853361427;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U X(!(<>((LTLAPp1==true))&&X((LTLAPp0==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin2404598365853361427;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U X(!(<>((LTLAPp1==true))&&X((LTLAPp0==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2404598365853361427;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](X((LTLAPp3==true)))||[]((LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin2404598365853361427;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](X((LTLAPp3==true)))||[]((LTLAPp4==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2404598365853361427;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(X((LTLAPp5==true)) U []((LTLAPp6==true)))&&[]((LTLAPp7==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 10:10:33] [INFO ] Applying decomposition
[2022-05-20 10:10:36] [INFO ] Flatten gal took : 2644 ms
[2022-05-20 10:10:39] [INFO ] Decomposing Gal with order
[2022-05-20 10:11:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 10:11:24] [INFO ] Removed a total of 298 redundant transitions.
[2022-05-20 10:11:32] [INFO ] Flatten gal took : 16210 ms
[2022-05-20 10:11:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1196 labels/synchronizations in 670 ms.
[2022-05-20 10:11:37] [INFO ] Time to serialize gal into /tmp/LTLFireability2868604728103833885.gal : 497 ms
[2022-05-20 10:11:39] [INFO ] Time to serialize properties into /tmp/LTLFireability6831396275323219331.ltl : 1194 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2868604728103833885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6831396275323219331.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 5 LTL properties
Checking formula 0 : !((G(("(i0.i1.i0.i0.i0.u2176.p7682==1)")U(X(!(((F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...794
Formula 0 simplified : !G("(i0.i1.i0.i0.i0.u2176.p7682==1)" U X!("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...778
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-100B, 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 r222-tall-165286025600700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B 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 ;