Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974900155.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974900155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 625K Mar 5 18:23 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 ShieldRVs-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679167148831

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 19:19:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 19:19:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:19:10] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-03-18 19:19:10] [INFO ] Transformed 2003 places.
[2023-03-18 19:19:10] [INFO ] Transformed 2253 transitions.
[2023-03-18 19:19:10] [INFO ] Found NUPN structural information;
[2023-03-18 19:19:10] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVs-PT-050B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 334 places :
Symmetric choice reduction at 0 with 334 rule applications. Total rules 334 place count 1669 transition count 1919
Iterating global reduction 0 with 334 rules applied. Total rules applied 668 place count 1669 transition count 1919
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 669 place count 1668 transition count 1918
Iterating global reduction 0 with 1 rules applied. Total rules applied 670 place count 1668 transition count 1918
Applied a total of 670 rules in 378 ms. Remains 1668 /2003 variables (removed 335) and now considering 1918/2253 (removed 335) transitions.
// Phase 1: matrix 1918 rows 1668 cols
[2023-03-18 19:19:11] [INFO ] Computed 201 place invariants in 29 ms
[2023-03-18 19:19:12] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-18 19:19:12] [INFO ] Invariant cache hit.
[2023-03-18 19:19:14] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 2639 ms to find 0 implicit places.
[2023-03-18 19:19:14] [INFO ] Invariant cache hit.
[2023-03-18 19:19:15] [INFO ] Dead Transitions using invariants and state equation in 1171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1668/2003 places, 1918/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4190 ms. Remains : 1668/2003 places, 1918/2253 transitions.
Support contains 33 out of 1668 places after structural reductions.
[2023-03-18 19:19:15] [INFO ] Flatten gal took : 169 ms
[2023-03-18 19:19:15] [INFO ] Flatten gal took : 80 ms
[2023-03-18 19:19:15] [INFO ] Input system was already deterministic with 1918 transitions.
Support contains 32 out of 1668 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 19:19:16] [INFO ] Invariant cache hit.
[2023-03-18 19:19:16] [INFO ] [Real]Absence check using 201 positive place invariants in 57 ms returned sat
[2023-03-18 19:19:16] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 19:19:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 92 ms returned sat
[2023-03-18 19:19:18] [INFO ] After 1126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 29 places in 552 ms of which 6 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Deduced a trap composed of 24 places in 520 ms of which 2 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Deduced a trap composed of 23 places in 421 ms of which 2 ms to minimize.
[2023-03-18 19:19:20] [INFO ] Deduced a trap composed of 19 places in 393 ms of which 2 ms to minimize.
[2023-03-18 19:19:20] [INFO ] Deduced a trap composed of 14 places in 422 ms of which 1 ms to minimize.
[2023-03-18 19:19:21] [INFO ] Deduced a trap composed of 36 places in 461 ms of which 1 ms to minimize.
[2023-03-18 19:19:21] [INFO ] Deduced a trap composed of 18 places in 432 ms of which 1 ms to minimize.
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 1 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 19 places in 451 ms of which 1 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 1 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 26 places in 475 ms of which 1 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 23 places in 461 ms of which 1 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 35 places in 453 ms of which 1 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 28 places in 481 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 26 places in 461 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 35 places in 483 ms of which 1 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 25 places in 331 ms of which 1 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 30 places in 408 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 0 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 24 places in 384 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 40 places in 390 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 39 places in 381 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 24 places in 356 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 31 places in 380 ms of which 2 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 26 places in 367 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 62 places in 261 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 42 places in 258 ms of which 1 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 43 places in 328 ms of which 2 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 54 places in 264 ms of which 1 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 1 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 43 places in 315 ms of which 1 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 0 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 54 places in 300 ms of which 1 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 49 places in 294 ms of which 0 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 1 ms to minimize.
[2023-03-18 19:19:38] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 0 ms to minimize.
[2023-03-18 19:19:38] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 1 ms to minimize.
[2023-03-18 19:19:38] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 2 ms to minimize.
[2023-03-18 19:19:39] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 0 ms to minimize.
[2023-03-18 19:19:39] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 1 ms to minimize.
[2023-03-18 19:19:39] [INFO ] Deduced a trap composed of 59 places in 267 ms of which 2 ms to minimize.
[2023-03-18 19:19:39] [INFO ] Deduced a trap composed of 61 places in 220 ms of which 0 ms to minimize.
[2023-03-18 19:19:40] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 0 ms to minimize.
[2023-03-18 19:19:40] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 1 ms to minimize.
[2023-03-18 19:19:40] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 2 ms to minimize.
[2023-03-18 19:19:40] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 0 ms to minimize.
[2023-03-18 19:19:41] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 1 ms to minimize.
[2023-03-18 19:19:41] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 1 ms to minimize.
[2023-03-18 19:19:41] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 0 ms to minimize.
[2023-03-18 19:19:41] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 23452 ms
[2023-03-18 19:19:41] [INFO ] After 24600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 19:19:41] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 173 ms.
Support contains 6 out of 1668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1668 transition count 1718
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1468 transition count 1718
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 400 place count 1468 transition count 1468
Deduced a syphon composed of 250 places in 4 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 900 place count 1218 transition count 1468
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 911 place count 1207 transition count 1457
Iterating global reduction 2 with 11 rules applied. Total rules applied 922 place count 1207 transition count 1457
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 922 place count 1207 transition count 1453
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 930 place count 1203 transition count 1453
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 1 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1920 place count 708 transition count 958
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 2022 place count 708 transition count 958
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2023 place count 707 transition count 957
Applied a total of 2023 rules in 497 ms. Remains 707 /1668 variables (removed 961) and now considering 957/1918 (removed 961) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 707/1668 places, 957/1918 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 957 rows 707 cols
[2023-03-18 19:19:42] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-18 19:19:42] [INFO ] [Real]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-18 19:19:42] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:19:42] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:19:43] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:19:43] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-18 19:19:43] [INFO ] After 642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 41 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 707/707 places, 957/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:19:43] [INFO ] Invariant cache hit.
[2023-03-18 19:19:43] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:19:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-18 19:19:44] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 318 ms
[2023-03-18 19:19:44] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-18 19:19:44] [INFO ] After 830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 957/957 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 705 transition count 955
Applied a total of 4 rules in 45 ms. Remains 705 /707 variables (removed 2) and now considering 955/957 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 705/707 places, 955/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 198896 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198896 steps, saw 66398 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 955 rows 705 cols
[2023-03-18 19:19:47] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-18 19:19:47] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:19:47] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-18 19:19:48] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 3 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 553 ms
[2023-03-18 19:19:48] [INFO ] After 846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-18 19:19:48] [INFO ] After 1018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 25 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 705/705 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 23 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2023-03-18 19:19:48] [INFO ] Invariant cache hit.
[2023-03-18 19:19:49] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-18 19:19:49] [INFO ] Invariant cache hit.
[2023-03-18 19:19:50] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2023-03-18 19:19:50] [INFO ] Redundant transitions in 147 ms returned []
[2023-03-18 19:19:50] [INFO ] Invariant cache hit.
[2023-03-18 19:19:50] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1763 ms. Remains : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 23 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 19:19:50] [INFO ] Invariant cache hit.
[2023-03-18 19:19:50] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:19:51] [INFO ] [Nat]Absence check using 201 positive place invariants in 27 ms returned sat
[2023-03-18 19:19:51] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-18 19:19:52] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2023-03-18 19:19:52] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2023-03-18 19:19:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 915 ms
[2023-03-18 19:19:52] [INFO ] After 1203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-18 19:19:52] [INFO ] After 1415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldRVs-PT-050B-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldRVs-PT-050B-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 406 stabilizing places and 406 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(!p0) U !(p0 U p1))))))'
Support contains 4 out of 1668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1654 transition count 1904
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1654 transition count 1904
Applied a total of 28 rules in 113 ms. Remains 1654 /1668 variables (removed 14) and now considering 1904/1918 (removed 14) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2023-03-18 19:19:52] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-18 19:19:53] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-18 19:19:53] [INFO ] Invariant cache hit.
[2023-03-18 19:19:55] [INFO ] Implicit Places using invariants and state equation in 1972 ms returned []
Implicit Place search using SMT with State Equation took 2465 ms to find 0 implicit places.
[2023-03-18 19:19:55] [INFO ] Invariant cache hit.
[2023-03-18 19:19:56] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1654/1668 places, 1904/1918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3563 ms. Remains : 1654/1668 places, 1904/1918 transitions.
Stuttering acceptance computed with spot in 406 ms :[true, (OR p1 p0), p1, p1, p1, p1, p1, p1]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p0:(OR (EQ s781 0) (EQ s577 1)), p1:(OR (EQ s1036 0) (EQ s989 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-00 finished in 4157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(((p1 U p2) U (p1&&F(p3)))))))'
Support contains 8 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1667 transition count 1719
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1469 transition count 1719
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 396 place count 1469 transition count 1470
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 894 place count 1220 transition count 1470
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 908 place count 1206 transition count 1456
Iterating global reduction 2 with 14 rules applied. Total rules applied 922 place count 1206 transition count 1456
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 922 place count 1206 transition count 1452
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 930 place count 1202 transition count 1452
Performed 492 Post agglomeration using F-continuation condition.Transition count delta: 492
Deduced a syphon composed of 492 places in 1 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 2 with 984 rules applied. Total rules applied 1914 place count 710 transition count 960
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1916 place count 708 transition count 958
Applied a total of 1916 rules in 302 ms. Remains 708 /1668 variables (removed 960) and now considering 958/1918 (removed 960) transitions.
// Phase 1: matrix 958 rows 708 cols
[2023-03-18 19:19:56] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-18 19:19:57] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-18 19:19:57] [INFO ] Invariant cache hit.
[2023-03-18 19:19:57] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
[2023-03-18 19:19:58] [INFO ] Redundant transitions in 111 ms returned [957]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 957 rows 708 cols
[2023-03-18 19:19:58] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-18 19:19:58] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 708/1668 places, 957/1918 transitions.
Applied a total of 0 rules in 22 ms. Remains 708 /708 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1732 ms. Remains : 708/1668 places, 957/1918 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s409 0) (EQ s656 1)), p1:(OR (EQ s312 0) (EQ s226 1)), p2:(OR (EQ s32 0) (EQ s680 1)), p3:(OR (EQ s179 0) (EQ s534 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 314 reset in 572 ms.
Product exploration explored 100000 steps with 289 reset in 730 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 11 factoid took 468 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:20:00] [INFO ] Invariant cache hit.
[2023-03-18 19:20:00] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:20:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 22 ms returned sat
[2023-03-18 19:20:01] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 680 ms
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-03-18 19:20:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-18 19:20:02] [INFO ] After 1087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-18 19:20:02] [INFO ] After 1251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 957/957 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 708 transition count 956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 707 transition count 956
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 706 transition count 955
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 105 place count 706 transition count 955
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 704 transition count 953
Applied a total of 107 rules in 78 ms. Remains 704 /708 variables (removed 4) and now considering 953/957 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 704/708 places, 953/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 238970 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238970 steps, saw 234367 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 953 rows 704 cols
[2023-03-18 19:20:05] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-18 19:20:05] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:20:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-18 19:20:06] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:20:06] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-18 19:20:06] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-18 19:20:06] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-18 19:20:06] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2023-03-18 19:20:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 388 ms
[2023-03-18 19:20:06] [INFO ] After 767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-18 19:20:06] [INFO ] After 1025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 17 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 704/704 places, 953/953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-18 19:20:06] [INFO ] Invariant cache hit.
[2023-03-18 19:20:06] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-18 19:20:06] [INFO ] Invariant cache hit.
[2023-03-18 19:20:07] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2023-03-18 19:20:07] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-18 19:20:07] [INFO ] Invariant cache hit.
[2023-03-18 19:20:08] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1593 ms. Remains : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 22 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 19:20:08] [INFO ] Invariant cache hit.
[2023-03-18 19:20:08] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:20:08] [INFO ] [Nat]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-18 19:20:08] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:20:08] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-18 19:20:08] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-18 19:20:08] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-18 19:20:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 209 ms
[2023-03-18 19:20:09] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-18 19:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-18 19:20:09] [INFO ] After 634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-18 19:20:09] [INFO ] After 816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p3)), (F (AND (NOT p3) p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 11 factoid took 723 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Support contains 6 out of 708 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 708/708 places, 957/957 transitions.
Applied a total of 0 rules in 20 ms. Remains 708 /708 variables (removed 0) and now considering 957/957 (removed 0) transitions.
// Phase 1: matrix 957 rows 708 cols
[2023-03-18 19:20:10] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-18 19:20:10] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-18 19:20:10] [INFO ] Invariant cache hit.
[2023-03-18 19:20:11] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
[2023-03-18 19:20:11] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-18 19:20:11] [INFO ] Invariant cache hit.
[2023-03-18 19:20:11] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1537 ms. Remains : 708/708 places, 957/957 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 p3), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 8 factoid took 357 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:20:12] [INFO ] Invariant cache hit.
[2023-03-18 19:20:12] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:20:12] [INFO ] [Nat]Absence check using 201 positive place invariants in 22 ms returned sat
[2023-03-18 19:20:12] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 788 ms
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-18 19:20:13] [INFO ] After 1208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-18 19:20:13] [INFO ] After 1380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 957/957 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 708 transition count 956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 707 transition count 956
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 706 transition count 955
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 105 place count 706 transition count 955
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 704 transition count 953
Applied a total of 107 rules in 77 ms. Remains 704 /708 variables (removed 4) and now considering 953/957 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 704/708 places, 953/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 282179 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 282179 steps, saw 276785 distinct states, run finished after 3002 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 953 rows 704 cols
[2023-03-18 19:20:17] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-18 19:20:17] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:20:17] [INFO ] [Nat]Absence check using 201 positive place invariants in 23 ms returned sat
[2023-03-18 19:20:17] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:20:17] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-18 19:20:17] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-18 19:20:18] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-18 19:20:18] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2023-03-18 19:20:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 366 ms
[2023-03-18 19:20:18] [INFO ] After 707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-18 19:20:18] [INFO ] After 940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 17 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 704/704 places, 953/953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-18 19:20:18] [INFO ] Invariant cache hit.
[2023-03-18 19:20:18] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-18 19:20:18] [INFO ] Invariant cache hit.
[2023-03-18 19:20:19] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
[2023-03-18 19:20:19] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-18 19:20:19] [INFO ] Invariant cache hit.
[2023-03-18 19:20:19] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1486 ms. Remains : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 28 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 19:20:19] [INFO ] Invariant cache hit.
[2023-03-18 19:20:19] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:20:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-18 19:20:20] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:20:20] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-18 19:20:20] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2023-03-18 19:20:20] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-18 19:20:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2023-03-18 19:20:20] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-18 19:20:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-18 19:20:20] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 19:20:20] [INFO ] After 816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p2 p3), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p3)), (F (AND (NOT p3) p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 424 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 296 reset in 527 ms.
Product exploration explored 100000 steps with 300 reset in 611 ms.
Built C files in :
/tmp/ltsmin4704348684790012627
[2023-03-18 19:20:22] [INFO ] Computing symmetric may disable matrix : 957 transitions.
[2023-03-18 19:20:22] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:22] [INFO ] Computing symmetric may enable matrix : 957 transitions.
[2023-03-18 19:20:22] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:23] [INFO ] Computing Do-Not-Accords matrix : 957 transitions.
[2023-03-18 19:20:23] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:23] [INFO ] Built C files in 263ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4704348684790012627
Running compilation step : cd /tmp/ltsmin4704348684790012627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2922 ms.
Running link step : cd /tmp/ltsmin4704348684790012627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin4704348684790012627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13872995907634353709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 708 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 708/708 places, 957/957 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 706 transition count 955
Applied a total of 1 rules in 33 ms. Remains 706 /708 variables (removed 2) and now considering 955/957 (removed 2) transitions.
// Phase 1: matrix 955 rows 706 cols
[2023-03-18 19:20:37] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-18 19:20:38] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-18 19:20:38] [INFO ] Invariant cache hit.
[2023-03-18 19:20:38] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-18 19:20:38] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-18 19:20:38] [INFO ] Invariant cache hit.
[2023-03-18 19:20:39] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 706/708 places, 955/957 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1440 ms. Remains : 706/708 places, 955/957 transitions.
Built C files in :
/tmp/ltsmin13456649416955047842
[2023-03-18 19:20:39] [INFO ] Computing symmetric may disable matrix : 955 transitions.
[2023-03-18 19:20:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:39] [INFO ] Computing symmetric may enable matrix : 955 transitions.
[2023-03-18 19:20:39] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:39] [INFO ] Computing Do-Not-Accords matrix : 955 transitions.
[2023-03-18 19:20:39] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:39] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13456649416955047842
Running compilation step : cd /tmp/ltsmin13456649416955047842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2300 ms.
Running link step : cd /tmp/ltsmin13456649416955047842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13456649416955047842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12219655120185260639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 19:20:54] [INFO ] Flatten gal took : 92 ms
[2023-03-18 19:20:54] [INFO ] Flatten gal took : 60 ms
[2023-03-18 19:20:54] [INFO ] Time to serialize gal into /tmp/LTL1184522742633703716.gal : 26 ms
[2023-03-18 19:20:54] [INFO ] Time to serialize properties into /tmp/LTL3065482383949861533.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1184522742633703716.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9951073525754935655.hoa' '-atoms' '/tmp/LTL3065482383949861533.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3065482383949861533.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9951073525754935655.hoa
Detected timeout of ITS tools.
[2023-03-18 19:21:09] [INFO ] Flatten gal took : 64 ms
[2023-03-18 19:21:09] [INFO ] Flatten gal took : 48 ms
[2023-03-18 19:21:09] [INFO ] Time to serialize gal into /tmp/LTL1245326685131488649.gal : 14 ms
[2023-03-18 19:21:09] [INFO ] Time to serialize properties into /tmp/LTL9490459604650719937.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1245326685131488649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9490459604650719937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("((p1178==0)||(p1861==1))"))&&(F(G((("((p912==0)||(p674==1))")U("((p139==0)||(p1921==1))"))U(("((p912==0)||(p674==1))")&&(F("((p...184
Formula 0 simplified : G!"((p1178==0)||(p1861==1))" | GF((!"((p912==0)||(p674==1))" R !"((p139==0)||(p1921==1))") R (!"((p912==0)||(p674==1))" | G!"((p545=...174
Detected timeout of ITS tools.
[2023-03-18 19:21:25] [INFO ] Flatten gal took : 70 ms
[2023-03-18 19:21:25] [INFO ] Applying decomposition
[2023-03-18 19:21:25] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3738040061473916185.txt' '-o' '/tmp/graph3738040061473916185.bin' '-w' '/tmp/graph3738040061473916185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3738040061473916185.bin' '-l' '-1' '-v' '-w' '/tmp/graph3738040061473916185.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:21:25] [INFO ] Decomposing Gal with order
[2023-03-18 19:21:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:21:25] [INFO ] Removed a total of 1054 redundant transitions.
[2023-03-18 19:21:25] [INFO ] Flatten gal took : 155 ms
[2023-03-18 19:21:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 986 labels/synchronizations in 34 ms.
[2023-03-18 19:21:25] [INFO ] Time to serialize gal into /tmp/LTL17979858850219158238.gal : 16 ms
[2023-03-18 19:21:25] [INFO ] Time to serialize properties into /tmp/LTL13018397164043329619.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17979858850219158238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13018397164043329619.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((F("((i9.i1.i0.u118.p1178==0)||(i15.i0.i0.u189.p1861==1))"))&&(F(G((("((i7.i1.i1.u90.p912==0)||(i5.u64.p674==1))")U("((i1.u9.p139==...290
Formula 0 simplified : G!"((i9.i1.i0.u118.p1178==0)||(i15.i0.i0.u189.p1861==1))" | GF((!"((i7.i1.i1.u90.p912==0)||(i5.u64.p674==1))" R !"((i1.u9.p139==0)||...280
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9622943138547613989
[2023-03-18 19:21:40] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9622943138547613989
Running compilation step : cd /tmp/ltsmin9622943138547613989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1615 ms.
Running link step : cd /tmp/ltsmin9622943138547613989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin9622943138547613989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&<>([]((((LTLAPp1==true) U (LTLAPp2==true)) U ((LTLAPp1==true)&&<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050B-LTLCardinality-04 finished in 119222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (G(((p1 U p2) U p3)) U X(p2))))'
Support contains 8 out of 1668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1655 transition count 1905
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1655 transition count 1905
Applied a total of 26 rules in 83 ms. Remains 1655 /1668 variables (removed 13) and now considering 1905/1918 (removed 13) transitions.
// Phase 1: matrix 1905 rows 1655 cols
[2023-03-18 19:21:56] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-18 19:21:56] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-18 19:21:56] [INFO ] Invariant cache hit.
[2023-03-18 19:21:58] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2070 ms to find 0 implicit places.
[2023-03-18 19:21:58] [INFO ] Invariant cache hit.
[2023-03-18 19:21:58] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1655/1668 places, 1905/1918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3015 ms. Remains : 1655/1668 places, 1905/1918 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(OR p3 p2 p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(NOT p2), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=9 dest: 8}, { cond=(OR p3 p2 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(OR (EQ s791 0) (EQ s1525 1)), p2:(OR (EQ s231 0) (EQ s596 1)), p1:(OR (EQ s1122 0) (EQ s1080 1)), p0:(OR (EQ s1225 0) (EQ s148 1))], 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 50000 reset in 1010 ms.
Product exploration explored 100000 steps with 50000 reset in 1296 ms.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Detected a total of 400/1655 stabilizing places and 400/1905 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p2 p1 p0), (X p2), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1))))), (X (X (OR p3 p2 p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 28 factoid took 312 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050B-LTLCardinality-05 finished in 6059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(!p1))))))'
Support contains 4 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1667 transition count 1717
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1467 transition count 1717
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 400 place count 1467 transition count 1469
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 896 place count 1219 transition count 1469
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 910 place count 1205 transition count 1455
Iterating global reduction 2 with 14 rules applied. Total rules applied 924 place count 1205 transition count 1455
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 924 place count 1205 transition count 1451
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 932 place count 1201 transition count 1451
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Deduced a syphon composed of 493 places in 1 ms
Reduce places removed 493 places and 0 transitions.
Iterating global reduction 2 with 986 rules applied. Total rules applied 1918 place count 708 transition count 958
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1920 place count 706 transition count 956
Applied a total of 1920 rules in 274 ms. Remains 706 /1668 variables (removed 962) and now considering 956/1918 (removed 962) transitions.
// Phase 1: matrix 956 rows 706 cols
[2023-03-18 19:22:02] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-18 19:22:02] [INFO ] Implicit Places using invariants in 674 ms returned []
[2023-03-18 19:22:02] [INFO ] Invariant cache hit.
[2023-03-18 19:22:03] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-03-18 19:22:03] [INFO ] Redundant transitions in 165 ms returned [955]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 955 rows 706 cols
[2023-03-18 19:22:03] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-18 19:22:04] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 706/1668 places, 955/1918 transitions.
Applied a total of 0 rules in 22 ms. Remains 706 /706 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2161 ms. Remains : 706/1668 places, 955/1918 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s600 0) (EQ s365 1)), p0:(OR (EQ s358 0) (EQ s355 1))], 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 1443 steps with 23 reset in 6 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-09 finished in 2260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1667 transition count 1716
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1466 transition count 1716
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1466 transition count 1466
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1216 transition count 1466
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 916 place count 1202 transition count 1452
Iterating global reduction 2 with 14 rules applied. Total rules applied 930 place count 1202 transition count 1452
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 930 place count 1202 transition count 1447
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 940 place count 1197 transition count 1447
Performed 492 Post agglomeration using F-continuation condition.Transition count delta: 492
Deduced a syphon composed of 492 places in 2 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 2 with 984 rules applied. Total rules applied 1924 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1926 place count 703 transition count 953
Applied a total of 1926 rules in 247 ms. Remains 703 /1668 variables (removed 965) and now considering 953/1918 (removed 965) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-18 19:22:04] [INFO ] Computed 201 place invariants in 1 ms
[2023-03-18 19:22:04] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-18 19:22:04] [INFO ] Invariant cache hit.
[2023-03-18 19:22:05] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2023-03-18 19:22:05] [INFO ] Redundant transitions in 221 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-18 19:22:05] [INFO ] Computed 201 place invariants in 1 ms
[2023-03-18 19:22:05] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1668 places, 952/1918 transitions.
Applied a total of 0 rules in 20 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1745 ms. Remains : 703/1668 places, 952/1918 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s417 0) (EQ s495 1) (EQ s323 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 654 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-14 finished in 1789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(((p1 U p2) U (p1&&F(p3)))))))'
[2023-03-18 19:22:06] [INFO ] Flatten gal took : 114 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14273668289866593593
[2023-03-18 19:22:06] [INFO ] Too many transitions (1918) to apply POR reductions. Disabling POR matrices.
[2023-03-18 19:22:06] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14273668289866593593
Running compilation step : cd /tmp/ltsmin14273668289866593593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 19:22:06] [INFO ] Applying decomposition
[2023-03-18 19:22:06] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15559101680180381021.txt' '-o' '/tmp/graph15559101680180381021.bin' '-w' '/tmp/graph15559101680180381021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15559101680180381021.bin' '-l' '-1' '-v' '-w' '/tmp/graph15559101680180381021.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:22:06] [INFO ] Decomposing Gal with order
[2023-03-18 19:22:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:22:06] [INFO ] Removed a total of 1791 redundant transitions.
[2023-03-18 19:22:07] [INFO ] Flatten gal took : 158 ms
[2023-03-18 19:22:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2023-03-18 19:22:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality17331447391814470073.gal : 39 ms
[2023-03-18 19:22:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality10583503789897766657.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17331447391814470073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10583503789897766657.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((F("((i12.u370.p1178==0)||(i19.i1.i0.u580.p1861==1))"))&&(F(G((("((i9.i1.i0.u288.p912==0)||(i6.i1.i5.u215.p674==1))")U("((i0.u51.p1...297
Formula 0 simplified : G!"((i12.u370.p1178==0)||(i19.i1.i0.u580.p1861==1))" | GF((!"((i9.i1.i0.u288.p912==0)||(i6.i1.i5.u215.p674==1))" R !"((i0.u51.p139==...287
Compilation finished in 3747 ms.
Running link step : cd /tmp/ltsmin14273668289866593593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin14273668289866593593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true))&&<>([]((((LTLAPp1==true) U (LTLAPp2==true)) U ((LTLAPp1==true)&&<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 19:43:06] [INFO ] Applying decomposition
[2023-03-18 19:43:06] [INFO ] Flatten gal took : 232 ms
[2023-03-18 19:43:06] [INFO ] Decomposing Gal with order
[2023-03-18 19:43:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:43:07] [INFO ] Removed a total of 1047 redundant transitions.
[2023-03-18 19:43:08] [INFO ] Flatten gal took : 229 ms
[2023-03-18 19:43:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1592 labels/synchronizations in 73 ms.
[2023-03-18 19:43:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality5781803912970192164.gal : 25 ms
[2023-03-18 19:43:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality5769450569869702969.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5781803912970192164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5769450569869702969.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u253.p1178==0)||(i0.i0.i0.i1.i0.i0.u377.p1861==1))"))&&(F(G...1013
Formula 0 simplified : G!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u253.p1178==0)||(i0.i0.i0.i1.i0.i0.u377.p1861==1))" | GF((!"(...1003
Detected timeout of ITS tools.
[2023-03-18 20:04:07] [INFO ] Flatten gal took : 223 ms
[2023-03-18 20:04:07] [INFO ] Input system was already deterministic with 1918 transitions.
[2023-03-18 20:04:07] [INFO ] Transformed 1668 places.
[2023-03-18 20:04:07] [INFO ] Transformed 1918 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 20:04:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality7242900791986363255.gal : 17 ms
[2023-03-18 20:04:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality5505130210457968241.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7242900791986363255.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5505130210457968241.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("((p1178==0)||(p1861==1))"))&&(F(G((("((p912==0)||(p674==1))")U("((p139==0)||(p1921==1))"))U(("((p912==0)||(p674==1))")&&(F("((p...184
Formula 0 simplified : G!"((p1178==0)||(p1861==1))" | GF((!"((p912==0)||(p674==1))" R !"((p139==0)||(p1921==1))") R (!"((p912==0)||(p674==1))" | G!"((p545=...174
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 7547172 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16034844 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-050B"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-050B, 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 r421-tajo-167905974900155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;