About the Execution of ITS-Tools for QuasiCertifProtocol-PT-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16208.728 | 3600000.00 | 11399874.00 | 14630.30 | FFTFF??FTTFT?FF? | 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.r168-tall-165277017501003.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 QuasiCertifProtocol-PT-32, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017501003
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 119K Apr 30 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 720K Apr 30 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 30 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 165K Apr 30 13:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 69K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 281K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K May 9 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 942K 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 QuasiCertifProtocol-PT-32-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653002026709
Running Version 202205111006
[2022-05-19 23:13:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-19 23:13:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 23:13:48] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2022-05-19 23:13:48] [INFO ] Transformed 3806 places.
[2022-05-19 23:13:48] [INFO ] Transformed 506 transitions.
[2022-05-19 23:13:48] [INFO ] Parsed PT model containing 3806 places and 506 transitions in 314 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 126 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3479 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 3774 transition count 506
Applied a total of 32 rules in 57 ms. Remains 3774 /3806 variables (removed 32) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3774 cols
[2022-05-19 23:13:48] [INFO ] Computed 3269 place invariants in 169 ms
[2022-05-19 23:13:49] [INFO ] Implicit Places using invariants in 887 ms returned []
// Phase 1: matrix 506 rows 3774 cols
[2022-05-19 23:13:49] [INFO ] Computed 3269 place invariants in 81 ms
[2022-05-19 23:13:50] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3774 cols
[2022-05-19 23:13:50] [INFO ] Computed 3269 place invariants in 51 ms
[2022-05-19 23:13:50] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3774/3806 places, 506/506 transitions.
Finished structural reductions, in 1 iterations. Remains : 3774/3806 places, 506/506 transitions.
Support contains 3479 out of 3774 places after structural reductions.
[2022-05-19 23:13:51] [INFO ] Flatten gal took : 263 ms
[2022-05-19 23:13:51] [INFO ] Flatten gal took : 162 ms
[2022-05-19 23:13:51] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 902 ms. (steps per millisecond=11 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 506 rows 3774 cols
[2022-05-19 23:13:53] [INFO ] Computed 3269 place invariants in 61 ms
[2022-05-19 23:13:55] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-19 23:13:55] [INFO ] [Real]Absence check using 3 positive and 3266 generalized place invariants in 773 ms returned sat
[2022-05-19 23:13:55] [INFO ] After 2667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-19 23:13:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-19 23:13:58] [INFO ] [Nat]Absence check using 3 positive and 3266 generalized place invariants in 723 ms returned sat
[2022-05-19 23:14:21] [INFO ] After 21103ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :18
[2022-05-19 23:14:21] [INFO ] After 21106ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :18
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-19 23:14:21] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :18
Fused 23 Parikh solutions to 3 different solutions.
Parikh walk visited 5 properties in 22 ms.
Support contains 2321 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 43442 edges and 3774 vertex of which 3772 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3772 transition count 502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 3771 transition count 502
Applied a total of 6 rules in 244 ms. Remains 3771 /3774 variables (removed 3) and now considering 502/506 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 3771/3774 places, 502/506 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 329198 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329198 steps, saw 42220 distinct states, run finished after 3005 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 502 rows 3771 cols
[2022-05-19 23:14:25] [INFO ] Computed 3270 place invariants in 50 ms
[2022-05-19 23:14:27] [INFO ] After 1205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-19 23:14:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-05-19 23:14:28] [INFO ] [Nat]Absence check using 2 positive and 3268 generalized place invariants in 777 ms returned sat
[2022-05-19 23:14:52] [INFO ] After 22083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 23:14:52] [INFO ] After 22090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-19 23:14:52] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2321 out of 3771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3771/3771 places, 502/502 transitions.
Applied a total of 0 rules in 92 ms. Remains 3771 /3771 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3771/3771 places, 502/502 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3771/3771 places, 502/502 transitions.
Applied a total of 0 rules in 168 ms. Remains 3771 /3771 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3771 cols
[2022-05-19 23:14:52] [INFO ] Computed 3270 place invariants in 55 ms
[2022-05-19 23:14:53] [INFO ] Implicit Places using invariants in 1441 ms returned []
// Phase 1: matrix 502 rows 3771 cols
[2022-05-19 23:14:53] [INFO ] Computed 3270 place invariants in 45 ms
[2022-05-19 23:14:55] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 2897 ms to find 0 implicit places.
[2022-05-19 23:14:55] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 502 rows 3771 cols
[2022-05-19 23:14:55] [INFO ] Computed 3270 place invariants in 42 ms
[2022-05-19 23:14:56] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3771/3771 places, 502/502 transitions.
Applied a total of 0 rules in 161 ms. Remains 3771 /3771 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 502 rows 3771 cols
[2022-05-19 23:14:56] [INFO ] Computed 3270 place invariants in 56 ms
[2022-05-19 23:14:57] [INFO ] After 1076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-19 23:14:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-05-19 23:14:59] [INFO ] [Nat]Absence check using 2 positive and 3268 generalized place invariants in 774 ms returned sat
[2022-05-19 23:15:45] [INFO ] After 44662ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2022-05-19 23:15:55] [INFO ] After 55347ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :7
Attempting to minimize the solution found.
Minimization took 14590 ms.
[2022-05-19 23:16:10] [INFO ] After 72953ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :6
[2022-05-19 23:16:10] [INFO ] Flatten gal took : 143 ms
[2022-05-19 23:16:10] [INFO ] Flatten gal took : 207 ms
[2022-05-19 23:16:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9372981316844447170.gal : 40 ms
[2022-05-19 23:16:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality49765536619386991.prop : 4 ms
Invoking ITS tools like this :cd /tmp/redAtoms762894320998114552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9372981316844447170.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality49765536619386991.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...317
Loading property file /tmp/ReachabilityCardinality49765536619386991.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :32 after 128
Detected timeout of ITS tools.
[2022-05-19 23:16:26] [INFO ] Flatten gal took : 102 ms
[2022-05-19 23:16:26] [INFO ] Applying decomposition
[2022-05-19 23:16:26] [INFO ] Flatten gal took : 101 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/graph11414577877790120224.txt' '-o' '/tmp/graph11414577877790120224.bin' '-w' '/tmp/graph11414577877790120224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11414577877790120224.bin' '-l' '-1' '-v' '-w' '/tmp/graph11414577877790120224.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:16:31] [INFO ] Decomposing Gal with order
[2022-05-19 23:16:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:16:31] [INFO ] Removed a total of 350 redundant transitions.
[2022-05-19 23:16:32] [INFO ] Flatten gal took : 450 ms
[2022-05-19 23:16:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 448 labels/synchronizations in 97 ms.
[2022-05-19 23:16:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17081630822894115386.gal : 18 ms
[2022-05-19 23:16:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11766607871474628929.prop : 2 ms
Invoking ITS tools like this :cd /tmp/redAtoms762894320998114552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17081630822894115386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11766607871474628929.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11766607871474628929.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :9 after 257
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :257 after 16385
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin577628864960198918
[2022-05-19 23:16:47] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin577628864960198918
Running compilation step : cd /tmp/ltsmin577628864960198918;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2542 ms.
Running link step : cd /tmp/ltsmin577628864960198918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin577628864960198918;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp2==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3774 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3774 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 33 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 3736 transition count 506
Applied a total of 38 rules in 468 ms. Remains 3736 /3774 variables (removed 38) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 23:17:03] [INFO ] Computed 3232 place invariants in 125 ms
[2022-05-19 23:17:06] [INFO ] Implicit Places using invariants in 3379 ms returned []
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 23:17:06] [INFO ] Computed 3232 place invariants in 98 ms
[2022-05-19 23:17:17] [INFO ] Implicit Places using invariants and state equation in 10389 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13772 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3774 places, 506/506 transitions.
Applied a total of 0 rules in 187 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s3543 s3544 s3545 s3546 s3547 s3548 s3549 s3550 s3551 s3555 s3556 s3557 s3558 s3559 s3560 s3561 s3562 s3563 s3564 s3565 s3566 s3567 s3568 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-01 finished in 14689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(G(X(p0))))&&p1))))'
Support contains 1156 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 43442 edges and 3774 vertex of which 3735 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.29 ms
Discarding 39 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3733 transition count 502
Applied a total of 3 rules in 372 ms. Remains 3733 /3774 variables (removed 41) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3733 cols
[2022-05-19 23:17:18] [INFO ] Computed 3233 place invariants in 28 ms
[2022-05-19 23:17:20] [INFO ] Implicit Places using invariants in 2397 ms returned []
// Phase 1: matrix 502 rows 3733 cols
[2022-05-19 23:17:20] [INFO ] Computed 3233 place invariants in 26 ms
[2022-05-19 23:17:31] [INFO ] Implicit Places using invariants and state equation in 11458 ms returned [2312, 2313, 2314, 2315, 2316, 2317, 2318, 2319, 2324, 2325, 2328, 2329, 2330, 2331, 2332, 2333, 2334, 2335, 2336, 2337, 2338, 2339, 2340, 2341, 2342, 2343, 2352, 2353, 2354, 2355, 2356, 2357, 2358, 3376, 3377, 3378, 3379, 3380, 3381, 3382, 3383, 3706, 3709, 3710, 3711, 3712, 3713, 3714, 3715, 3716, 3717, 3718, 3719, 3720, 3721, 3722, 3723, 3724, 3725, 3726, 3727, 3728, 3729, 3730, 3731, 3732]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 13863 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3667/3774 places, 502/506 transitions.
Applied a total of 0 rules in 180 ms. Remains 3667 /3667 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3667/3774 places, 502/506 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 (ADD s125 s126 s127 s128 s129 s130 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s156 s157 s158 s163 s164 s165...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-03 finished in 14567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F(p1))))'
Support contains 1123 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 43442 edges and 3774 vertex of which 3737 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.16 ms
Discarding 37 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3734 transition count 503
Applied a total of 5 rules in 360 ms. Remains 3734 /3774 variables (removed 40) and now considering 503/506 (removed 3) transitions.
// Phase 1: matrix 503 rows 3734 cols
[2022-05-19 23:17:32] [INFO ] Computed 3233 place invariants in 107 ms
[2022-05-19 23:17:34] [INFO ] Implicit Places using invariants in 2392 ms returned []
// Phase 1: matrix 503 rows 3734 cols
[2022-05-19 23:17:35] [INFO ] Computed 3233 place invariants in 123 ms
[2022-05-19 23:17:42] [INFO ] Implicit Places using invariants and state equation in 7610 ms returned [2280, 2281, 2282, 2283, 2284, 2285, 2286, 2287, 2292, 2293, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2320, 2321, 2322, 2323, 2324, 2325, 2326, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3351, 3707, 3710, 3711, 3712, 3713, 3714, 3715, 3716, 3717, 3718, 3719, 3720, 3721, 3722, 3723, 3724, 3725, 3726, 3727, 3728, 3729, 3730, 3731, 3732, 3733]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 10015 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3668/3774 places, 503/506 transitions.
Applied a total of 0 rules in 435 ms. Remains 3668 /3668 variables (removed 0) and now considering 503/503 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3668/3774 places, 503/506 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-04 finished in 10955 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U G(p1))||(p2 U p3)))))'
Support contains 103 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 3739 transition count 506
Applied a total of 35 rules in 274 ms. Remains 3739 /3774 variables (removed 35) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3739 cols
[2022-05-19 23:17:43] [INFO ] Computed 3234 place invariants in 79 ms
[2022-05-19 23:17:49] [INFO ] Implicit Places using invariants in 6018 ms returned []
// Phase 1: matrix 506 rows 3739 cols
[2022-05-19 23:17:49] [INFO ] Computed 3234 place invariants in 81 ms
[2022-05-19 23:18:09] [INFO ] Implicit Places using invariants and state equation in 19552 ms returned [2283, 2284, 2285, 2286, 2287, 2288, 2289, 2290, 2295, 2296, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2313, 2314, 2323, 2324, 2325, 2326, 2327, 2328, 2329]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 25578 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3706/3774 places, 506/506 transitions.
Applied a total of 0 rules in 240 ms. Remains 3706 /3706 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3706/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 418 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ (ADD s3516 s3517 s3518 s3519 s3520 s3521 s3522 s3523 s3524 s3525 s3526 s3527 s3528 s3529 s3530 s3531 s3532 s3533 s3534 s3535 s3536 s3537 s3538 s35...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2716 reset in 825 ms.
Product exploration explored 100000 steps with 2711 reset in 691 ms.
Computed a total of 3706 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3706 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p3) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2))))]
Knowledge based reduction with 12 factoid took 1024 ms. Reduced automaton from 10 states, 31 edges and 4 AP to 10 states, 31 edges and 4 AP.
Stuttering acceptance computed with spot in 399 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 506 rows 3706 cols
[2022-05-19 23:18:13] [INFO ] Computed 3201 place invariants in 79 ms
[2022-05-19 23:18:15] [INFO ] After 1226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-19 23:18:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-19 23:18:17] [INFO ] [Nat]Absence check using 1 positive and 3200 generalized place invariants in 767 ms returned sat
[2022-05-19 23:18:40] [INFO ] After 22022ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-19 23:18:40] [INFO ] After 22033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 23:18:40] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 103 out of 3706 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3706/3706 places, 506/506 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3706 transition count 501
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 3705 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 3704 transition count 500
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 41 place count 3704 transition count 467
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 74 place count 3671 transition count 467
Applied a total of 74 rules in 559 ms. Remains 3671 /3706 variables (removed 35) and now considering 467/506 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 3671/3706 places, 467/506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Interrupted probabilistic random walk after 417799 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 417799 steps, saw 52725 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 467 rows 3671 cols
[2022-05-19 23:18:44] [INFO ] Computed 3204 place invariants in 364 ms
[2022-05-19 23:18:46] [INFO ] After 1267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-19 23:18:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2022-05-19 23:18:48] [INFO ] [Nat]Absence check using 35 positive and 3169 generalized place invariants in 680 ms returned sat
[2022-05-19 23:19:11] [INFO ] After 22189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 23:19:11] [INFO ] After 22212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 23:19:11] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 103 out of 3671 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3671/3671 places, 467/467 transitions.
Applied a total of 0 rules in 228 ms. Remains 3671 /3671 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3671/3671 places, 467/467 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3671/3671 places, 467/467 transitions.
Applied a total of 0 rules in 189 ms. Remains 3671 /3671 variables (removed 0) and now considering 467/467 (removed 0) transitions.
// Phase 1: matrix 467 rows 3671 cols
[2022-05-19 23:19:12] [INFO ] Computed 3204 place invariants in 322 ms
[2022-05-19 23:19:20] [INFO ] Implicit Places using invariants in 8630 ms returned [188, 189]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 8633 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 3669/3671 places, 467/467 transitions.
Applied a total of 0 rules in 195 ms. Remains 3669 /3669 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3669/3671 places, 467/467 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Interrupted probabilistic random walk after 431618 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431618 steps, saw 54419 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 467 rows 3669 cols
[2022-05-19 23:19:24] [INFO ] Computed 3202 place invariants in 308 ms
[2022-05-19 23:19:25] [INFO ] After 1216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-19 23:19:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-05-19 23:19:27] [INFO ] [Nat]Absence check using 34 positive and 3168 generalized place invariants in 770 ms returned sat
[2022-05-19 23:19:50] [INFO ] After 21973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-19 23:19:50] [INFO ] After 21977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 23:19:50] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 103 out of 3669 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3669/3669 places, 467/467 transitions.
Applied a total of 0 rules in 199 ms. Remains 3669 /3669 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3669/3669 places, 467/467 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3669/3669 places, 467/467 transitions.
Applied a total of 0 rules in 167 ms. Remains 3669 /3669 variables (removed 0) and now considering 467/467 (removed 0) transitions.
// Phase 1: matrix 467 rows 3669 cols
[2022-05-19 23:19:51] [INFO ] Computed 3202 place invariants in 339 ms
[2022-05-19 23:19:59] [INFO ] Implicit Places using invariants in 8539 ms returned []
// Phase 1: matrix 467 rows 3669 cols
[2022-05-19 23:19:59] [INFO ] Computed 3202 place invariants in 338 ms
[2022-05-19 23:20:16] [INFO ] Implicit Places using invariants and state equation in 17189 ms returned []
Implicit Place search using SMT with State Equation took 25747 ms to find 0 implicit places.
[2022-05-19 23:20:16] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 467 rows 3669 cols
[2022-05-19 23:20:17] [INFO ] Computed 3202 place invariants in 299 ms
[2022-05-19 23:20:18] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3669/3669 places, 467/467 transitions.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p3) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (F (AND (NOT p3) p2)), (F (AND (NOT p3) p2 p1)), (F (AND (NOT p3) p2 (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 973 ms. Reduced automaton from 10 states, 31 edges and 4 AP to 10 states, 31 edges and 4 AP.
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 103 out of 3706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3706/3706 places, 506/506 transitions.
Applied a total of 0 rules in 244 ms. Remains 3706 /3706 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3706 cols
[2022-05-19 23:20:20] [INFO ] Computed 3201 place invariants in 74 ms
[2022-05-19 23:20:26] [INFO ] Implicit Places using invariants in 6073 ms returned []
// Phase 1: matrix 506 rows 3706 cols
[2022-05-19 23:20:26] [INFO ] Computed 3201 place invariants in 77 ms
[2022-05-19 23:20:42] [INFO ] Implicit Places using invariants and state equation in 15698 ms returned []
Implicit Place search using SMT with State Equation took 21775 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3706 cols
[2022-05-19 23:20:42] [INFO ] Computed 3201 place invariants in 73 ms
[2022-05-19 23:20:43] [INFO ] Dead Transitions using invariants and state equation in 1530 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3706/3706 places, 506/506 transitions.
Computed a total of 3706 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3706 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 p2 (NOT p0) p1), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2 (NOT p0) p1))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1))))]
Knowledge based reduction with 12 factoid took 948 ms. Reduced automaton from 10 states, 31 edges and 4 AP to 10 states, 31 edges and 4 AP.
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 506 rows 3706 cols
[2022-05-19 23:20:46] [INFO ] Computed 3201 place invariants in 66 ms
[2022-05-19 23:20:47] [INFO ] After 1280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-19 23:20:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-19 23:20:49] [INFO ] [Nat]Absence check using 1 positive and 3200 generalized place invariants in 723 ms returned sat
[2022-05-19 23:21:12] [INFO ] After 22124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-19 23:21:12] [INFO ] After 22135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 23:21:12] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 103 out of 3706 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3706/3706 places, 506/506 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3706 transition count 501
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 3705 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 3704 transition count 500
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 41 place count 3704 transition count 467
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 74 place count 3671 transition count 467
Applied a total of 74 rules in 500 ms. Remains 3671 /3706 variables (removed 35) and now considering 467/506 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 3671/3706 places, 467/506 transitions.
Incomplete random walk after 10000 steps, including 265 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Interrupted probabilistic random walk after 491010 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 491010 steps, saw 61584 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 467 rows 3671 cols
[2022-05-19 23:21:17] [INFO ] Computed 3204 place invariants in 330 ms
[2022-05-19 23:21:18] [INFO ] After 1354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-19 23:21:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-19 23:21:20] [INFO ] [Nat]Absence check using 35 positive and 3169 generalized place invariants in 693 ms returned sat
[2022-05-19 23:21:43] [INFO ] After 22194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 23:21:43] [INFO ] After 22196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-19 23:21:43] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 103 out of 3671 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3671/3671 places, 467/467 transitions.
Applied a total of 0 rules in 171 ms. Remains 3671 /3671 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3671/3671 places, 467/467 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3671/3671 places, 467/467 transitions.
Applied a total of 0 rules in 176 ms. Remains 3671 /3671 variables (removed 0) and now considering 467/467 (removed 0) transitions.
// Phase 1: matrix 467 rows 3671 cols
[2022-05-19 23:21:44] [INFO ] Computed 3204 place invariants in 313 ms
[2022-05-19 23:21:52] [INFO ] Implicit Places using invariants in 8684 ms returned [188]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8687 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 3670/3671 places, 467/467 transitions.
Applied a total of 0 rules in 179 ms. Remains 3670 /3670 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3670/3671 places, 467/467 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Interrupted probabilistic random walk after 465302 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 465302 steps, saw 58624 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 467 rows 3670 cols
[2022-05-19 23:21:56] [INFO ] Computed 3203 place invariants in 324 ms
[2022-05-19 23:21:57] [INFO ] After 1199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-19 23:21:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-19 23:21:59] [INFO ] [Nat]Absence check using 35 positive and 3168 generalized place invariants in 705 ms returned sat
[2022-05-19 23:22:23] [INFO ] After 22047ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-19 23:22:23] [INFO ] After 22050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-19 23:22:23] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 103 out of 3670 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3670/3670 places, 467/467 transitions.
Applied a total of 0 rules in 208 ms. Remains 3670 /3670 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3670/3670 places, 467/467 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3670/3670 places, 467/467 transitions.
Applied a total of 0 rules in 189 ms. Remains 3670 /3670 variables (removed 0) and now considering 467/467 (removed 0) transitions.
// Phase 1: matrix 467 rows 3670 cols
[2022-05-19 23:22:23] [INFO ] Computed 3203 place invariants in 304 ms
[2022-05-19 23:22:32] [INFO ] Implicit Places using invariants in 8924 ms returned [188]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8926 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 3669/3670 places, 467/467 transitions.
Applied a total of 0 rules in 170 ms. Remains 3669 /3669 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3669/3670 places, 467/467 transitions.
Knowledge obtained : [(AND p3 p2 (NOT p0) p1), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2 (NOT p0) p1))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (F (AND p2 (NOT p3))), (F (AND p1 p2 (NOT p3))), (F (AND (NOT p0) p1 p2 (NOT p3)))]
Knowledge based reduction with 12 factoid took 1074 ms. Reduced automaton from 10 states, 31 edges and 4 AP to 10 states, 31 edges and 4 AP.
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 2711 reset in 682 ms.
Product exploration explored 100000 steps with 2725 reset in 681 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 103 out of 3706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3706/3706 places, 506/506 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3706 transition count 508
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 672 ms. Remains 3706 /3706 variables (removed 0) and now considering 508/506 (removed -2) transitions.
[2022-05-19 23:22:37] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 508 rows 3706 cols
[2022-05-19 23:22:37] [INFO ] Computed 3201 place invariants in 73 ms
[2022-05-19 23:22:38] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3706/3706 places, 508/506 transitions.
Finished structural reductions, in 1 iterations. Remains : 3706/3706 places, 508/506 transitions.
Product exploration explored 100000 steps with 2714 reset in 1074 ms.
Product exploration explored 100000 steps with 2714 reset in 1089 ms.
Built C files in :
/tmp/ltsmin6920095663827766569
[2022-05-19 23:22:40] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6920095663827766569
Running compilation step : cd /tmp/ltsmin6920095663827766569;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2324 ms.
Running link step : cd /tmp/ltsmin6920095663827766569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6920095663827766569;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14943183827787073018.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 103 out of 3706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3706/3706 places, 506/506 transitions.
Applied a total of 0 rules in 232 ms. Remains 3706 /3706 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3706 cols
[2022-05-19 23:22:55] [INFO ] Computed 3201 place invariants in 71 ms
[2022-05-19 23:22:59] [INFO ] Implicit Places using invariants in 3300 ms returned []
// Phase 1: matrix 506 rows 3706 cols
[2022-05-19 23:22:59] [INFO ] Computed 3201 place invariants in 73 ms
[2022-05-19 23:23:02] [INFO ] Implicit Places using invariants and state equation in 3301 ms returned []
Implicit Place search using SMT with State Equation took 6603 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3706 cols
[2022-05-19 23:23:02] [INFO ] Computed 3201 place invariants in 82 ms
[2022-05-19 23:23:03] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3706/3706 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin14415764568387344758
[2022-05-19 23:23:03] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14415764568387344758
Running compilation step : cd /tmp/ltsmin14415764568387344758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2370 ms.
Running link step : cd /tmp/ltsmin14415764568387344758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14415764568387344758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5351402588640215146.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 23:23:19] [INFO ] Flatten gal took : 85 ms
[2022-05-19 23:23:19] [INFO ] Flatten gal took : 83 ms
[2022-05-19 23:23:19] [INFO ] Time to serialize gal into /tmp/LTL6855331640317342918.gal : 9 ms
[2022-05-19 23:23:19] [INFO ] Time to serialize properties into /tmp/LTL12739468395204449933.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/LTL6855331640317342918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12739468395204449933.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/LTL6855331...267
Read 1 LTL properties
Checking formula 0 : !((X(X(((G("(CstopAbort>=1)"))U(G("(((((((n6_25+n6_26)+(n6_23+n6_24))+((n6_21+n6_22)+(n6_19+n6_20)))+(((n6_31+n6_32)+(n6_29+n6_30))+((...861
Formula 0 simplified : !XX((G"(CstopAbort>=1)" U G"(((((((n6_25+n6_26)+(n6_23+n6_24))+((n6_21+n6_22)+(n6_19+n6_20)))+(((n6_31+n6_32)+(n6_29+n6_30))+((n6_27...850
Detected timeout of ITS tools.
[2022-05-19 23:23:34] [INFO ] Flatten gal took : 84 ms
[2022-05-19 23:23:34] [INFO ] Applying decomposition
[2022-05-19 23:23:34] [INFO ] Flatten gal took : 98 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/graph10158093385388561006.txt' '-o' '/tmp/graph10158093385388561006.bin' '-w' '/tmp/graph10158093385388561006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10158093385388561006.bin' '-l' '-1' '-v' '-w' '/tmp/graph10158093385388561006.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:23:34] [INFO ] Decomposing Gal with order
[2022-05-19 23:23:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:23:35] [INFO ] Removed a total of 232 redundant transitions.
[2022-05-19 23:23:35] [INFO ] Flatten gal took : 296 ms
[2022-05-19 23:23:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 44 ms.
[2022-05-19 23:23:35] [INFO ] Time to serialize gal into /tmp/LTL978481741787661619.gal : 18 ms
[2022-05-19 23:23:35] [INFO ] Time to serialize properties into /tmp/LTL7486835097361637309.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/LTL978481741787661619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7486835097361637309.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/LTL9784817...265
Read 1 LTL properties
Checking formula 0 : !((X(X(((G("(gi1.gu24.CstopAbort>=1)"))U(G("(((((((gu44.n6_25+gu44.n6_26)+(gu44.n6_23+gu44.n6_24))+((gu44.n6_21+gu44.n6_22)+(gu44.n6_1...1322
Formula 0 simplified : !XX((G"(gi1.gu24.CstopAbort>=1)" U G"(((((((gu44.n6_25+gu44.n6_26)+(gu44.n6_23+gu44.n6_24))+((gu44.n6_21+gu44.n6_22)+(gu44.n6_19+gu4...1311
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5309160716714226607
[2022-05-19 23:23:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5309160716714226607
Running compilation step : cd /tmp/ltsmin5309160716714226607;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2285 ms.
Running link step : cd /tmp/ltsmin5309160716714226607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5309160716714226607;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((([]((LTLAPp0==true)) U []((LTLAPp1==true)))||((LTLAPp2==true) U (LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-05 finished in 382389 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1122 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 43442 edges and 3774 vertex of which 2582 are kept as prefixes of interest. Removing 1192 places using SCC suffix rule.15 ms
Discarding 1192 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2581 transition count 442
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2547 transition count 374
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2547 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 2546 transition count 373
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 2546 transition count 373
Applied a total of 102 rules in 546 ms. Remains 2546 /3774 variables (removed 1228) and now considering 373/506 (removed 133) transitions.
// Phase 1: matrix 373 rows 2546 cols
[2022-05-19 23:24:06] [INFO ] Computed 2176 place invariants in 13 ms
[2022-05-19 23:24:08] [INFO ] Implicit Places using invariants in 2103 ms returned []
// Phase 1: matrix 373 rows 2546 cols
[2022-05-19 23:24:08] [INFO ] Computed 2176 place invariants in 16 ms
[2022-05-19 23:24:11] [INFO ] Implicit Places using invariants and state equation in 3331 ms returned [1125, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1137, 1138, 1141, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 2189, 2190, 2191, 2192, 2193, 2194, 2195, 2196, 2519, 2522, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2544, 2545]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 5441 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2480/3774 places, 373/506 transitions.
Applied a total of 0 rules in 91 ms. Remains 2480 /2480 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2480/3774 places, 373/506 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s2348 s2349 s2350 s2351 s2352 s2353 s2354 s2355 s2356 s2357 s2358 s2359 s2360 s2361 s2362 s2363 s2364 s2365 s2366 s2367 s2368 s2369 s2370 s23...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2446 reset in 1617 ms.
Product exploration explored 100000 steps with 2440 reset in 1615 ms.
Computed a total of 2480 stabilizing places and 373 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2480 transition count 373
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1030087 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1030087 steps, saw 125438 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 2480 cols
[2022-05-19 23:24:18] [INFO ] Computed 2112 place invariants in 15 ms
[2022-05-19 23:24:19] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:24:19] [INFO ] [Nat]Absence check using 0 positive and 2112 generalized place invariants in 422 ms returned sat
[2022-05-19 23:24:20] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:24:21] [INFO ] After 1239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9371 ms.
[2022-05-19 23:24:30] [INFO ] After 11360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 69 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 1122 out of 2480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2480/2480 places, 373/373 transitions.
Applied a total of 0 rules in 88 ms. Remains 2480 /2480 variables (removed 0) and now considering 373/373 (removed 0) transitions.
// Phase 1: matrix 373 rows 2480 cols
[2022-05-19 23:24:30] [INFO ] Computed 2112 place invariants in 9 ms
[2022-05-19 23:24:32] [INFO ] Implicit Places using invariants in 1937 ms returned []
// Phase 1: matrix 373 rows 2480 cols
[2022-05-19 23:24:32] [INFO ] Computed 2112 place invariants in 9 ms
[2022-05-19 23:24:35] [INFO ] Implicit Places using invariants and state equation in 3082 ms returned []
Implicit Place search using SMT with State Equation took 5036 ms to find 0 implicit places.
[2022-05-19 23:24:36] [INFO ] Redundant transitions in 26 ms returned [369]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 372 rows 2480 cols
[2022-05-19 23:24:36] [INFO ] Computed 2112 place invariants in 11 ms
[2022-05-19 23:24:36] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2480/2480 places, 372/373 transitions.
Graph (complete) has 39734 edges and 2480 vertex of which 1390 are kept as prefixes of interest. Removing 1090 places using SCC suffix rule.9 ms
Discarding 1090 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 1358 transition count 307
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 1358 transition count 307
Applied a total of 65 rules in 34 ms. Remains 1358 /2480 variables (removed 1122) and now considering 307/372 (removed 65) transitions.
// Phase 1: matrix 307 rows 1358 cols
[2022-05-19 23:24:36] [INFO ] Computed 1056 place invariants in 5 ms
[2022-05-19 23:24:37] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 307 rows 1358 cols
[2022-05-19 23:24:37] [INFO ] Computed 1056 place invariants in 5 ms
[2022-05-19 23:24:38] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1358/2480 places, 307/373 transitions.
Finished structural reductions, in 2 iterations. Remains : 1358/2480 places, 307/373 transitions.
Computed a total of 1358 stabilizing places and 307 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1358 transition count 307
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1069568 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1069568 steps, saw 129955 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 1358 cols
[2022-05-19 23:24:41] [INFO ] Computed 1056 place invariants in 12 ms
[2022-05-19 23:24:42] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:24:42] [INFO ] [Nat]Absence check using 0 positive and 1056 generalized place invariants in 175 ms returned sat
[2022-05-19 23:24:43] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:24:43] [INFO ] After 791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 166 ms.
[2022-05-19 23:24:43] [INFO ] After 1317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2440 reset in 1594 ms.
Product exploration explored 100000 steps with 2439 reset in 1634 ms.
Built C files in :
/tmp/ltsmin9200563705325630317
[2022-05-19 23:24:47] [INFO ] Computing symmetric may disable matrix : 307 transitions.
[2022-05-19 23:24:47] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:24:47] [INFO ] Computing symmetric may enable matrix : 307 transitions.
[2022-05-19 23:24:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:24:47] [INFO ] Computing Do-Not-Accords matrix : 307 transitions.
[2022-05-19 23:24:47] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:24:47] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9200563705325630317
Running compilation step : cd /tmp/ltsmin9200563705325630317;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1273 ms.
Running link step : cd /tmp/ltsmin9200563705325630317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9200563705325630317;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased769925540845480281.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1122 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 307/307 transitions.
Applied a total of 0 rules in 20 ms. Remains 1358 /1358 variables (removed 0) and now considering 307/307 (removed 0) transitions.
// Phase 1: matrix 307 rows 1358 cols
[2022-05-19 23:25:02] [INFO ] Computed 1056 place invariants in 5 ms
[2022-05-19 23:25:02] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 307 rows 1358 cols
[2022-05-19 23:25:02] [INFO ] Computed 1056 place invariants in 10 ms
[2022-05-19 23:25:03] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2022-05-19 23:25:03] [INFO ] Redundant transitions in 27 ms returned [303]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 306 rows 1358 cols
[2022-05-19 23:25:03] [INFO ] Computed 1056 place invariants in 5 ms
[2022-05-19 23:25:03] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1358/1358 places, 306/307 transitions.
Graph (complete) has 2609 edges and 1358 vertex of which 1357 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 13 ms. Remains 1357 /1358 variables (removed 1) and now considering 305/306 (removed 1) transitions.
// Phase 1: matrix 305 rows 1357 cols
[2022-05-19 23:25:03] [INFO ] Computed 1056 place invariants in 13 ms
[2022-05-19 23:25:04] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 305 rows 1357 cols
[2022-05-19 23:25:04] [INFO ] Computed 1056 place invariants in 9 ms
[2022-05-19 23:25:05] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1357/1358 places, 305/307 transitions.
Finished structural reductions, in 2 iterations. Remains : 1357/1358 places, 305/307 transitions.
Built C files in :
/tmp/ltsmin1937457088137355282
[2022-05-19 23:25:05] [INFO ] Computing symmetric may disable matrix : 305 transitions.
[2022-05-19 23:25:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:25:05] [INFO ] Computing symmetric may enable matrix : 305 transitions.
[2022-05-19 23:25:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:25:05] [INFO ] Computing Do-Not-Accords matrix : 305 transitions.
[2022-05-19 23:25:05] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:25:05] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1937457088137355282
Running compilation step : cd /tmp/ltsmin1937457088137355282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1216 ms.
Running link step : cd /tmp/ltsmin1937457088137355282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1937457088137355282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14901018878987973182.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 23:25:20] [INFO ] Flatten gal took : 30 ms
[2022-05-19 23:25:20] [INFO ] Flatten gal took : 30 ms
[2022-05-19 23:25:20] [INFO ] Time to serialize gal into /tmp/LTL506937696605411414.gal : 4 ms
[2022-05-19 23:25:20] [INFO ] Time to serialize properties into /tmp/LTL8669932833123922303.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/LTL506937696605411414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8669932833123922303.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/LTL5069376...265
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((n5_24+n5_25)+(n5_26+n5_27))+((n5_20+n5_21)+(n5_22+n5_23)))+(((n5_32+n5_28)+(n5_29+n5_30))+((n5_31+n5_9)+(n5_8+n5_11))))...11605
Formula 0 simplified : !GF"(((((((n5_24+n5_25)+(n5_26+n5_27))+((n5_20+n5_21)+(n5_22+n5_23)))+(((n5_32+n5_28)+(n5_29+n5_30))+((n5_31+n5_9)+(n5_8+n5_11))))+(...11599
Detected timeout of ITS tools.
[2022-05-19 23:25:35] [INFO ] Flatten gal took : 31 ms
[2022-05-19 23:25:35] [INFO ] Applying decomposition
[2022-05-19 23:25:35] [INFO ] Flatten gal took : 30 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/graph17103760602524853703.txt' '-o' '/tmp/graph17103760602524853703.bin' '-w' '/tmp/graph17103760602524853703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17103760602524853703.bin' '-l' '-1' '-v' '-w' '/tmp/graph17103760602524853703.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:25:36] [INFO ] Decomposing Gal with order
[2022-05-19 23:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:25:36] [INFO ] Removed a total of 294 redundant transitions.
[2022-05-19 23:25:36] [INFO ] Flatten gal took : 44 ms
[2022-05-19 23:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 52 ms.
[2022-05-19 23:25:37] [INFO ] Time to serialize gal into /tmp/LTL16875541013290658171.gal : 4 ms
[2022-05-19 23:25:37] [INFO ] Time to serialize properties into /tmp/LTL6398073163500355948.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/LTL16875541013290658171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6398073163500355948.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/LTL1687554...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((gu55.n5_24+gu55.n5_25)+(gu55.n5_26+gu55.n5_27))+((gu55.n5_20+gu55.n5_21)+(gu55.n5_22+gu55.n5_23)))+(((gu55.n5_32+gu55.n...17215
Formula 0 simplified : !GF"(((((((gu55.n5_24+gu55.n5_25)+(gu55.n5_26+gu55.n5_27))+((gu55.n5_20+gu55.n5_21)+(gu55.n5_22+gu55.n5_23)))+(((gu55.n5_32+gu55.n5_...17209
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3632173936595866704
[2022-05-19 23:25:52] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3632173936595866704
Running compilation step : cd /tmp/ltsmin3632173936595866704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 997 ms.
Running link step : cd /tmp/ltsmin3632173936595866704;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3632173936595866704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-06 finished in 121612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((X(p1)&&!F(p0))))))'
Support contains 1124 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 3736 transition count 506
Applied a total of 38 rules in 126 ms. Remains 3736 /3774 variables (removed 38) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 23:26:07] [INFO ] Computed 3232 place invariants in 35 ms
[2022-05-19 23:26:09] [INFO ] Implicit Places using invariants in 2352 ms returned []
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 23:26:09] [INFO ] Computed 3232 place invariants in 34 ms
[2022-05-19 23:26:19] [INFO ] Implicit Places using invariants and state equation in 9934 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 12296 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3774 places, 506/506 transitions.
Applied a total of 0 rules in 130 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s220 (ADD s2287 s2288 s2289 s2290 s2291 s2292 s2293 s2294 s2295 s2296 s2297 s2298 s2299 s2300 s2301 s2302 s2303 s2304 s2305 s2306 s2307 s2308 s230...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-07 finished in 12731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((((false U p0)||G(p1)) U X(p0))))))'
Support contains 4 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 3737 transition count 506
Applied a total of 37 rules in 245 ms. Remains 3737 /3774 variables (removed 37) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2022-05-19 23:26:20] [INFO ] Computed 3233 place invariants in 24 ms
[2022-05-19 23:26:26] [INFO ] Implicit Places using invariants in 6062 ms returned []
// Phase 1: matrix 506 rows 3737 cols
[2022-05-19 23:26:26] [INFO ] Computed 3233 place invariants in 24 ms
[2022-05-19 23:26:40] [INFO ] Implicit Places using invariants and state equation in 14737 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 20812 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3774 places, 506/506 transitions.
Applied a total of 0 rules in 235 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3704/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 2}]], initial=0, aps=[p0:(LEQ s3520 s3513), p1:(LEQ s156 s220)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33213 reset in 826 ms.
Product exploration explored 100000 steps with 33407 reset in 877 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (OR p0 p1))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 718 ms. Reduced automaton from 6 states, 23 edges and 2 AP to 5 states, 18 edges and 2 AP.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 636080 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 636080 steps, saw 77879 distinct states, run finished after 3003 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 506 rows 3704 cols
[2022-05-19 23:26:48] [INFO ] Computed 3200 place invariants in 32 ms
[2022-05-19 23:26:48] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 23:26:50] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 770 ms returned sat
[2022-05-19 23:26:52] [INFO ] After 1759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 23:26:52] [INFO ] After 2501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 520 ms.
[2022-05-19 23:26:53] [INFO ] After 4687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 91 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=22 )
Parikh walk visited 5 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (OR p0 p1))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 671 ms. Reduced automaton from 5 states, 18 edges and 2 AP to 5 states, 18 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Support contains 4 out of 3704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3704/3704 places, 506/506 transitions.
Graph (complete) has 40926 edges and 3704 vertex of which 3638 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.9 ms
Discarding 66 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3636 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3636 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 3635 transition count 502
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3635 transition count 502
Applied a total of 6 rules in 993 ms. Remains 3635 /3704 variables (removed 69) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3635 cols
[2022-05-19 23:26:55] [INFO ] Computed 3136 place invariants in 20 ms
[2022-05-19 23:27:01] [INFO ] Implicit Places using invariants in 5965 ms returned []
// Phase 1: matrix 502 rows 3635 cols
[2022-05-19 23:27:01] [INFO ] Computed 3136 place invariants in 21 ms
[2022-05-19 23:27:12] [INFO ] Implicit Places using invariants and state equation in 10936 ms returned [3244, 3245, 3246, 3247, 3248, 3249, 3250, 3251, 3608, 3611, 3612, 3613, 3614, 3615, 3616, 3617, 3618, 3619, 3620, 3621, 3622, 3623, 3624, 3625, 3626, 3627, 3628, 3629, 3630, 3631, 3632, 3633, 3634]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16907 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3602/3704 places, 502/506 transitions.
Applied a total of 0 rules in 257 ms. Remains 3602 /3602 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3602/3704 places, 502/506 transitions.
Computed a total of 3602 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3602 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 651 ms. Reduced automaton from 5 states, 18 edges and 2 AP to 5 states, 18 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 791217 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 791217 steps, saw 97181 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:27:17] [INFO ] Computed 3104 place invariants in 18 ms
[2022-05-19 23:27:18] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 23:27:19] [INFO ] [Nat]Absence check using 0 positive and 3104 generalized place invariants in 733 ms returned sat
[2022-05-19 23:27:21] [INFO ] After 1655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 23:27:22] [INFO ] After 2466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 539 ms.
[2022-05-19 23:27:22] [INFO ] After 4615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 93 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=31 )
Parikh walk visited 5 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 716 ms. Reduced automaton from 5 states, 18 edges and 2 AP to 5 states, 18 edges and 2 AP.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 33247 reset in 911 ms.
Product exploration explored 100000 steps with 33302 reset in 926 ms.
Built C files in :
/tmp/ltsmin13226381818135618605
[2022-05-19 23:27:25] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2022-05-19 23:27:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:27:25] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2022-05-19 23:27:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:27:25] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2022-05-19 23:27:25] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:27:25] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13226381818135618605
Running compilation step : cd /tmp/ltsmin13226381818135618605;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2801 ms.
Running link step : cd /tmp/ltsmin13226381818135618605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13226381818135618605;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3417326837296411782.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 3602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3602/3602 places, 502/502 transitions.
Applied a total of 0 rules in 264 ms. Remains 3602 /3602 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:27:41] [INFO ] Computed 3104 place invariants in 21 ms
[2022-05-19 23:27:46] [INFO ] Implicit Places using invariants in 5610 ms returned []
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:27:46] [INFO ] Computed 3104 place invariants in 19 ms
[2022-05-19 23:27:57] [INFO ] Implicit Places using invariants and state equation in 10430 ms returned []
Implicit Place search using SMT with State Equation took 16045 ms to find 0 implicit places.
[2022-05-19 23:27:57] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:27:57] [INFO ] Computed 3104 place invariants in 31 ms
[2022-05-19 23:27:58] [INFO ] Dead Transitions using invariants and state equation in 1454 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3602/3602 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin4693698474376651267
[2022-05-19 23:28:00] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2022-05-19 23:28:00] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:28:00] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2022-05-19 23:28:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:28:00] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2022-05-19 23:28:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:28:00] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4693698474376651267
Running compilation step : cd /tmp/ltsmin4693698474376651267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2607 ms.
Running link step : cd /tmp/ltsmin4693698474376651267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4693698474376651267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4237372442263589897.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 23:28:15] [INFO ] Flatten gal took : 79 ms
[2022-05-19 23:28:15] [INFO ] Flatten gal took : 83 ms
[2022-05-19 23:28:15] [INFO ] Time to serialize gal into /tmp/LTL5324669246464271859.gal : 7 ms
[2022-05-19 23:28:15] [INFO ] Time to serialize properties into /tmp/LTL3333621469462494368.ltl : 244 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/LTL5324669246464271859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3333621469462494368.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/LTL5324669...266
Read 1 LTL properties
Checking formula 0 : !((F(G(X((("(n6_19<=SstopOK_10)")||(G("(s3_32<=a5)")))U(X("(n6_19<=SstopOK_10)")))))))
Formula 0 simplified : !FGX(("(n6_19<=SstopOK_10)" | G"(s3_32<=a5)") U X"(n6_19<=SstopOK_10)")
Detected timeout of ITS tools.
[2022-05-19 23:28:30] [INFO ] Flatten gal took : 84 ms
[2022-05-19 23:28:30] [INFO ] Applying decomposition
[2022-05-19 23:28:30] [INFO ] Flatten gal took : 87 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/graph12206575673196045788.txt' '-o' '/tmp/graph12206575673196045788.bin' '-w' '/tmp/graph12206575673196045788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12206575673196045788.bin' '-l' '-1' '-v' '-w' '/tmp/graph12206575673196045788.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:28:31] [INFO ] Decomposing Gal with order
[2022-05-19 23:28:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:28:31] [INFO ] Removed a total of 394 redundant transitions.
[2022-05-19 23:28:31] [INFO ] Flatten gal took : 251 ms
[2022-05-19 23:28:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 564 labels/synchronizations in 167 ms.
[2022-05-19 23:28:32] [INFO ] Time to serialize gal into /tmp/LTL16231808428786054184.gal : 21 ms
[2022-05-19 23:28:32] [INFO ] Time to serialize properties into /tmp/LTL3112220035864203482.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/LTL16231808428786054184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3112220035864203482.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/LTL1623180...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X((("(gu82.n6_19<=gu82.SstopOK_10)")||(G("(gu68.s3_32<=gu68.a5)")))U(X("(gu82.n6_19<=gu82.SstopOK_10)")))))))
Formula 0 simplified : !FGX(("(gu82.n6_19<=gu82.SstopOK_10)" | G"(gu68.s3_32<=gu68.a5)") U X"(gu82.n6_19<=gu82.SstopOK_10)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12525140579121813531
[2022-05-19 23:28:47] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12525140579121813531
Running compilation step : cd /tmp/ltsmin12525140579121813531;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2209 ms.
Running link step : cd /tmp/ltsmin12525140579121813531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin12525140579121813531;'/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((((false U (LTLAPp0==true))||[]((LTLAPp1==true))) U X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-12 finished in 162590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((true U false)))))'
Support contains 0 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 43442 edges and 3774 vertex of which 0 are kept as prefixes of interest. Removing 3774 places using SCC suffix rule.12 ms
Discarding 3774 places :
Also discarding 506 output transitions
Drop transitions removed 506 transitions
Applied a total of 1 rules in 17 ms. Remains 0 /3774 variables (removed 3774) and now considering 0/506 (removed 506) transitions.
[2022-05-19 23:29:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 23:29:02] [INFO ] Implicit Places using invariants in 11 ms returned []
[2022-05-19 23:29:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 23:29:02] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-19 23:29:02] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 23:29:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 23:29:02] [INFO ] Dead Transitions using invariants and state equation in 7 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/3774 places, 0/506 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/3774 places, 0/506 transitions.
Stuttering acceptance computed with spot in 13 ms :[true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-13 finished in 105 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 4 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 3736 transition count 506
Applied a total of 38 rules in 258 ms. Remains 3736 /3774 variables (removed 38) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 23:29:02] [INFO ] Computed 3232 place invariants in 34 ms
[2022-05-19 23:29:06] [INFO ] Implicit Places using invariants in 3197 ms returned []
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 23:29:06] [INFO ] Computed 3232 place invariants in 28 ms
[2022-05-19 23:29:17] [INFO ] Implicit Places using invariants and state equation in 11787 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15014 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3774 places, 506/506 transitions.
Applied a total of 0 rules in 239 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s170 s0), p0:(GT s1510 s226)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-14 finished in 15659 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 43442 edges and 3774 vertex of which 3703 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.10 ms
Discarding 71 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3700 transition count 501
Applied a total of 5 rules in 522 ms. Remains 3700 /3774 variables (removed 74) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3700 cols
[2022-05-19 23:29:18] [INFO ] Computed 3201 place invariants in 105 ms
[2022-05-19 23:29:25] [INFO ] Implicit Places using invariants in 6283 ms returned []
// Phase 1: matrix 501 rows 3700 cols
[2022-05-19 23:29:25] [INFO ] Computed 3201 place invariants in 86 ms
[2022-05-19 23:29:39] [INFO ] Implicit Places using invariants and state equation in 14362 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 20649 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3774 places, 501/506 transitions.
Applied a total of 0 rules in 282 ms. Remains 3634 /3634 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3634/3774 places, 501/506 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3232 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2462 reset in 393 ms.
Product exploration explored 100000 steps with 2465 reset in 412 ms.
Computed a total of 3634 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1875356 steps, run timeout after 3001 ms. (steps per millisecond=624 ) properties seen :{}
Probabilistic random walk after 1875356 steps, saw 224410 distinct states, run finished after 3002 ms. (steps per millisecond=624 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 3634 cols
[2022-05-19 23:29:44] [INFO ] Computed 3136 place invariants in 42 ms
[2022-05-19 23:29:44] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:29:45] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 681 ms returned sat
[2022-05-19 23:29:47] [INFO ] After 1257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:29:47] [INFO ] After 1382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-19 23:29:47] [INFO ] After 2565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 135 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 327 ms :[(NOT p0)]
Support contains 2 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 501/501 transitions.
Applied a total of 0 rules in 262 ms. Remains 3634 /3634 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 3634 cols
[2022-05-19 23:29:48] [INFO ] Computed 3136 place invariants in 44 ms
[2022-05-19 23:29:54] [INFO ] Implicit Places using invariants in 5824 ms returned []
// Phase 1: matrix 501 rows 3634 cols
[2022-05-19 23:29:54] [INFO ] Computed 3136 place invariants in 39 ms
[2022-05-19 23:30:02] [INFO ] Implicit Places using invariants and state equation in 8445 ms returned []
Implicit Place search using SMT with State Equation took 14296 ms to find 0 implicit places.
[2022-05-19 23:30:02] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 501 rows 3634 cols
[2022-05-19 23:30:02] [INFO ] Computed 3136 place invariants in 37 ms
[2022-05-19 23:30:03] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3634/3634 places, 501/501 transitions.
Computed a total of 3634 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1812127 steps, run timeout after 3001 ms. (steps per millisecond=603 ) properties seen :{}
Probabilistic random walk after 1812127 steps, saw 216901 distinct states, run finished after 3001 ms. (steps per millisecond=603 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 3634 cols
[2022-05-19 23:30:07] [INFO ] Computed 3136 place invariants in 44 ms
[2022-05-19 23:30:08] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:30:09] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 707 ms returned sat
[2022-05-19 23:30:10] [INFO ] After 1276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:30:10] [INFO ] After 1408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-05-19 23:30:10] [INFO ] After 2609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 135 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2460 reset in 383 ms.
Product exploration explored 100000 steps with 2465 reset in 413 ms.
Built C files in :
/tmp/ltsmin13375319140143521047
[2022-05-19 23:30:11] [INFO ] Computing symmetric may disable matrix : 501 transitions.
[2022-05-19 23:30:11] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:30:11] [INFO ] Computing symmetric may enable matrix : 501 transitions.
[2022-05-19 23:30:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:30:11] [INFO ] Computing Do-Not-Accords matrix : 501 transitions.
[2022-05-19 23:30:11] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:30:11] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13375319140143521047
Running compilation step : cd /tmp/ltsmin13375319140143521047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2788 ms.
Running link step : cd /tmp/ltsmin13375319140143521047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin13375319140143521047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8947922077892323939.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 501/501 transitions.
Applied a total of 0 rules in 273 ms. Remains 3634 /3634 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 3634 cols
[2022-05-19 23:30:27] [INFO ] Computed 3136 place invariants in 47 ms
[2022-05-19 23:30:30] [INFO ] Implicit Places using invariants in 3220 ms returned []
// Phase 1: matrix 501 rows 3634 cols
[2022-05-19 23:30:30] [INFO ] Computed 3136 place invariants in 38 ms
[2022-05-19 23:30:40] [INFO ] Implicit Places using invariants and state equation in 10565 ms returned []
Implicit Place search using SMT with State Equation took 13787 ms to find 0 implicit places.
[2022-05-19 23:30:40] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 501 rows 3634 cols
[2022-05-19 23:30:41] [INFO ] Computed 3136 place invariants in 45 ms
[2022-05-19 23:30:42] [INFO ] Dead Transitions using invariants and state equation in 1521 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3634/3634 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin15942855666205167909
[2022-05-19 23:30:42] [INFO ] Computing symmetric may disable matrix : 501 transitions.
[2022-05-19 23:30:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:30:42] [INFO ] Computing symmetric may enable matrix : 501 transitions.
[2022-05-19 23:30:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:30:42] [INFO ] Computing Do-Not-Accords matrix : 501 transitions.
[2022-05-19 23:30:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:30:42] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15942855666205167909
Running compilation step : cd /tmp/ltsmin15942855666205167909;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2700 ms.
Running link step : cd /tmp/ltsmin15942855666205167909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15942855666205167909;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13359816698007244129.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 23:30:57] [INFO ] Flatten gal took : 90 ms
[2022-05-19 23:30:57] [INFO ] Flatten gal took : 79 ms
[2022-05-19 23:30:57] [INFO ] Time to serialize gal into /tmp/LTL12571965515491993605.gal : 7 ms
[2022-05-19 23:30:57] [INFO ] Time to serialize properties into /tmp/LTL14696379817038266298.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/LTL12571965515491993605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14696379817038266298.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/LTL1257196...268
Read 1 LTL properties
Checking formula 0 : !((F(G("(n8_7_19<=CstopAbort)"))))
Formula 0 simplified : !FG"(n8_7_19<=CstopAbort)"
Detected timeout of ITS tools.
[2022-05-19 23:31:12] [INFO ] Flatten gal took : 78 ms
[2022-05-19 23:31:12] [INFO ] Applying decomposition
[2022-05-19 23:31:13] [INFO ] Flatten gal took : 77 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/graph7799079100602937366.txt' '-o' '/tmp/graph7799079100602937366.bin' '-w' '/tmp/graph7799079100602937366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7799079100602937366.bin' '-l' '-1' '-v' '-w' '/tmp/graph7799079100602937366.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:31:13] [INFO ] Decomposing Gal with order
[2022-05-19 23:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:31:13] [INFO ] Removed a total of 361 redundant transitions.
[2022-05-19 23:31:13] [INFO ] Flatten gal took : 247 ms
[2022-05-19 23:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 715 labels/synchronizations in 152 ms.
[2022-05-19 23:31:14] [INFO ] Time to serialize gal into /tmp/LTL7666791291479611461.gal : 19 ms
[2022-05-19 23:31:14] [INFO ] Time to serialize properties into /tmp/LTL2747744598885615005.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/LTL7666791291479611461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2747744598885615005.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/LTL7666791...266
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu71.n8_7_19<=gu71.CstopAbort)"))))
Formula 0 simplified : !FG"(gu71.n8_7_19<=gu71.CstopAbort)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12212931371987739702
[2022-05-19 23:31:29] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12212931371987739702
Running compilation step : cd /tmp/ltsmin12212931371987739702;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2198 ms.
Running link step : cd /tmp/ltsmin12212931371987739702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12212931371987739702;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-15 finished in 146102 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U G(p1))||(p2 U p3)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((((false U p0)||G(p1)) U X(p0))))))'
Found a SL insensitive property : QuasiCertifProtocol-PT-32-LTLCardinality-12
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 43442 edges and 3774 vertex of which 3671 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.15 ms
Discarding 103 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3669 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3669 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 3668 transition count 502
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3668 transition count 502
Applied a total of 6 rules in 1018 ms. Remains 3668 /3774 variables (removed 106) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3668 cols
[2022-05-19 23:31:45] [INFO ] Computed 3168 place invariants in 23 ms
[2022-05-19 23:31:51] [INFO ] Implicit Places using invariants in 5848 ms returned []
// Phase 1: matrix 502 rows 3668 cols
[2022-05-19 23:31:51] [INFO ] Computed 3168 place invariants in 18 ms
[2022-05-19 23:32:02] [INFO ] Implicit Places using invariants and state equation in 11002 ms returned [2213, 2214, 2215, 2216, 2217, 2218, 2219, 2220, 2225, 2226, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2244, 2253, 2254, 2255, 2256, 2257, 2258, 2259, 3277, 3278, 3279, 3280, 3281, 3282, 3283, 3284, 3641, 3644, 3645, 3646, 3647, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3656, 3657, 3658, 3659, 3660, 3661, 3662, 3663, 3664, 3665, 3666, 3667]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 16854 ms to find 66 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3602/3774 places, 502/506 transitions.
Applied a total of 0 rules in 256 ms. Remains 3602 /3602 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3602/3774 places, 502/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 2}]], initial=0, aps=[p0:(LEQ s3443 s3436), p1:(LEQ s155 s219)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33245 reset in 906 ms.
Product exploration explored 100000 steps with 33391 reset in 948 ms.
Computed a total of 3602 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3602 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (OR p0 p1))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 609 ms. Reduced automaton from 6 states, 23 edges and 2 AP to 5 states, 18 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 783768 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 783768 steps, saw 96289 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:32:09] [INFO ] Computed 3104 place invariants in 19 ms
[2022-05-19 23:32:10] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 23:32:11] [INFO ] [Nat]Absence check using 0 positive and 3104 generalized place invariants in 748 ms returned sat
[2022-05-19 23:32:13] [INFO ] After 1733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 23:32:14] [INFO ] After 2517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 548 ms.
[2022-05-19 23:32:14] [INFO ] After 4633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 95 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=95 )
Parikh walk visited 5 properties in 7 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (OR p0 p1))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 575 ms. Reduced automaton from 5 states, 18 edges and 2 AP to 5 states, 18 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Support contains 4 out of 3602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3602/3602 places, 502/502 transitions.
Applied a total of 0 rules in 262 ms. Remains 3602 /3602 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:32:16] [INFO ] Computed 3104 place invariants in 23 ms
[2022-05-19 23:32:21] [INFO ] Implicit Places using invariants in 5443 ms returned []
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:32:21] [INFO ] Computed 3104 place invariants in 23 ms
[2022-05-19 23:32:31] [INFO ] Implicit Places using invariants and state equation in 10046 ms returned []
Implicit Place search using SMT with State Equation took 15512 ms to find 0 implicit places.
[2022-05-19 23:32:31] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:32:31] [INFO ] Computed 3104 place invariants in 17 ms
[2022-05-19 23:32:33] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3602/3602 places, 502/502 transitions.
Computed a total of 3602 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3602 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 937 ms. Reduced automaton from 5 states, 18 edges and 2 AP to 5 states, 18 edges and 2 AP.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 850840 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :{}
Probabilistic random walk after 850840 steps, saw 104225 distinct states, run finished after 3004 ms. (steps per millisecond=283 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:32:38] [INFO ] Computed 3104 place invariants in 18 ms
[2022-05-19 23:32:38] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 23:32:39] [INFO ] [Nat]Absence check using 0 positive and 3104 generalized place invariants in 709 ms returned sat
[2022-05-19 23:32:41] [INFO ] After 1673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 23:32:42] [INFO ] After 2447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 527 ms.
[2022-05-19 23:32:43] [INFO ] After 4524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 96 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=24 )
Parikh walk visited 5 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 1243 ms. Reduced automaton from 5 states, 18 edges and 2 AP to 5 states, 18 edges and 2 AP.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 33331 reset in 919 ms.
Product exploration explored 100000 steps with 33430 reset in 929 ms.
Built C files in :
/tmp/ltsmin13435544296117625236
[2022-05-19 23:32:46] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2022-05-19 23:32:46] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:32:46] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2022-05-19 23:32:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:32:46] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2022-05-19 23:32:46] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:32:46] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13435544296117625236
Running compilation step : cd /tmp/ltsmin13435544296117625236;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2707 ms.
Running link step : cd /tmp/ltsmin13435544296117625236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13435544296117625236;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9456422324693687754.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 3602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3602/3602 places, 502/502 transitions.
Applied a total of 0 rules in 256 ms. Remains 3602 /3602 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:33:02] [INFO ] Computed 3104 place invariants in 24 ms
[2022-05-19 23:33:05] [INFO ] Implicit Places using invariants in 3116 ms returned []
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:33:05] [INFO ] Computed 3104 place invariants in 30 ms
[2022-05-19 23:33:13] [INFO ] Implicit Places using invariants and state equation in 8408 ms returned []
Implicit Place search using SMT with State Equation took 11528 ms to find 0 implicit places.
[2022-05-19 23:33:13] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 502 rows 3602 cols
[2022-05-19 23:33:13] [INFO ] Computed 3104 place invariants in 24 ms
[2022-05-19 23:33:15] [INFO ] Dead Transitions using invariants and state equation in 1438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3602/3602 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin6044893778619611141
[2022-05-19 23:33:16] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2022-05-19 23:33:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:33:16] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2022-05-19 23:33:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:33:16] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2022-05-19 23:33:16] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:33:16] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6044893778619611141
Running compilation step : cd /tmp/ltsmin6044893778619611141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2460 ms.
Running link step : cd /tmp/ltsmin6044893778619611141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6044893778619611141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3285122264346812582.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 23:33:31] [INFO ] Flatten gal took : 78 ms
[2022-05-19 23:33:31] [INFO ] Flatten gal took : 75 ms
[2022-05-19 23:33:31] [INFO ] Time to serialize gal into /tmp/LTL3054343625662250656.gal : 7 ms
[2022-05-19 23:33:31] [INFO ] Time to serialize properties into /tmp/LTL16406363097200854226.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/LTL3054343625662250656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16406363097200854226.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/LTL3054343...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X((("(n6_19<=SstopOK_10)")||(G("(s3_32<=a5)")))U(X("(n6_19<=SstopOK_10)")))))))
Formula 0 simplified : !FGX(("(n6_19<=SstopOK_10)" | G"(s3_32<=a5)") U X"(n6_19<=SstopOK_10)")
Detected timeout of ITS tools.
[2022-05-19 23:33:47] [INFO ] Flatten gal took : 75 ms
[2022-05-19 23:33:47] [INFO ] Applying decomposition
[2022-05-19 23:33:47] [INFO ] Flatten gal took : 78 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/graph6557885579970081737.txt' '-o' '/tmp/graph6557885579970081737.bin' '-w' '/tmp/graph6557885579970081737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6557885579970081737.bin' '-l' '-1' '-v' '-w' '/tmp/graph6557885579970081737.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:33:47] [INFO ] Decomposing Gal with order
[2022-05-19 23:33:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:33:48] [INFO ] Removed a total of 392 redundant transitions.
[2022-05-19 23:33:48] [INFO ] Flatten gal took : 243 ms
[2022-05-19 23:33:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 560 labels/synchronizations in 155 ms.
[2022-05-19 23:33:48] [INFO ] Time to serialize gal into /tmp/LTL7784780283866418743.gal : 17 ms
[2022-05-19 23:33:48] [INFO ] Time to serialize properties into /tmp/LTL4509722236298500837.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/LTL7784780283866418743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4509722236298500837.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/LTL7784780...266
Read 1 LTL properties
Checking formula 0 : !((F(G(X((("(gu86.n6_19<=gu86.SstopOK_10)")||(G("(gu60.s3_32<=gu60.a5)")))U(X("(gu86.n6_19<=gu86.SstopOK_10)")))))))
Formula 0 simplified : !FGX(("(gu86.n6_19<=gu86.SstopOK_10)" | G"(gu60.s3_32<=gu60.a5)") U X"(gu86.n6_19<=gu86.SstopOK_10)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3711753895740200651
[2022-05-19 23:34:03] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3711753895740200651
Running compilation step : cd /tmp/ltsmin3711753895740200651;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2147 ms.
Running link step : cd /tmp/ltsmin3711753895740200651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3711753895740200651;'/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((((false U (LTLAPp0==true))||[]((LTLAPp1==true))) U X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-12 finished in 154473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-19 23:34:19] [INFO ] Flatten gal took : 82 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10079309153964931890
[2022-05-19 23:34:19] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2022-05-19 23:34:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:34:19] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2022-05-19 23:34:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:34:19] [INFO ] Applying decomposition
[2022-05-19 23:34:19] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2022-05-19 23:34:19] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:34:19] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10079309153964931890
Running compilation step : cd /tmp/ltsmin10079309153964931890;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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-19 23:34:19] [INFO ] Flatten gal took : 81 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/graph4498844723415311539.txt' '-o' '/tmp/graph4498844723415311539.bin' '-w' '/tmp/graph4498844723415311539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4498844723415311539.bin' '-l' '-1' '-v' '-w' '/tmp/graph4498844723415311539.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:34:21] [INFO ] Decomposing Gal with order
[2022-05-19 23:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:34:21] [INFO ] Removed a total of 190 redundant transitions.
[2022-05-19 23:34:21] [INFO ] Flatten gal took : 261 ms
[2022-05-19 23:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-19 23:34:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality1904181626687914078.gal : 11 ms
[2022-05-19 23:34:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality7323506426194914852.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/LTLCardinality1904181626687914078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7323506426194914852.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/LTLCardina...288
Read 4 LTL properties
Checking formula 0 : !((X(X(((G("(gi0.gu31.CstopAbort>=1)"))U(G("(((((((gi2.gu36.n6_25+gi2.gu36.n6_26)+(gi2.gu36.n6_23+gi2.gu36.n6_24))+((gi2.gu36.n6_21+gi...1458
Formula 0 simplified : !XX((G"(gi0.gu31.CstopAbort>=1)" U G"(((((((gi2.gu36.n6_25+gi2.gu36.n6_26)+(gi2.gu36.n6_23+gi2.gu36.n6_24))+((gi2.gu36.n6_21+gi2.gu3...1447
Compilation finished in 2910 ms.
Running link step : cd /tmp/ltsmin10079309153964931890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10079309153964931890;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((([]((LTLAPp0==true)) U []((LTLAPp1==true)))||((LTLAPp2==true) U (LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10079309153964931890;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((([]((LTLAPp0==true)) U []((LTLAPp1==true)))||((LTLAPp2==true) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10079309153964931890;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 00:01:13] [INFO ] Flatten gal took : 910 ms
[2022-05-20 00:01:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality646138967027630079.gal : 479 ms
[2022-05-20 00:01:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality18080932298626074948.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/LTLCardinality646138967027630079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18080932298626074948.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/LTLCardina...288
Read 4 LTL properties
Checking formula 0 : !((X(X(((G("(CstopAbort>=1)"))U(G("(((((((n6_25+n6_26)+(n6_23+n6_24))+((n6_21+n6_22)+(n6_19+n6_20)))+(((n6_31+n6_32)+(n6_29+n6_30))+((...861
Formula 0 simplified : !XX((G"(CstopAbort>=1)" U G"(((((((n6_25+n6_26)+(n6_23+n6_24))+((n6_21+n6_22)+(n6_19+n6_20)))+(((n6_31+n6_32)+(n6_29+n6_30))+((n6_27...850
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10079309153964931890;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10079309153964931890;'/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((((false U (LTLAPp5==true))||[]((LTLAPp6==true))) U X((LTLAPp5==true))))))' '--buchi-type=spotba'
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="LTLCardinality"
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 QuasiCertifProtocol-PT-32, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017501003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;