fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037989400010
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ASLink-PT-01a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2289.691 154886.00 242816.00 720.40 FFTFTTFFTTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989400010.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989400010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 125K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 201K May 5 16:51 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 ASLink-PT-01a-00
FORMULA_NAME ASLink-PT-01a-01
FORMULA_NAME ASLink-PT-01a-02
FORMULA_NAME ASLink-PT-01a-03
FORMULA_NAME ASLink-PT-01a-04
FORMULA_NAME ASLink-PT-01a-05
FORMULA_NAME ASLink-PT-01a-06
FORMULA_NAME ASLink-PT-01a-07
FORMULA_NAME ASLink-PT-01a-08
FORMULA_NAME ASLink-PT-01a-09
FORMULA_NAME ASLink-PT-01a-10
FORMULA_NAME ASLink-PT-01a-11
FORMULA_NAME ASLink-PT-01a-12
FORMULA_NAME ASLink-PT-01a-13
FORMULA_NAME ASLink-PT-01a-14
FORMULA_NAME ASLink-PT-01a-15

=== Now, execution of the tool begins

BK_START 1620391720040

Running Version 0
[2021-05-07 12:48:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-07 12:48:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 12:48:41] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-05-07 12:48:41] [INFO ] Transformed 431 places.
[2021-05-07 12:48:41] [INFO ] Transformed 735 transitions.
[2021-05-07 12:48:41] [INFO ] Found NUPN structural information;
[2021-05-07 12:48:41] [INFO ] Parsed PT model containing 431 places and 735 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-07 12:48:41] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Support contains 62 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 426 transition count 728
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 421 transition count 718
Ensure Unique test removed 1 places
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 420 transition count 718
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 420 transition count 716
Applied a total of 18 rules in 73 ms. Remains 420 /431 variables (removed 11) and now considering 716/728 (removed 12) transitions.
// Phase 1: matrix 716 rows 420 cols
[2021-05-07 12:48:42] [INFO ] Computed 74 place invariants in 48 ms
[2021-05-07 12:48:42] [INFO ] Implicit Places using invariants in 403 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 203, 215, 221, 222, 259, 262, 282, 283, 284, 301, 309, 317, 323, 329, 341, 349, 355, 361, 369]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 431 ms to find 27 implicit places.
// Phase 1: matrix 716 rows 393 cols
[2021-05-07 12:48:42] [INFO ] Computed 47 place invariants in 22 ms
[2021-05-07 12:48:42] [INFO ] Dead Transitions using invariants and state equation in 352 ms returned []
Starting structural reductions, iteration 1 : 393/431 places, 716/728 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 381 transition count 704
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 381 transition count 704
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 373 transition count 696
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 373 transition count 696
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 369 transition count 692
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 369 transition count 692
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 367 transition count 690
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 367 transition count 690
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 365 transition count 688
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 365 transition count 688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 364 transition count 687
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 364 transition count 687
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 363 transition count 686
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 363 transition count 686
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 362 transition count 685
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 362 transition count 685
Applied a total of 62 rules in 90 ms. Remains 362 /393 variables (removed 31) and now considering 685/716 (removed 31) transitions.
// Phase 1: matrix 685 rows 362 cols
[2021-05-07 12:48:42] [INFO ] Computed 47 place invariants in 12 ms
[2021-05-07 12:48:43] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 685 rows 362 cols
[2021-05-07 12:48:43] [INFO ] Computed 47 place invariants in 13 ms
[2021-05-07 12:48:43] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 362/431 places, 685/728 transitions.
[2021-05-07 12:48:44] [INFO ] Flatten gal took : 167 ms
FORMULA ASLink-PT-01a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 12:48:44] [INFO ] Flatten gal took : 51 ms
[2021-05-07 12:48:44] [INFO ] Input system was already deterministic with 685 transitions.
Incomplete random walk after 100000 steps, including 1907 resets, run finished after 440 ms. (steps per millisecond=227 ) properties (out of 32) seen :14
Running SMT prover for 18 properties.
// Phase 1: matrix 685 rows 362 cols
[2021-05-07 12:48:44] [INFO ] Computed 47 place invariants in 10 ms
[2021-05-07 12:48:44] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:48:44] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:44] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-07 12:48:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:48:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2021-05-07 12:48:45] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:48:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:47] [INFO ] [Nat]Absence check using state equation in 2423 ms returned unsat
[2021-05-07 12:48:47] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:48:47] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 8 ms returned sat
[2021-05-07 12:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:47] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-07 12:48:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:48:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:48:47] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 6 ms returned sat
[2021-05-07 12:48:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:48] [INFO ] [Nat]Absence check using state equation in 1232 ms returned unsat
[2021-05-07 12:48:49] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2021-05-07 12:48:49] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 10 ms returned sat
[2021-05-07 12:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:49] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2021-05-07 12:48:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:48:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:48:49] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 6 ms returned sat
[2021-05-07 12:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:55] [INFO ] [Nat]Absence check using state equation in 6109 ms returned unknown
[2021-05-07 12:48:55] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:48:55] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 6 ms returned sat
[2021-05-07 12:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:55] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-07 12:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:48:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:48:55] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:57] [INFO ] [Nat]Absence check using state equation in 2054 ms returned unsat
[2021-05-07 12:48:58] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:48:58] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:58] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-07 12:48:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:48:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2021-05-07 12:48:58] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 6 ms returned sat
[2021-05-07 12:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:04] [INFO ] [Nat]Absence check using state equation in 6096 ms returned unknown
[2021-05-07 12:49:04] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:04] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 21 ms returned sat
[2021-05-07 12:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:04] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-07 12:49:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2021-05-07 12:49:04] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:10] [INFO ] [Nat]Absence check using state equation in 6161 ms returned unknown
[2021-05-07 12:49:10] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2021-05-07 12:49:10] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:11] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-07 12:49:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 35 ms returned sat
[2021-05-07 12:49:11] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:11] [INFO ] [Nat]Absence check using state equation in 782 ms returned unsat
[2021-05-07 12:49:12] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-07 12:49:12] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:12] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-07 12:49:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:12] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:18] [INFO ] [Nat]Absence check using state equation in 6136 ms returned unknown
[2021-05-07 12:49:18] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:18] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:18] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-07 12:49:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:18] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 6 ms returned sat
[2021-05-07 12:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:19] [INFO ] [Nat]Absence check using state equation in 354 ms returned unsat
[2021-05-07 12:49:19] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:19] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 4 ms returned unsat
[2021-05-07 12:49:19] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:19] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 2 ms returned unsat
[2021-05-07 12:49:19] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:19] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:19] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-07 12:49:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:19] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:19] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-07 12:49:19] [INFO ] Computed and/alt/rep : 223/691/223 causal constraints (skipped 461 transitions) in 77 ms.
[2021-05-07 12:49:21] [INFO ] Added : 195 causal constraints over 40 iterations in 2219 ms. Result :sat
[2021-05-07 12:49:21] [INFO ] [Real]Absence check using 12 positive place invariants in 30 ms returned sat
[2021-05-07 12:49:21] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 8 ms returned sat
[2021-05-07 12:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:22] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2021-05-07 12:49:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned sat
[2021-05-07 12:49:22] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 14 ms returned sat
[2021-05-07 12:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:28] [INFO ] [Nat]Absence check using state equation in 6110 ms returned unknown
[2021-05-07 12:49:28] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:28] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:28] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-07 12:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:28] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:34] [INFO ] [Nat]Absence check using state equation in 6109 ms returned unknown
[2021-05-07 12:49:34] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2021-05-07 12:49:34] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 8 ms returned sat
[2021-05-07 12:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:35] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-07 12:49:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:35] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:35] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-07 12:49:35] [INFO ] Computed and/alt/rep : 223/691/223 causal constraints (skipped 461 transitions) in 82 ms.
[2021-05-07 12:49:37] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 4 ms to minimize.
[2021-05-07 12:49:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2021-05-07 12:49:37] [INFO ] Added : 185 causal constraints over 37 iterations in 2039 ms. Result :sat
[2021-05-07 12:49:37] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-07 12:49:37] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned unsat
[2021-05-07 12:49:37] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:37] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:37] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2021-05-07 12:49:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using state equation in 236 ms returned unsat
[2021-05-07 12:49:38] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:38] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-07 12:49:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 6 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:44] [INFO ] [Nat]Absence check using state equation in 6088 ms returned unknown
Successfully simplified 9 atomic propositions for a total of 15 simplifications.
[2021-05-07 12:49:44] [INFO ] Initial state test concluded for 1 properties.
FORMULA ASLink-PT-01a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(X(p1))&&p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 685
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 359 transition count 675
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 359 transition count 675
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 357 transition count 666
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 357 transition count 666
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 356 transition count 658
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 356 transition count 658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 355 transition count 650
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 355 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 354 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 354 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 353 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 353 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 352 transition count 626
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 352 transition count 626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 351 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 351 transition count 618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 350 transition count 610
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 350 transition count 610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 349 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 349 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 348 transition count 594
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 348 transition count 594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 347 transition count 586
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 347 transition count 586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 346 transition count 578
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 346 transition count 578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 345 transition count 570
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 345 transition count 570
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 344 transition count 562
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 344 transition count 562
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 343 transition count 554
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 343 transition count 554
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 342 transition count 546
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 342 transition count 546
Applied a total of 39 rules in 199 ms. Remains 342 /362 variables (removed 20) and now considering 546/685 (removed 139) transitions.
// Phase 1: matrix 546 rows 342 cols
[2021-05-07 12:49:44] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-07 12:49:45] [INFO ] Implicit Places using invariants in 414 ms returned [210, 228, 249]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 423 ms to find 3 implicit places.
// Phase 1: matrix 546 rows 339 cols
[2021-05-07 12:49:45] [INFO ] Computed 43 place invariants in 4 ms
[2021-05-07 12:49:45] [INFO ] Dead Transitions using invariants and state equation in 251 ms returned []
Starting structural reductions, iteration 1 : 339/362 places, 546/685 transitions.
Applied a total of 0 rules in 17 ms. Remains 339 /339 variables (removed 0) and now considering 546/546 (removed 0) transitions.
// Phase 1: matrix 546 rows 339 cols
[2021-05-07 12:49:45] [INFO ] Computed 43 place invariants in 4 ms
[2021-05-07 12:49:45] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
Finished structural reductions, in 2 iterations. Remains : 339/362 places, 546/685 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ASLink-PT-01a-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s281 1) (EQ s284 1)), p1:(AND (EQ s281 1) (EQ s284 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-01a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-00 finished in 1371 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 360 transition count 633
Reduce places removed 52 places and 0 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 1 with 53 rules applied. Total rules applied 105 place count 308 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 307 transition count 632
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 106 place count 307 transition count 599
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 184 place count 262 transition count 599
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 188 place count 260 transition count 597
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 190 place count 258 transition count 597
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 195 place count 253 transition count 584
Iterating global reduction 5 with 5 rules applied. Total rules applied 200 place count 253 transition count 584
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 6 rules applied. Total rules applied 206 place count 253 transition count 578
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 212 place count 247 transition count 578
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 214 place count 245 transition count 569
Iterating global reduction 7 with 2 rules applied. Total rules applied 216 place count 245 transition count 569
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 217 place count 244 transition count 561
Iterating global reduction 7 with 1 rules applied. Total rules applied 218 place count 244 transition count 561
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 219 place count 243 transition count 553
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 243 transition count 553
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 221 place count 242 transition count 545
Iterating global reduction 7 with 1 rules applied. Total rules applied 222 place count 242 transition count 545
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 223 place count 241 transition count 537
Iterating global reduction 7 with 1 rules applied. Total rules applied 224 place count 241 transition count 537
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 225 place count 240 transition count 529
Iterating global reduction 7 with 1 rules applied. Total rules applied 226 place count 240 transition count 529
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 227 place count 239 transition count 521
Iterating global reduction 7 with 1 rules applied. Total rules applied 228 place count 239 transition count 521
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 229 place count 238 transition count 513
Iterating global reduction 7 with 1 rules applied. Total rules applied 230 place count 238 transition count 513
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 231 place count 237 transition count 505
Iterating global reduction 7 with 1 rules applied. Total rules applied 232 place count 237 transition count 505
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 233 place count 236 transition count 497
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 236 transition count 497
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 235 place count 235 transition count 489
Iterating global reduction 7 with 1 rules applied. Total rules applied 236 place count 235 transition count 489
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 237 place count 234 transition count 481
Iterating global reduction 7 with 1 rules applied. Total rules applied 238 place count 234 transition count 481
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 239 place count 233 transition count 473
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 233 transition count 473
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 241 place count 232 transition count 465
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 232 transition count 465
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 243 place count 231 transition count 457
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 231 transition count 457
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 245 place count 230 transition count 449
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 230 transition count 449
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 300 place count 203 transition count 422
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 302 place count 203 transition count 422
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 303 place count 202 transition count 421
Iterating global reduction 7 with 1 rules applied. Total rules applied 304 place count 202 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 305 place count 202 transition count 420
Applied a total of 305 rules in 165 ms. Remains 202 /362 variables (removed 160) and now considering 420/685 (removed 265) transitions.
// Phase 1: matrix 420 rows 202 cols
[2021-05-07 12:49:46] [INFO ] Computed 31 place invariants in 4 ms
[2021-05-07 12:49:46] [INFO ] Implicit Places using invariants in 110 ms returned [71, 106, 118, 136, 157, 174, 182, 195]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 111 ms to find 8 implicit places.
[2021-05-07 12:49:46] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 420 rows 194 cols
[2021-05-07 12:49:46] [INFO ] Computed 23 place invariants in 13 ms
[2021-05-07 12:49:46] [INFO ] Dead Transitions using invariants and state equation in 178 ms returned []
Starting structural reductions, iteration 1 : 194/362 places, 420/685 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 194 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 193 transition count 419
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 193 transition count 411
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 185 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 184 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 184 transition count 410
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 184 transition count 409
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 183 transition count 409
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 173 transition count 399
Applied a total of 42 rules in 29 ms. Remains 173 /194 variables (removed 21) and now considering 399/420 (removed 21) transitions.
// Phase 1: matrix 399 rows 173 cols
[2021-05-07 12:49:46] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-07 12:49:46] [INFO ] Implicit Places using invariants in 153 ms returned [87, 93, 98, 160, 163, 166, 170]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 154 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 166/362 places, 399/685 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 166 transition count 395
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 162 transition count 395
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 13 place count 157 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 157 transition count 390
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 157 transition count 387
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 155 transition count 385
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 155 transition count 385
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 154 transition count 384
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 154 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 153 transition count 383
Applied a total of 29 rules in 24 ms. Remains 153 /166 variables (removed 13) and now considering 383/399 (removed 16) transitions.
// Phase 1: matrix 383 rows 153 cols
[2021-05-07 12:49:46] [INFO ] Computed 16 place invariants in 7 ms
[2021-05-07 12:49:46] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 383 rows 153 cols
[2021-05-07 12:49:46] [INFO ] Computed 16 place invariants in 7 ms
[2021-05-07 12:49:47] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 153/362 places, 383/685 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-01a-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s69 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 2 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-01 finished in 1092 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((G(p1)||p0))&&G(!p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 685
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 359 transition count 675
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 359 transition count 675
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 357 transition count 666
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 357 transition count 666
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 356 transition count 658
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 356 transition count 658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 355 transition count 650
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 355 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 354 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 354 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 353 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 353 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 352 transition count 626
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 352 transition count 626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 351 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 351 transition count 618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 350 transition count 610
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 350 transition count 610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 349 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 349 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 348 transition count 594
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 348 transition count 594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 347 transition count 586
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 347 transition count 586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 346 transition count 578
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 346 transition count 578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 345 transition count 570
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 345 transition count 570
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 344 transition count 562
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 344 transition count 562
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 343 transition count 554
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 343 transition count 554
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 342 transition count 546
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 342 transition count 546
Applied a total of 39 rules in 72 ms. Remains 342 /362 variables (removed 20) and now considering 546/685 (removed 139) transitions.
// Phase 1: matrix 546 rows 342 cols
[2021-05-07 12:49:47] [INFO ] Computed 46 place invariants in 6 ms
[2021-05-07 12:49:47] [INFO ] Implicit Places using invariants in 144 ms returned [210, 228, 249, 284]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 146 ms to find 4 implicit places.
// Phase 1: matrix 546 rows 338 cols
[2021-05-07 12:49:47] [INFO ] Computed 42 place invariants in 5 ms
[2021-05-07 12:49:47] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Starting structural reductions, iteration 1 : 338/362 places, 546/685 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 337 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 337 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 336 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 336 transition count 544
Applied a total of 4 rules in 13 ms. Remains 336 /338 variables (removed 2) and now considering 544/546 (removed 2) transitions.
// Phase 1: matrix 544 rows 336 cols
[2021-05-07 12:49:47] [INFO ] Computed 42 place invariants in 4 ms
[2021-05-07 12:49:47] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 544 rows 336 cols
[2021-05-07 12:49:47] [INFO ] Computed 42 place invariants in 3 ms
[2021-05-07 12:49:48] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 336/362 places, 544/685 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, true]
Running random walk in product with property : ASLink-PT-01a-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s72 1)), p0:(OR (AND (EQ s3 1) (EQ s65 1)) (AND (EQ s187 1) (EQ s188 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-06 finished in 1178 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p0&&X(p1))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 685
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 359 transition count 675
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 359 transition count 675
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 357 transition count 666
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 357 transition count 666
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 356 transition count 658
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 356 transition count 658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 355 transition count 650
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 355 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 354 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 354 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 353 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 353 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 352 transition count 626
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 352 transition count 626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 351 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 351 transition count 618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 350 transition count 610
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 350 transition count 610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 349 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 349 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 348 transition count 594
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 348 transition count 594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 347 transition count 586
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 347 transition count 586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 346 transition count 578
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 346 transition count 578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 345 transition count 570
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 345 transition count 570
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 344 transition count 562
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 344 transition count 562
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 343 transition count 554
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 343 transition count 554
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 342 transition count 546
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 342 transition count 546
Applied a total of 39 rules in 74 ms. Remains 342 /362 variables (removed 20) and now considering 546/685 (removed 139) transitions.
// Phase 1: matrix 546 rows 342 cols
[2021-05-07 12:49:48] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-07 12:49:48] [INFO ] Implicit Places using invariants in 142 ms returned [228, 284]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 143 ms to find 2 implicit places.
// Phase 1: matrix 546 rows 340 cols
[2021-05-07 12:49:48] [INFO ] Computed 44 place invariants in 4 ms
[2021-05-07 12:49:48] [INFO ] Dead Transitions using invariants and state equation in 243 ms returned []
Starting structural reductions, iteration 1 : 340/362 places, 546/685 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 339 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 339 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 338 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 338 transition count 544
Applied a total of 4 rules in 11 ms. Remains 338 /340 variables (removed 2) and now considering 544/546 (removed 2) transitions.
// Phase 1: matrix 544 rows 338 cols
[2021-05-07 12:49:48] [INFO ] Computed 44 place invariants in 4 ms
[2021-05-07 12:49:48] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 544 rows 338 cols
[2021-05-07 12:49:48] [INFO ] Computed 44 place invariants in 5 ms
[2021-05-07 12:49:49] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 338/362 places, 544/685 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-01a-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (NEQ s150 1) (NEQ s248 1) (NEQ s328 1)), p1:(AND (NEQ s127 0) (NEQ s130 0) (NEQ s133 0) (NEQ s210 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 2 reset in 2 ms.
FORMULA ASLink-PT-01a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-07 finished in 1125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1)&&X(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 685
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 359 transition count 675
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 359 transition count 675
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 357 transition count 666
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 357 transition count 666
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 356 transition count 658
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 356 transition count 658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 355 transition count 650
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 355 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 354 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 354 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 353 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 353 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 352 transition count 626
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 352 transition count 626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 351 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 351 transition count 618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 350 transition count 610
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 350 transition count 610
Applied a total of 23 rules in 47 ms. Remains 350 /362 variables (removed 12) and now considering 610/685 (removed 75) transitions.
// Phase 1: matrix 610 rows 350 cols
[2021-05-07 12:49:49] [INFO ] Computed 46 place invariants in 37 ms
[2021-05-07 12:49:49] [INFO ] Implicit Places using invariants in 212 ms returned [210, 236, 257, 292]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 219 ms to find 4 implicit places.
// Phase 1: matrix 610 rows 346 cols
[2021-05-07 12:49:49] [INFO ] Computed 42 place invariants in 4 ms
[2021-05-07 12:49:50] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Starting structural reductions, iteration 1 : 346/362 places, 610/685 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 345 transition count 609
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 345 transition count 609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 344 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 344 transition count 608
Applied a total of 4 rules in 12 ms. Remains 344 /346 variables (removed 2) and now considering 608/610 (removed 2) transitions.
// Phase 1: matrix 608 rows 344 cols
[2021-05-07 12:49:50] [INFO ] Computed 42 place invariants in 3 ms
[2021-05-07 12:49:50] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 608 rows 344 cols
[2021-05-07 12:49:50] [INFO ] Computed 42 place invariants in 4 ms
[2021-05-07 12:49:50] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 344/362 places, 608/685 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ASLink-PT-01a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s74 0)), p1:(OR (NEQ s197 1) (NEQ s241 1)), p2:(OR (NEQ s42 1) (NEQ s227 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 565 ms.
Product exploration explored 100000 steps with 33333 reset in 379 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 33333 reset in 308 ms.
Product exploration explored 100000 steps with 33333 reset in 345 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Support contains 6 out of 344 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 344/344 places, 608/608 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 344 transition count 608
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 27 Pre rules applied. Total rules applied 58 place count 344 transition count 655
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 85 place count 344 transition count 655
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 100 place count 329 transition count 640
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 115 place count 329 transition count 640
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 115 place count 329 transition count 640
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 329 transition count 640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 328 transition count 639
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 328 transition count 639
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 161 place count 328 transition count 645
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 177 place count 312 transition count 629
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 193 place count 312 transition count 629
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 312 transition count 633
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 195 place count 312 transition count 637
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 197 place count 310 transition count 631
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 199 place count 310 transition count 631
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 199 rules in 79 ms. Remains 310 /344 variables (removed 34) and now considering 631/608 (removed -23) transitions.
[2021-05-07 12:49:53] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 631 rows 310 cols
[2021-05-07 12:49:53] [INFO ] Computed 42 place invariants in 4 ms
[2021-05-07 12:49:53] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 1 iterations. Remains : 310/344 places, 631/608 transitions.
Product exploration explored 100000 steps with 33333 reset in 1267 ms.
Product exploration explored 100000 steps with 33333 reset in 1185 ms.
[2021-05-07 12:49:55] [INFO ] Flatten gal took : 36 ms
[2021-05-07 12:49:55] [INFO ] Flatten gal took : 35 ms
[2021-05-07 12:49:55] [INFO ] Time to serialize gal into /tmp/LTL1087222980932606323.gal : 13 ms
[2021-05-07 12:49:55] [INFO ] Time to serialize properties into /tmp/LTL10500082033346158847.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1087222980932606323.gal, -t, CGAL, -LTL, /tmp/LTL10500082033346158847.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1087222980932606323.gal -t CGAL -LTL /tmp/LTL10500082033346158847.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((F("((p212!=1)||(p273!=1))"))&&(X(F("((p50!=1)||(p256!=1))"))))&&("((p13==0)||(p84==0))"))))
Formula 0 simplified : !X("((p13==0)||(p84==0))" & F"((p212!=1)||(p273!=1))" & XF"((p50!=1)||(p256!=1))")
Detected timeout of ITS tools.
[2021-05-07 12:50:10] [INFO ] Flatten gal took : 72 ms
[2021-05-07 12:50:10] [INFO ] Applying decomposition
[2021-05-07 12:50:11] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph557658942196272489.txt, -o, /tmp/graph557658942196272489.bin, -w, /tmp/graph557658942196272489.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph557658942196272489.bin, -l, -1, -v, -w, /tmp/graph557658942196272489.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 12:50:11] [INFO ] Decomposing Gal with order
[2021-05-07 12:50:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 12:50:11] [INFO ] Removed a total of 974 redundant transitions.
[2021-05-07 12:50:11] [INFO ] Flatten gal took : 88 ms
[2021-05-07 12:50:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 16 ms.
[2021-05-07 12:50:11] [INFO ] Time to serialize gal into /tmp/LTL3922461708909461969.gal : 8 ms
[2021-05-07 12:50:11] [INFO ] Time to serialize properties into /tmp/LTL12831123491434707770.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3922461708909461969.gal, -t, CGAL, -LTL, /tmp/LTL12831123491434707770.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3922461708909461969.gal -t CGAL -LTL /tmp/LTL12831123491434707770.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((F("((i6.i1.u63.p212!=1)||(i6.i1.u79.p273!=1))"))&&(X(F("((i1.u16.p50!=1)||(i1.u76.p256!=1))"))))&&("((i2.u5.p13==0)||(i2.u23.p84==0))"))))
Formula 0 simplified : !X("((i2.u5.p13==0)||(i2.u23.p84==0))" & F"((i6.i1.u63.p212!=1)||(i6.i1.u79.p273!=1))" & XF"((i1.u16.p50!=1)||(i1.u76.p256!=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t10, t275, t276, t605, t655, i0.i2.t5, i1.t466, i1.t338, i3.t4, i3.i0.t0, i5.i0.u36.t64, i5.i1.u44.t54, i5.i2.u52.t44, i7.i1.t86, i7.i1.t93, i7.i1.t568, i7.i1.t569, i7.i1.t574, i7.i1.t576, i7.i1.t579, i7.i1.t596, i7.i1.u95.t89, i8.t12, i8.t9, i8.t8, i8.t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :280/270/29/579
Computing Next relation with stutter on 8534 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
165 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.69689,59808,1,0,80413,3333,7579,142818,628,22594,273864
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-01a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ASLink-PT-01a-09 finished in 23747 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 360 transition count 640
Reduce places removed 45 places and 0 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 1 with 46 rules applied. Total rules applied 91 place count 315 transition count 639
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 98 place count 314 transition count 633
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 104 place count 308 transition count 633
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 104 place count 308 transition count 600
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 182 place count 263 transition count 600
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 5 rules applied. Total rules applied 187 place count 261 transition count 597
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 190 place count 258 transition count 597
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 195 place count 253 transition count 584
Iterating global reduction 6 with 5 rules applied. Total rules applied 200 place count 253 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 7 rules applied. Total rules applied 207 place count 253 transition count 577
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 213 place count 247 transition count 577
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 215 place count 245 transition count 568
Iterating global reduction 8 with 2 rules applied. Total rules applied 217 place count 245 transition count 568
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 218 place count 244 transition count 560
Iterating global reduction 8 with 1 rules applied. Total rules applied 219 place count 244 transition count 560
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 220 place count 243 transition count 552
Iterating global reduction 8 with 1 rules applied. Total rules applied 221 place count 243 transition count 552
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 222 place count 242 transition count 544
Iterating global reduction 8 with 1 rules applied. Total rules applied 223 place count 242 transition count 544
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 224 place count 241 transition count 536
Iterating global reduction 8 with 1 rules applied. Total rules applied 225 place count 241 transition count 536
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 226 place count 240 transition count 528
Iterating global reduction 8 with 1 rules applied. Total rules applied 227 place count 240 transition count 528
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 228 place count 239 transition count 520
Iterating global reduction 8 with 1 rules applied. Total rules applied 229 place count 239 transition count 520
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 230 place count 238 transition count 512
Iterating global reduction 8 with 1 rules applied. Total rules applied 231 place count 238 transition count 512
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 232 place count 237 transition count 504
Iterating global reduction 8 with 1 rules applied. Total rules applied 233 place count 237 transition count 504
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 234 place count 236 transition count 496
Iterating global reduction 8 with 1 rules applied. Total rules applied 235 place count 236 transition count 496
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 236 place count 235 transition count 488
Iterating global reduction 8 with 1 rules applied. Total rules applied 237 place count 235 transition count 488
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 238 place count 234 transition count 480
Iterating global reduction 8 with 1 rules applied. Total rules applied 239 place count 234 transition count 480
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 240 place count 233 transition count 472
Iterating global reduction 8 with 1 rules applied. Total rules applied 241 place count 233 transition count 472
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 242 place count 232 transition count 464
Iterating global reduction 8 with 1 rules applied. Total rules applied 243 place count 232 transition count 464
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 244 place count 231 transition count 456
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 231 transition count 456
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 246 place count 230 transition count 448
Iterating global reduction 8 with 1 rules applied. Total rules applied 247 place count 230 transition count 448
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 303 place count 202 transition count 420
Applied a total of 303 rules in 124 ms. Remains 202 /362 variables (removed 160) and now considering 420/685 (removed 265) transitions.
// Phase 1: matrix 420 rows 202 cols
[2021-05-07 12:50:13] [INFO ] Computed 31 place invariants in 3 ms
[2021-05-07 12:50:13] [INFO ] Implicit Places using invariants in 198 ms returned [71, 106, 118, 136, 157, 174, 182, 195]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 199 ms to find 8 implicit places.
[2021-05-07 12:50:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 420 rows 194 cols
[2021-05-07 12:50:13] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-07 12:50:13] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Starting structural reductions, iteration 1 : 194/362 places, 420/685 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 194 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 193 transition count 419
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 193 transition count 411
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 185 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 184 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 184 transition count 410
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 184 transition count 409
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 183 transition count 409
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 173 transition count 399
Applied a total of 42 rules in 19 ms. Remains 173 /194 variables (removed 21) and now considering 399/420 (removed 21) transitions.
// Phase 1: matrix 399 rows 173 cols
[2021-05-07 12:50:13] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-07 12:50:13] [INFO ] Implicit Places using invariants in 103 ms returned [87, 93, 98, 160, 163, 166, 170]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 105 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 166/362 places, 399/685 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 166 transition count 395
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 162 transition count 395
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 13 place count 157 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 157 transition count 390
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 157 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 156 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 156 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 155 transition count 385
Applied a total of 25 rules in 18 ms. Remains 155 /166 variables (removed 11) and now considering 385/399 (removed 14) transitions.
// Phase 1: matrix 385 rows 155 cols
[2021-05-07 12:50:13] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-07 12:50:13] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 385 rows 155 cols
[2021-05-07 12:50:13] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-07 12:50:14] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 155/362 places, 385/685 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-01a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s80 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 21 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-10 finished in 995 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 360 transition count 633
Reduce places removed 52 places and 0 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 1 with 53 rules applied. Total rules applied 105 place count 308 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 307 transition count 632
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 106 place count 307 transition count 599
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 184 place count 262 transition count 599
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 189 place count 260 transition count 596
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 192 place count 257 transition count 596
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 197 place count 252 transition count 583
Iterating global reduction 5 with 5 rules applied. Total rules applied 202 place count 252 transition count 583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 7 rules applied. Total rules applied 209 place count 252 transition count 576
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 215 place count 246 transition count 576
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 217 place count 244 transition count 567
Iterating global reduction 7 with 2 rules applied. Total rules applied 219 place count 244 transition count 567
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 220 place count 243 transition count 559
Iterating global reduction 7 with 1 rules applied. Total rules applied 221 place count 243 transition count 559
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 222 place count 242 transition count 551
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 242 transition count 551
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 224 place count 241 transition count 543
Iterating global reduction 7 with 1 rules applied. Total rules applied 225 place count 241 transition count 543
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 226 place count 240 transition count 535
Iterating global reduction 7 with 1 rules applied. Total rules applied 227 place count 240 transition count 535
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 228 place count 239 transition count 527
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 239 transition count 527
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 230 place count 238 transition count 519
Iterating global reduction 7 with 1 rules applied. Total rules applied 231 place count 238 transition count 519
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 232 place count 237 transition count 511
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 237 transition count 511
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 234 place count 236 transition count 503
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 236 transition count 503
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 236 place count 235 transition count 495
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 235 transition count 495
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 293 place count 207 transition count 467
Applied a total of 293 rules in 69 ms. Remains 207 /362 variables (removed 155) and now considering 467/685 (removed 218) transitions.
// Phase 1: matrix 467 rows 207 cols
[2021-05-07 12:50:14] [INFO ] Computed 31 place invariants in 3 ms
[2021-05-07 12:50:14] [INFO ] Implicit Places using invariants in 128 ms returned [71, 105, 117, 141, 162, 179, 187, 200]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 130 ms to find 8 implicit places.
[2021-05-07 12:50:14] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 467 rows 199 cols
[2021-05-07 12:50:14] [INFO ] Computed 23 place invariants in 9 ms
[2021-05-07 12:50:14] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Starting structural reductions, iteration 1 : 199/362 places, 467/685 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 199 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 198 transition count 466
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 198 transition count 458
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 190 transition count 458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 189 transition count 457
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 189 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 189 transition count 456
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 22 place count 188 transition count 456
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 178 transition count 446
Applied a total of 42 rules in 17 ms. Remains 178 /199 variables (removed 21) and now considering 446/467 (removed 21) transitions.
// Phase 1: matrix 446 rows 178 cols
[2021-05-07 12:50:14] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-07 12:50:14] [INFO ] Implicit Places using invariants in 109 ms returned [86, 92, 97, 165, 168, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 111 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 171/362 places, 446/685 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 171 transition count 442
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 167 transition count 442
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 13 place count 162 transition count 437
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 162 transition count 437
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 162 transition count 434
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 160 transition count 432
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 160 transition count 432
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 159 transition count 431
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 159 transition count 431
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 158 transition count 430
Applied a total of 29 rules in 16 ms. Remains 158 /171 variables (removed 13) and now considering 430/446 (removed 16) transitions.
// Phase 1: matrix 430 rows 158 cols
[2021-05-07 12:50:14] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-07 12:50:14] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 430 rows 158 cols
[2021-05-07 12:50:14] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-07 12:50:15] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 158/362 places, 430/685 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-01a-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-11 finished in 906 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 685
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 359 transition count 675
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 359 transition count 675
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 357 transition count 666
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 357 transition count 666
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 356 transition count 658
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 356 transition count 658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 355 transition count 650
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 355 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 354 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 354 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 353 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 353 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 352 transition count 626
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 352 transition count 626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 351 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 351 transition count 618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 350 transition count 610
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 350 transition count 610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 349 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 349 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 348 transition count 594
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 348 transition count 594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 347 transition count 586
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 347 transition count 586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 346 transition count 578
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 346 transition count 578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 345 transition count 570
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 345 transition count 570
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 344 transition count 562
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 344 transition count 562
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 343 transition count 554
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 343 transition count 554
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 342 transition count 546
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 342 transition count 546
Applied a total of 39 rules in 82 ms. Remains 342 /362 variables (removed 20) and now considering 546/685 (removed 139) transitions.
// Phase 1: matrix 546 rows 342 cols
[2021-05-07 12:50:15] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-07 12:50:15] [INFO ] Implicit Places using invariants in 156 ms returned [210, 228, 249, 284]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 156 ms to find 4 implicit places.
// Phase 1: matrix 546 rows 338 cols
[2021-05-07 12:50:15] [INFO ] Computed 42 place invariants in 4 ms
[2021-05-07 12:50:15] [INFO ] Dead Transitions using invariants and state equation in 240 ms returned []
Starting structural reductions, iteration 1 : 338/362 places, 546/685 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 337 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 337 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 336 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 336 transition count 544
Applied a total of 4 rules in 17 ms. Remains 336 /338 variables (removed 2) and now considering 544/546 (removed 2) transitions.
// Phase 1: matrix 544 rows 336 cols
[2021-05-07 12:50:15] [INFO ] Computed 42 place invariants in 3 ms
[2021-05-07 12:50:15] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 544 rows 336 cols
[2021-05-07 12:50:15] [INFO ] Computed 42 place invariants in 3 ms
[2021-05-07 12:50:16] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 336/362 places, 544/685 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s186 1) (EQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-12 finished in 1216 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p1 U (p2||G(p1)))||p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 361 transition count 638
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 314 transition count 638
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 95 place count 314 transition count 608
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 167 place count 272 transition count 608
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 169 place count 271 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 270 transition count 607
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 174 place count 266 transition count 595
Iterating global reduction 4 with 4 rules applied. Total rules applied 178 place count 266 transition count 595
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 184 place count 266 transition count 589
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 190 place count 260 transition count 589
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 192 place count 258 transition count 580
Iterating global reduction 6 with 2 rules applied. Total rules applied 194 place count 258 transition count 580
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 195 place count 257 transition count 572
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 257 transition count 572
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 197 place count 256 transition count 564
Iterating global reduction 6 with 1 rules applied. Total rules applied 198 place count 256 transition count 564
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 199 place count 255 transition count 556
Iterating global reduction 6 with 1 rules applied. Total rules applied 200 place count 255 transition count 556
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 201 place count 254 transition count 548
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 254 transition count 548
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 203 place count 253 transition count 540
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 253 transition count 540
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 205 place count 252 transition count 532
Iterating global reduction 6 with 1 rules applied. Total rules applied 206 place count 252 transition count 532
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 207 place count 251 transition count 524
Iterating global reduction 6 with 1 rules applied. Total rules applied 208 place count 251 transition count 524
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 209 place count 250 transition count 516
Iterating global reduction 6 with 1 rules applied. Total rules applied 210 place count 250 transition count 516
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 211 place count 249 transition count 508
Iterating global reduction 6 with 1 rules applied. Total rules applied 212 place count 249 transition count 508
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 213 place count 248 transition count 500
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 248 transition count 500
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 215 place count 247 transition count 492
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 247 transition count 492
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 246 transition count 484
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 246 transition count 484
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 219 place count 245 transition count 476
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 245 transition count 476
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 221 place count 244 transition count 468
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 244 transition count 468
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 223 place count 243 transition count 460
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 243 transition count 460
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 276 place count 217 transition count 434
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 279 place count 217 transition count 434
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 216 transition count 433
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 216 transition count 433
Applied a total of 281 rules in 82 ms. Remains 216 /362 variables (removed 146) and now considering 433/685 (removed 252) transitions.
// Phase 1: matrix 433 rows 216 cols
[2021-05-07 12:50:16] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-07 12:50:16] [INFO ] Implicit Places using invariants in 132 ms returned [131, 132, 150, 171, 188, 196, 209]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 133 ms to find 7 implicit places.
[2021-05-07 12:50:16] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 433 rows 209 cols
[2021-05-07 12:50:16] [INFO ] Computed 26 place invariants in 3 ms
[2021-05-07 12:50:16] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Starting structural reductions, iteration 1 : 209/362 places, 433/685 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 209 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 208 transition count 432
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 2 place count 208 transition count 422
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 198 transition count 422
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 197 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 196 transition count 421
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 27 place count 194 transition count 419
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 194 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 29 place count 194 transition count 418
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 193 transition count 418
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 192 transition count 417
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 192 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 192 transition count 416
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 52 place count 183 transition count 407
Applied a total of 52 rules in 27 ms. Remains 183 /209 variables (removed 26) and now considering 407/433 (removed 26) transitions.
// Phase 1: matrix 407 rows 183 cols
[2021-05-07 12:50:16] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-07 12:50:16] [INFO ] Implicit Places using invariants in 130 ms returned [75, 95, 101, 106, 108, 170, 173, 176, 180]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 131 ms to find 9 implicit places.
Starting structural reductions, iteration 2 : 174/362 places, 407/685 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 403
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 170 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 169 transition count 402
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 14 place count 165 transition count 398
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 165 transition count 398
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 21 place count 165 transition count 395
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 22 place count 164 transition count 394
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 164 transition count 394
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 29 place count 161 transition count 391
Applied a total of 29 rules in 15 ms. Remains 161 /174 variables (removed 13) and now considering 391/407 (removed 16) transitions.
// Phase 1: matrix 391 rows 161 cols
[2021-05-07 12:50:16] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-07 12:50:17] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 391 rows 161 cols
[2021-05-07 12:50:17] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-07 12:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-07 12:50:17] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 161/362 places, 391/685 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : ASLink-PT-01a-13 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (OR (NEQ s17 1) (NEQ s73 1)) (NEQ s85 1)), p1:(NEQ s85 1), p0:(OR (EQ s101 0) (EQ s143 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2897 reset in 201 ms.
Product exploration explored 100000 steps with 2863 reset in 221 ms.
Knowledge obtained : [p2, p1, p0]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 2864 reset in 153 ms.
Product exploration explored 100000 steps with 2945 reset in 337 ms.
[2021-05-07 12:50:18] [INFO ] Flatten gal took : 42 ms
[2021-05-07 12:50:18] [INFO ] Flatten gal took : 29 ms
[2021-05-07 12:50:18] [INFO ] Time to serialize gal into /tmp/LTL10342986795936839565.gal : 8 ms
[2021-05-07 12:50:18] [INFO ] Time to serialize properties into /tmp/LTL5919934332750619028.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10342986795936839565.gal, -t, CGAL, -LTL, /tmp/LTL5919934332750619028.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10342986795936839565.gal -t CGAL -LTL /tmp/LTL5919934332750619028.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("((p212==0)||(p285==0))")||(("(p123!=1)")U(("(((p18!=1)||(p89!=1))&&(p123!=1))")||(G("(p123!=1)")))))))
Formula 0 simplified : !G("((p212==0)||(p285==0))" | ("(p123!=1)" U ("(((p18!=1)||(p89!=1))&&(p123!=1))" | G"(p123!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t538.t535.t536.t537.t7.t556, t557.t559.t17.t560.t11.t76.t74.t75.t10, t573.t88.t89.t574, t639, t649.t648, t596.t86, t564.t83.t86, t562.t80.t86, t66.t67.t71.t70.t69.t68.t669.t73.t0, t597.t92.t93.t598.t276, t597.t92.t93.t598.t277, t569.t81.t595, t576.t84.t570, t578.t87.t86, t65.t56.t57.t61.t60.t59.t58.t670.t1, t647.t54.t46.t47.t51.t50.t49.t48.t671.t55.t2, t625.t31.t46.t47.t51.t50.t49.t48.t671.t55.t2, t626.t29.t46.t47.t51.t50.t49.t48.t671.t55.t2, t227.t605.t602.t601.t95, t233.t605.t602.t601.t95, t239.t605.t602.t601.t95, t245.t605.t602.t601.t95, t251.t605.t602.t601.t95, t257.t605.t602.t601.t95, t263.t605.t602.t601.t95, t269.t605.t602.t601.t95, t597.t92.t93.t598.t275.t605.t602.t601.t95, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :224/140/27/391
Computing Next relation with stutter on 6570 deadlock states
Detected timeout of ITS tools.
[2021-05-07 12:50:33] [INFO ] Flatten gal took : 35 ms
[2021-05-07 12:50:33] [INFO ] Applying decomposition
[2021-05-07 12:50:33] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph49863094047798073.txt, -o, /tmp/graph49863094047798073.bin, -w, /tmp/graph49863094047798073.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph49863094047798073.bin, -l, -1, -v, -w, /tmp/graph49863094047798073.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 12:50:33] [INFO ] Decomposing Gal with order
[2021-05-07 12:50:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 12:50:33] [INFO ] Removed a total of 799 redundant transitions.
[2021-05-07 12:50:33] [INFO ] Flatten gal took : 29 ms
[2021-05-07 12:50:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 7 ms.
[2021-05-07 12:50:33] [INFO ] Time to serialize gal into /tmp/LTL506347202274724761.gal : 3 ms
[2021-05-07 12:50:33] [INFO ] Time to serialize properties into /tmp/LTL12938118132380450235.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL506347202274724761.gal, -t, CGAL, -LTL, /tmp/LTL12938118132380450235.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL506347202274724761.gal -t CGAL -LTL /tmp/LTL12938118132380450235.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("((i4.u30.p212==0)||(i4.u46.p285==0))")||(("(i3.u27.p123!=1)")U(("(((i2.u7.p18!=1)||(i2.u24.p89!=1))&&(i3.u27.p123!=1))")||(G("(i3.u27.p123!=1)")))))))
Formula 0 simplified : !G("((i4.u30.p212==0)||(i4.u46.p285==0))" | ("(i3.u27.p123!=1)" U ("(((i2.u7.p18!=1)||(i2.u24.p89!=1))&&(i3.u27.p123!=1))" | G"(i3.u27.p123!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t557_t559_t17_t560_t11_t76_t74_t75_t10, t573_t88_t89_t574, t586_t588, t597_t92_t93_t598_t277, t625_t31_t46_t47_t51_t50_t49_t48_t671_t55_t2, t626_t29_t46_t47_t51_t50_t49_t48_t671_t55_t2, t597_t92_t93_t598_t275_t605_t602_t601_t95, i3.t647_t54_t46_t47_t51_t50_t49_t48_t671_t55_t2, i3.t65_t56_t57_t61_t60_t59_t58_t670_t1, i3.t649_t648, i3.t639, i3.u25.t66.t67.t71.t70.t69.t68.t669.t73.t0, i4.t269_t605_t602_t601_t95, i4.t263_t605_t602_t601_t95, i4.t257_t605_t602_t601_t95, i4.t251_t605_t602_t601_t95, i4.t245_t605_t602_t601_t95, i4.t239_t605_t602_t601_t95, i4.t233_t605_t602_t601_t95, i4.t227_t605_t602_t601_t95, i5.u39.t596.t86, i5.u39.t564.t83.t86, i5.u39.t562.t80.t86, i5.u39.t569.t81.t595, i5.u39.t576.t84.t570, i5.u39.t578.t87.t86, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :224/125/26/375
Computing Next relation with stutter on 6570 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3277325522444162354
[2021-05-07 12:50:48] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3277325522444162354
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3277325522444162354]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3277325522444162354] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3277325522444162354] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-01a-13 finished in 33393 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 685
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 359 transition count 675
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 359 transition count 675
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 357 transition count 666
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 357 transition count 666
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 356 transition count 658
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 356 transition count 658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 355 transition count 650
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 355 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 354 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 354 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 353 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 353 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 352 transition count 626
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 352 transition count 626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 351 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 351 transition count 618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 350 transition count 610
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 350 transition count 610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 349 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 349 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 348 transition count 594
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 348 transition count 594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 347 transition count 586
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 347 transition count 586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 346 transition count 578
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 346 transition count 578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 345 transition count 570
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 345 transition count 570
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 344 transition count 562
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 344 transition count 562
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 343 transition count 554
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 343 transition count 554
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 342 transition count 546
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 342 transition count 546
Applied a total of 39 rules in 76 ms. Remains 342 /362 variables (removed 20) and now considering 546/685 (removed 139) transitions.
// Phase 1: matrix 546 rows 342 cols
[2021-05-07 12:50:49] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-07 12:50:50] [INFO ] Implicit Places using invariants in 234 ms returned [210, 228, 284]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 235 ms to find 3 implicit places.
// Phase 1: matrix 546 rows 339 cols
[2021-05-07 12:50:50] [INFO ] Computed 43 place invariants in 3 ms
[2021-05-07 12:50:50] [INFO ] Dead Transitions using invariants and state equation in 270 ms returned []
Starting structural reductions, iteration 1 : 339/362 places, 546/685 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 338 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 338 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 337 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 337 transition count 544
Applied a total of 4 rules in 12 ms. Remains 337 /339 variables (removed 2) and now considering 544/546 (removed 2) transitions.
// Phase 1: matrix 544 rows 337 cols
[2021-05-07 12:50:50] [INFO ] Computed 43 place invariants in 17 ms
[2021-05-07 12:50:50] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 544 rows 337 cols
[2021-05-07 12:50:50] [INFO ] Computed 43 place invariants in 3 ms
[2021-05-07 12:50:50] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 337/362 places, 544/685 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s247 1) (EQ s327 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-14 finished in 1309 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 685/685 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 360 transition count 633
Reduce places removed 52 places and 0 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 1 with 53 rules applied. Total rules applied 105 place count 308 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 307 transition count 632
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 106 place count 307 transition count 599
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 184 place count 262 transition count 599
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 189 place count 260 transition count 596
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 192 place count 257 transition count 596
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 197 place count 252 transition count 583
Iterating global reduction 5 with 5 rules applied. Total rules applied 202 place count 252 transition count 583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 7 rules applied. Total rules applied 209 place count 252 transition count 576
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 215 place count 246 transition count 576
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 217 place count 244 transition count 567
Iterating global reduction 7 with 2 rules applied. Total rules applied 219 place count 244 transition count 567
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 220 place count 243 transition count 559
Iterating global reduction 7 with 1 rules applied. Total rules applied 221 place count 243 transition count 559
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 222 place count 242 transition count 551
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 242 transition count 551
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 224 place count 241 transition count 543
Iterating global reduction 7 with 1 rules applied. Total rules applied 225 place count 241 transition count 543
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 226 place count 240 transition count 535
Iterating global reduction 7 with 1 rules applied. Total rules applied 227 place count 240 transition count 535
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 228 place count 239 transition count 527
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 239 transition count 527
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 230 place count 238 transition count 519
Iterating global reduction 7 with 1 rules applied. Total rules applied 231 place count 238 transition count 519
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 232 place count 237 transition count 511
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 237 transition count 511
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 234 place count 236 transition count 503
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 236 transition count 503
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 236 place count 235 transition count 495
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 235 transition count 495
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 238 place count 234 transition count 487
Iterating global reduction 7 with 1 rules applied. Total rules applied 239 place count 234 transition count 487
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 240 place count 233 transition count 479
Iterating global reduction 7 with 1 rules applied. Total rules applied 241 place count 233 transition count 479
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 242 place count 232 transition count 471
Iterating global reduction 7 with 1 rules applied. Total rules applied 243 place count 232 transition count 471
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 244 place count 231 transition count 463
Iterating global reduction 7 with 1 rules applied. Total rules applied 245 place count 231 transition count 463
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 246 place count 230 transition count 455
Iterating global reduction 7 with 1 rules applied. Total rules applied 247 place count 230 transition count 455
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 248 place count 229 transition count 447
Iterating global reduction 7 with 1 rules applied. Total rules applied 249 place count 229 transition count 447
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 305 place count 201 transition count 419
Applied a total of 305 rules in 64 ms. Remains 201 /362 variables (removed 161) and now considering 419/685 (removed 266) transitions.
// Phase 1: matrix 419 rows 201 cols
[2021-05-07 12:50:51] [INFO ] Computed 31 place invariants in 3 ms
[2021-05-07 12:50:51] [INFO ] Implicit Places using invariants in 216 ms returned [71, 105, 117, 135, 156, 173, 181, 194]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 217 ms to find 8 implicit places.
[2021-05-07 12:50:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 419 rows 193 cols
[2021-05-07 12:50:51] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-07 12:50:51] [INFO ] Dead Transitions using invariants and state equation in 178 ms returned []
Starting structural reductions, iteration 1 : 193/362 places, 419/685 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 193 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 192 transition count 418
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 192 transition count 410
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 184 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 183 transition count 409
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 183 transition count 409
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 183 transition count 408
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 182 transition count 408
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 172 transition count 398
Applied a total of 42 rules in 13 ms. Remains 172 /193 variables (removed 21) and now considering 398/419 (removed 21) transitions.
// Phase 1: matrix 398 rows 172 cols
[2021-05-07 12:50:51] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-07 12:50:51] [INFO ] Implicit Places using invariants in 108 ms returned [86, 92, 97, 159, 162, 165, 169]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 126 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 165/362 places, 398/685 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 165 transition count 394
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 161 transition count 394
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 13 place count 156 transition count 389
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 156 transition count 389
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 156 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 154 transition count 384
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 154 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 153 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 153 transition count 383
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 152 transition count 382
Applied a total of 29 rules in 14 ms. Remains 152 /165 variables (removed 13) and now considering 382/398 (removed 16) transitions.
// Phase 1: matrix 382 rows 152 cols
[2021-05-07 12:50:51] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-07 12:50:51] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 382 rows 152 cols
[2021-05-07 12:50:51] [INFO ] Computed 16 place invariants in 8 ms
[2021-05-07 12:50:52] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 152/362 places, 382/685 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-15 finished in 1105 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin849922558730807626
[2021-05-07 12:50:52] [INFO ] Computing symmetric may disable matrix : 685 transitions.
[2021-05-07 12:50:52] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 12:50:52] [INFO ] Computing symmetric may enable matrix : 685 transitions.
[2021-05-07 12:50:52] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 12:50:52] [INFO ] Applying decomposition
[2021-05-07 12:50:52] [INFO ] Flatten gal took : 40 ms
[2021-05-07 12:50:52] [INFO ] Computing Do-Not-Accords matrix : 685 transitions.
[2021-05-07 12:50:52] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 12:50:52] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin849922558730807626
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin849922558730807626]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6274489827834150691.txt, -o, /tmp/graph6274489827834150691.bin, -w, /tmp/graph6274489827834150691.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6274489827834150691.bin, -l, -1, -v, -w, /tmp/graph6274489827834150691.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 12:50:52] [INFO ] Decomposing Gal with order
[2021-05-07 12:50:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 12:50:52] [INFO ] Removed a total of 1180 redundant transitions.
[2021-05-07 12:50:52] [INFO ] Flatten gal took : 59 ms
[2021-05-07 12:50:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 18 ms.
[2021-05-07 12:50:52] [INFO ] Time to serialize gal into /tmp/LTLFireability6947200707007412277.gal : 5 ms
[2021-05-07 12:50:52] [INFO ] Time to serialize properties into /tmp/LTLFireability18307498054552757188.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability6947200707007412277.gal, -t, CGAL, -LTL, /tmp/LTLFireability18307498054552757188.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability6947200707007412277.gal -t CGAL -LTL /tmp/LTLFireability18307498054552757188.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("((i5.u65.p212==0)||(i5.u92.p285==0))")||(("(i3.i1.u38.p123!=1)")U(("((!((i1.u6.p18==1)&&(i1.u26.p89==1)))&&(i3.i1.u38.p123!=1))")||(G("(i3.i1.u38.p123!=1)")))))))
Formula 0 simplified : !G("((i5.u65.p212==0)||(i5.u92.p285==0))" | ("(i3.i1.u38.p123!=1)" U ("((!((i1.u6.p18==1)&&(i1.u26.p89==1)))&&(i3.i1.u38.p123!=1))" | G"(i3.i1.u38.p123!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t17, t298, t647, t702, i3.i1.u38.t79, i3.i2.u47.t69, i3.i3.u55.t59, i4.t4, i4.i1.t0, i6.i1.t5, i7.t616, i7.t614, i7.t612, i7.t609, i7.t608, i7.t601, i7.t108, i7.u99.t115, i7.u99.t640, i7.u100.t111, i9.t19, i9.t16, i9.t15, i9.t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :341/291/27/659
Computing Next relation with stutter on 8534 deadlock states
Compilation finished in 4032 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin849922558730807626]
Link finished in 56 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin849922558730807626]
LTSmin run took 17204 ms.
FORMULA ASLink-PT-01a-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620391874926

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ASLink-PT-01a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-01a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989400010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;