About the Execution of ITS-Tools for FMS-PT-20000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15468.783 | 3600000.00 | 4200081.00 | 37299.70 | FFTFF?FFTTTTFFFF | 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.r083-tall-162048875900828.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 FMS-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875900828
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-20000-00
FORMULA_NAME FMS-PT-20000-01
FORMULA_NAME FMS-PT-20000-02
FORMULA_NAME FMS-PT-20000-03
FORMULA_NAME FMS-PT-20000-04
FORMULA_NAME FMS-PT-20000-05
FORMULA_NAME FMS-PT-20000-06
FORMULA_NAME FMS-PT-20000-07
FORMULA_NAME FMS-PT-20000-08
FORMULA_NAME FMS-PT-20000-09
FORMULA_NAME FMS-PT-20000-10
FORMULA_NAME FMS-PT-20000-11
FORMULA_NAME FMS-PT-20000-12
FORMULA_NAME FMS-PT-20000-13
FORMULA_NAME FMS-PT-20000-14
FORMULA_NAME FMS-PT-20000-15
=== Now, execution of the tool begins
BK_START 1620672950204
Running Version 0
[2021-05-10 18:55:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 18:55:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 18:55:51] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-10 18:55:51] [INFO ] Transformed 22 places.
[2021-05-10 18:55:51] [INFO ] Transformed 20 transitions.
[2021-05-10 18:55:51] [INFO ] Parsed PT model containing 22 places and 20 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 18:55:51] [INFO ] Initial state test concluded for 4 properties.
FORMULA FMS-PT-20000-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 9 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:52] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-10 18:55:52] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:52] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 18:55:52] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:52] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-10 18:55:52] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 18:55:52] [INFO ] Flatten gal took : 18 ms
FORMULA FMS-PT-20000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 18:55:52] [INFO ] Flatten gal took : 4 ms
[2021-05-10 18:55:52] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 100007 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=2174 ) properties (out of 20) seen :2
Running SMT prover for 18 properties.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:52] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 18:55:52] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-10 18:55:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-10 18:55:52] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:55:52] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-10 18:55:52] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:55:52] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 18:55:52] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 18:55:52] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:55:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 18:55:52] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:55:52] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:55:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 18:55:52] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-10 18:55:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:55:52] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-10 18:55:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:55:52] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:55:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:55:52] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-10 18:55:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:55:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:55:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:53] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:55:53] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:55:53] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
[2021-05-10 18:55:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:55:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:55:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:53] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:55:53] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:55:53] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
[2021-05-10 18:55:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:55:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:55:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:55:53] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-10 18:55:53] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:55:53] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-10 18:55:53] [INFO ] Initial state test concluded for 1 properties.
FORMULA FMS-PT-20000-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 12 edges and 14 vertex of which 9 / 14 are part of one of the 3 SCC in 3 ms
Free SCC test removed 6 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 1 with 11 rules applied. Total rules applied 16 place count 8 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 26 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 4 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 4 transition count 4
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 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 2 transition count 3
Applied a total of 32 rules in 11 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 18:55:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 18:55:53] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 18:55:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 18:55:53] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-10 18:55:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 18:55:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 18:55:53] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-20000-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s0)], 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 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-20000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-00 finished in 219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:55:53] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:53] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 18:55:53] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:55:53] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-20000-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s5 s7)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 2 ms.
FORMULA FMS-PT-20000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-03 finished in 140 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(p1)||(p2 U ((p2&&G(p3))||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:53] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:55:53] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:55:53] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:55:53] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 18:55:53] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p3), (NOT p2), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : FMS-PT-20000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}, { cond=(AND p3 p2), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GT s4 s14), p2:(LEQ s15 s2), p3:(GT s6 s17), p1:(AND (LEQ s4 s14) (LEQ s6 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 297 ms.
Product exploration explored 100000 steps with 0 reset in 325 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p3), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p3), (NOT p2), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p3), (NOT p2), (AND (NOT p3) (NOT p2))]
Support contains 6 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 22 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 22 transition count 23
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 22 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 8 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 21/20 (removed -1) transitions.
[2021-05-10 18:55:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 22 cols
[2021-05-10 18:55:55] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 18:55:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 21/20 transitions.
Product exploration explored 100000 steps with 0 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 182 ms.
[2021-05-10 18:55:55] [INFO ] Flatten gal took : 3 ms
[2021-05-10 18:55:55] [INFO ] Flatten gal took : 3 ms
[2021-05-10 18:55:55] [INFO ] Time to serialize gal into /tmp/LTL996088345206741914.gal : 1 ms
[2021-05-10 18:55:55] [INFO ] Time to serialize properties into /tmp/LTL11324551248156243541.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/LTL996088345206741914.gal, -t, CGAL, -LTL, /tmp/LTL11324551248156243541.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/LTL996088345206741914.gal -t CGAL -LTL /tmp/LTL11324551248156243541.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((("(P1>P12s)")||(X("((P1<=P12s)&&(P1M1<=P3M2))")))||(("(M3<=P1wP2)")U((("(M3<=P1wP2)")&&(G("(P1M1>P3M2)")))||(G("(M3<=P1wP2)")))))))
Formula 0 simplified : !G("(P1>P12s)" | X"((P1<=P12s)&&(P1M1<=P3M2))" | ("(M3<=P1wP2)" U (("(M3<=P1wP2)" & G"(P1M1>P3M2)") | G"(M3<=P1wP2)")))
Detected timeout of ITS tools.
[2021-05-10 18:56:10] [INFO ] Flatten gal took : 2 ms
[2021-05-10 18:56:10] [INFO ] Applying decomposition
[2021-05-10 18:56:10] [INFO ] Flatten gal took : 5 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/graph17913685099552358666.txt, -o, /tmp/graph17913685099552358666.bin, -w, /tmp/graph17913685099552358666.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/graph17913685099552358666.bin, -l, -1, -v, -w, /tmp/graph17913685099552358666.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 18:56:10] [INFO ] Decomposing Gal with order
[2021-05-10 18:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 18:56:10] [INFO ] Flatten gal took : 73 ms
[2021-05-10 18:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 18:56:10] [INFO ] Time to serialize gal into /tmp/LTL11653076062434034121.gal : 1 ms
[2021-05-10 18:56:10] [INFO ] Time to serialize properties into /tmp/LTL9758317917729039542.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/LTL11653076062434034121.gal, -t, CGAL, -LTL, /tmp/LTL9758317917729039542.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/LTL11653076062434034121.gal -t CGAL -LTL /tmp/LTL9758317917729039542.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((("(gu3.P1>gu3.P12s)")||(X("((gu3.P1<=gu3.P12s)&&(gu6.P1M1<=gu6.P3M2))")))||(("(gu1.M3<=gu1.P1wP2)")U((("(gu1.M3<=gu1.P1wP2)")&&(G("(gu6.P1M1>gu6.P3M2)")))||(G("(gu1.M3<=gu1.P1wP2)")))))))
Formula 0 simplified : !G("(gu3.P1>gu3.P12s)" | X"((gu3.P1<=gu3.P12s)&&(gu6.P1M1<=gu6.P3M2))" | ("(gu1.M3<=gu1.P1wP2)" U (("(gu1.M3<=gu1.P1wP2)" & G"(gu6.P1M1>gu6.P3M2)") | G"(gu1.M3<=gu1.P1wP2)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17654855486454995728
[2021-05-10 18:56:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17654855486454995728
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/ltsmin17654855486454995728]
Compilation finished in 192 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17654855486454995728]
Link finished in 37 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, --when, --ltl, [](((LTLAPp0==true)||X((LTLAPp1==true))||((LTLAPp2==true) U (((LTLAPp2==true)&&[]((LTLAPp3==true)))||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17654855486454995728]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FMS-PT-20000-05 finished in 47498 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 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 1 with 10 rules applied. Total rules applied 15 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 23 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 6 transition count 8
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 4 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 2 transition count 4
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
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 2 transition count 3
Applied a total of 34 rules in 4 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 18:56:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 18:56:41] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 18:56:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 18:56:41] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-10 18:56:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 18:56:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 18:56:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : FMS-PT-20000-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 154 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
[2021-05-10 18:56:41] [INFO ] Flatten gal took : 1 ms
[2021-05-10 18:56:41] [INFO ] Flatten gal took : 0 ms
[2021-05-10 18:56:41] [INFO ] Time to serialize gal into /tmp/LTL643979297337758250.gal : 0 ms
[2021-05-10 18:56:41] [INFO ] Time to serialize properties into /tmp/LTL12714707631660213705.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/LTL643979297337758250.gal, -t, CGAL, -LTL, /tmp/LTL12714707631660213705.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/LTL643979297337758250.gal -t CGAL -LTL /tmp/LTL12714707631660213705.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(P1>=1)")))
Formula 0 simplified : !G"(P1>=1)"
Detected timeout of ITS tools.
[2021-05-10 18:56:56] [INFO ] Flatten gal took : 0 ms
[2021-05-10 18:56:56] [INFO ] Applying decomposition
[2021-05-10 18:56:56] [INFO ] Flatten gal took : 0 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/graph11645468759300770966.txt, -o, /tmp/graph11645468759300770966.bin, -w, /tmp/graph11645468759300770966.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/graph11645468759300770966.bin, -l, -1, -v, -w, /tmp/graph11645468759300770966.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 18:56:56] [INFO ] Decomposing Gal with order
[2021-05-10 18:56:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 18:56:56] [INFO ] Flatten gal took : 1 ms
[2021-05-10 18:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 18:56:56] [INFO ] Time to serialize gal into /tmp/LTL1163985641627438538.gal : 0 ms
[2021-05-10 18:56:56] [INFO ] Time to serialize properties into /tmp/LTL10088642912963075404.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/LTL1163985641627438538.gal, -t, CGAL, -LTL, /tmp/LTL10088642912963075404.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/LTL1163985641627438538.gal -t CGAL -LTL /tmp/LTL10088642912963075404.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("(u0.P1>=1)")))
Formula 0 simplified : !G"(u0.P1>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2633356513668623705
[2021-05-10 18:57:11] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2633356513668623705
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/ltsmin2633356513668623705]
Compilation finished in 77 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2633356513668623705]
Link finished in 32 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, --when, --ltl, []((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin2633356513668623705]
LTSmin run took 1324 ms.
FORMULA FMS-PT-20000-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-20000-06 finished in 32065 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F((p0 U (p1||G(p0))))&&X((p0&&X((p0 U (p2||G(p0))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:57:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:57:13] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:57:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:57:13] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:57:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:57:13] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FMS-PT-20000-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GT s9 s4) (GT 1 s5)), p0:(GT s9 s4), p2:(GT s8 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stack based approach found an accepted trace after 387 steps with 0 reset with depth 388 and stack size 388 in 1 ms.
FORMULA FMS-PT-20000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-07 finished in 427 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 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:57:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:57:13] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:57:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:57:13] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:57:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:57:13] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-20000-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s5 s20)], 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]]
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 22 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 21 transition count 19
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 21 transition count 24
Deduced a syphon composed of 10 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 21 transition count 22
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 15 rules in 5 ms. Remains 21 /22 variables (removed 1) and now considering 22/20 (removed -2) transitions.
[2021-05-10 18:57:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2021-05-10 18:57:14] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:57:14] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 22/20 transitions.
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
[2021-05-10 18:57:14] [INFO ] Flatten gal took : 2 ms
[2021-05-10 18:57:14] [INFO ] Flatten gal took : 1 ms
[2021-05-10 18:57:14] [INFO ] Time to serialize gal into /tmp/LTL2252523659828983005.gal : 5 ms
[2021-05-10 18:57:14] [INFO ] Time to serialize properties into /tmp/LTL15489567769485627076.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/LTL2252523659828983005.gal, -t, CGAL, -LTL, /tmp/LTL15489567769485627076.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/LTL2252523659828983005.gal -t CGAL -LTL /tmp/LTL15489567769485627076.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(P1wM1<=P3)"))))
Formula 0 simplified : !XF"(P1wM1<=P3)"
Detected timeout of ITS tools.
[2021-05-10 18:57:29] [INFO ] Flatten gal took : 2 ms
[2021-05-10 18:57:29] [INFO ] Applying decomposition
[2021-05-10 18:57:30] [INFO ] Flatten gal took : 2 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/graph14400118878835529009.txt, -o, /tmp/graph14400118878835529009.bin, -w, /tmp/graph14400118878835529009.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/graph14400118878835529009.bin, -l, -1, -v, -w, /tmp/graph14400118878835529009.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 18:57:30] [INFO ] Decomposing Gal with order
[2021-05-10 18:57:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 18:57:30] [INFO ] Flatten gal took : 2 ms
[2021-05-10 18:57:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 18:57:30] [INFO ] Time to serialize gal into /tmp/LTL12532142898582249058.gal : 1 ms
[2021-05-10 18:57:30] [INFO ] Time to serialize properties into /tmp/LTL6787681977758573817.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/LTL12532142898582249058.gal, -t, CGAL, -LTL, /tmp/LTL6787681977758573817.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/LTL12532142898582249058.gal -t CGAL -LTL /tmp/LTL6787681977758573817.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu3.P1wM1<=gu3.P3)"))))
Formula 0 simplified : !XF"(gu3.P1wM1<=gu3.P3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11189326232628474923
[2021-05-10 18:57:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11189326232628474923
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/ltsmin11189326232628474923]
Compilation finished in 131 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11189326232628474923]
Link finished in 32 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, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11189326232628474923]
LTSmin run took 191 ms.
FORMULA FMS-PT-20000-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-20000-08 finished in 31923 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:57:45] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:57:45] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:57:45] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:57:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:57:45] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:57:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-20000-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s17), p0:(LEQ s5 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 22 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 21 transition count 19
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 21 transition count 24
Deduced a syphon composed of 10 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 21 transition count 22
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 15 rules in 6 ms. Remains 21 /22 variables (removed 1) and now considering 22/20 (removed -2) transitions.
[2021-05-10 18:57:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2021-05-10 18:57:46] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:57:46] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 22/20 transitions.
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
[2021-05-10 18:57:46] [INFO ] Flatten gal took : 1 ms
[2021-05-10 18:57:46] [INFO ] Flatten gal took : 1 ms
[2021-05-10 18:57:46] [INFO ] Time to serialize gal into /tmp/LTL2272000726093156277.gal : 1 ms
[2021-05-10 18:57:46] [INFO ] Time to serialize properties into /tmp/LTL10247903803954245764.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/LTL2272000726093156277.gal, -t, CGAL, -LTL, /tmp/LTL10247903803954245764.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/LTL2272000726093156277.gal -t CGAL -LTL /tmp/LTL10247903803954245764.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(P1wM1<=P3)"))&&(F("(P3M2<3)")))))
Formula 0 simplified : !X(F"(P1wM1<=P3)" & F"(P3M2<3)")
Detected timeout of ITS tools.
[2021-05-10 18:58:01] [INFO ] Flatten gal took : 1 ms
[2021-05-10 18:58:01] [INFO ] Applying decomposition
[2021-05-10 18:58:01] [INFO ] Flatten gal took : 1 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/graph1973377250055952179.txt, -o, /tmp/graph1973377250055952179.bin, -w, /tmp/graph1973377250055952179.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/graph1973377250055952179.bin, -l, -1, -v, -w, /tmp/graph1973377250055952179.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 18:58:01] [INFO ] Decomposing Gal with order
[2021-05-10 18:58:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 18:58:01] [INFO ] Flatten gal took : 3 ms
[2021-05-10 18:58:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 18:58:01] [INFO ] Time to serialize gal into /tmp/LTL17931085281316376317.gal : 1 ms
[2021-05-10 18:58:01] [INFO ] Time to serialize properties into /tmp/LTL17683689981243764003.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/LTL17931085281316376317.gal, -t, CGAL, -LTL, /tmp/LTL17683689981243764003.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/LTL17931085281316376317.gal -t CGAL -LTL /tmp/LTL17683689981243764003.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(gu9.P1wM1<=gu9.P3)"))&&(F("(gi0.gi1.gu7.P3M2<3)")))))
Formula 0 simplified : !X(F"(gu9.P1wM1<=gu9.P3)" & F"(gi0.gi1.gu7.P3M2<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9844720386541071173
[2021-05-10 18:58:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9844720386541071173
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/ltsmin9844720386541071173]
Compilation finished in 126 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9844720386541071173]
Link finished in 31 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, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9844720386541071173]
LTSmin run took 213 ms.
FORMULA FMS-PT-20000-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-20000-10 finished in 31713 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:58:17] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 18:58:17] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:58:17] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:58:17] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:58:17] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:58:17] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FMS-PT-20000-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s13 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Stack based approach found an accepted trace after 1608 steps with 0 reset with depth 1609 and stack size 1605 in 3 ms.
FORMULA FMS-PT-20000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-13 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 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 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test 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 1 with 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 20 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 9 transition count 10
Applied a total of 23 rules in 2 ms. Remains 9 /22 variables (removed 13) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 18:58:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 18:58:17] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 18:58:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 18:58:17] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-10 18:58:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 18:58:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 18:58:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-20000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s5), p1:(LEQ s1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA FMS-PT-20000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-14 finished in 116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 13 place count 15 transition count 11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 19 place count 12 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 24 place count 9 transition count 9
Applied a total of 24 rules in 2 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 18:58:17] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 18:58:17] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 18:58:17] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 18:58:17] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-10 18:58:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 18:58:17] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 18:58:17] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-20000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s4), p1:(LEQ s0 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA FMS-PT-20000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-15 finished in 146 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-10 18:58:17] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin15147322272745224892
[2021-05-10 18:58:17] [INFO ] Flatten gal took : 2 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/graph8116878318679706819.txt, -o, /tmp/graph8116878318679706819.bin, -w, /tmp/graph8116878318679706819.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/graph8116878318679706819.bin, -l, -1, -v, -w, /tmp/graph8116878318679706819.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 18:58:17] [INFO ] Decomposing Gal with order
[2021-05-10 18:58:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 18:58:17] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2021-05-10 18:58:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 18:58:17] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2021-05-10 18:58:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 18:58:17] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2021-05-10 18:58:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 18:58:17] [INFO ] Flatten gal took : 2 ms
[2021-05-10 18:58:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15147322272745224892
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/ltsmin15147322272745224892]
[2021-05-10 18:58:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 18:58:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality8671592699426579243.gal : 0 ms
[2021-05-10 18:58:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality11077380690444164953.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/LTLCardinality8671592699426579243.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11077380690444164953.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/LTLCardinality8671592699426579243.gal -t CGAL -LTL /tmp/LTLCardinality11077380690444164953.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((("(gu2.P1>gu2.P12s)")||(X("((gu2.P1<=gu2.P12s)&&(gu7.P1M1<=gu7.P3M2))")))||(("(gu5.M3<=gu5.P1wP2)")U((("(gu5.M3<=gu5.P1wP2)")&&(G("(gu7.P1M1>gu7.P3M2)")))||(G("(gu5.M3<=gu5.P1wP2)")))))))
Formula 0 simplified : !G("(gu2.P1>gu2.P12s)" | X"((gu2.P1<=gu2.P12s)&&(gu7.P1M1<=gu7.P3M2))" | ("(gu5.M3<=gu5.P1wP2)" U (("(gu5.M3<=gu5.P1wP2)" & G"(gu7.P1M1>gu7.P3M2)") | G"(gu5.M3<=gu5.P1wP2)")))
Compilation finished in 153 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15147322272745224892]
Link finished in 33 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, --when, --ltl, [](((LTLAPp0==true)||X((LTLAPp1==true))||((LTLAPp2==true) U (((LTLAPp2==true)&&[]((LTLAPp3==true)))||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15147322272745224892]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: [](((LTLAPp0==true)||X((LTLAPp1==true))||((LTLAPp2==true) U (((LTLAPp2==true)&&[]((LTLAPp3==true)))||[]((LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.002: "[](((LTLAPp0==true)||X((LTLAPp1==true))||((LTLAPp2==true) U (((LTLAPp2==true)&&[]((LTLAPp3==true)))||[]((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.073: DFS-FIFO for weak LTL, using special progress label 25
pins2lts-mc-linux64( 0/ 8), 0.074: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.074: State length is 23, there are 63 groups
pins2lts-mc-linux64( 0/ 8), 0.074: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.074: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.074: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.074: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.218: ~1 levels ~960 states ~5248 transitions
pins2lts-mc-linux64( 5/ 8), 0.225: ~1 levels ~1920 states ~11440 transitions
pins2lts-mc-linux64( 4/ 8), 0.229: ~1 levels ~3840 states ~24512 transitions
pins2lts-mc-linux64( 4/ 8), 0.231: ~1 levels ~7680 states ~51192 transitions
pins2lts-mc-linux64( 4/ 8), 0.235: ~1 levels ~15360 states ~104976 transitions
pins2lts-mc-linux64( 4/ 8), 0.255: ~1 levels ~30720 states ~214440 transitions
pins2lts-mc-linux64( 7/ 8), 0.290: ~1 levels ~61440 states ~453440 transitions
pins2lts-mc-linux64( 6/ 8), 0.361: ~1 levels ~122880 states ~876312 transitions
pins2lts-mc-linux64( 6/ 8), 0.515: ~1 levels ~245760 states ~1806872 transitions
pins2lts-mc-linux64( 7/ 8), 0.836: ~1 levels ~491520 states ~3987464 transitions
pins2lts-mc-linux64( 5/ 8), 1.510: ~1 levels ~983040 states ~8157560 transitions
pins2lts-mc-linux64( 5/ 8), 2.823: ~1 levels ~1966080 states ~16702952 transitions
pins2lts-mc-linux64( 5/ 8), 5.679: ~1 levels ~3932160 states ~34142872 transitions
pins2lts-mc-linux64( 6/ 8), 11.679: ~1 levels ~7864320 states ~66274576 transitions
pins2lts-mc-linux64( 6/ 8), 23.016: ~1 levels ~15728640 states ~135914360 transitions
pins2lts-mc-linux64( 6/ 8), 48.348: ~1 levels ~31457280 states ~281134744 transitions
pins2lts-mc-linux64( 6/ 8), 101.091: ~1 levels ~62914560 states ~569192440 transitions
pins2lts-mc-linux64( 4/ 8), 208.218: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 208.273:
pins2lts-mc-linux64( 0/ 8), 208.273: mean standard work distribution: 4.2% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 208.273:
pins2lts-mc-linux64( 0/ 8), 208.273: Explored 105519050 states 1028441562 transitions, fanout: 9.747
pins2lts-mc-linux64( 0/ 8), 208.273: Total exploration time 208.200 sec (208.140 sec minimum, 208.156 sec on average)
pins2lts-mc-linux64( 0/ 8), 208.273: States per second: 506816, Transitions per second: 4939681
pins2lts-mc-linux64( 0/ 8), 208.273:
pins2lts-mc-linux64( 0/ 8), 208.273: Progress states detected: 134217334
pins2lts-mc-linux64( 0/ 8), 208.273: Redundant explorations: -21.3820
pins2lts-mc-linux64( 0/ 8), 208.273:
pins2lts-mc-linux64( 0/ 8), 208.273: Queue width: 8B, total height: 55701952, memory: 424.97MB
pins2lts-mc-linux64( 0/ 8), 208.273: Tree memory: 1032.9MB, 8.1 B/state, compr.: 8.6%
pins2lts-mc-linux64( 0/ 8), 208.273: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 208.273: Stored 20 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 208.273: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 208.273: Est. total memory use: 1457.9MB (~1449.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, --when, --ltl, [](((LTLAPp0==true)||X((LTLAPp1==true))||((LTLAPp2==true) U (((LTLAPp2==true)&&[]((LTLAPp3==true)))||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15147322272745224892]
255
java.lang.RuntimeException: Unexpected exception when executing 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, --when, --ltl, [](((LTLAPp0==true)||X((LTLAPp1==true))||((LTLAPp2==true) U (((LTLAPp2==true)&&[]((LTLAPp3==true)))||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15147322272745224892]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-10 19:19:06] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:19:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality13896974472854278185.gal : 0 ms
[2021-05-10 19:19:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality13686036229073955841.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/LTLCardinality13896974472854278185.gal, -t, CGAL, -LTL, /tmp/LTLCardinality13686036229073955841.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/LTLCardinality13896974472854278185.gal -t CGAL -LTL /tmp/LTLCardinality13686036229073955841.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((("(P1>P12s)")||(X("((P1<=P12s)&&(P1M1<=P3M2))")))||(("(M3<=P1wP2)")U((("(M3<=P1wP2)")&&(G("(P1M1>P3M2)")))||(G("(M3<=P1wP2)")))))))
Formula 0 simplified : !G("(P1>P12s)" | X"((P1<=P12s)&&(P1M1<=P3M2))" | ("(M3<=P1wP2)" U (("(M3<=P1wP2)" & G"(P1M1>P3M2)") | G"(M3<=P1wP2)")))
Detected timeout of ITS tools.
[2021-05-10 19:39:54] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:39:54] [INFO ] Input system was already deterministic with 20 transitions.
[2021-05-10 19:39:54] [INFO ] Transformed 22 places.
[2021-05-10 19:39:54] [INFO ] Transformed 20 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-10 19:39:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality7768171523199003591.gal : 0 ms
[2021-05-10 19:39:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality15423700230741211127.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/LTLCardinality7768171523199003591.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15423700230741211127.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLCardinality7768171523199003591.gal -t CGAL -LTL /tmp/LTLCardinality15423700230741211127.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((("(P1>P12s)")||(X("((P1<=P12s)&&(P1M1<=P3M2))")))||(("(M3<=P1wP2)")U((("(M3<=P1wP2)")&&(G("(P1M1>P3M2)")))||(G("(M3<=P1wP2)")))))))
Formula 0 simplified : !G("(P1>P12s)" | X"((P1<=P12s)&&(P1M1<=P3M2))" | ("(M3<=P1wP2)" U (("(M3<=P1wP2)" & G"(P1M1>P3M2)") | G"(M3<=P1wP2)")))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="FMS-PT-20000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FMS-PT-20000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875900828"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-20000.tgz
mv FMS-PT-20000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;