Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 8.7K Jun 7 17:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 7 17:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jun 6 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 17K Jun 7 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Jun 7 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 5.8M Jun 6 12:11 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 RingSingleMessageInMbox-PT-d1m020-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654930303262

Running Version 202205111006
[2022-06-11 06:51:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 06:51:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 06:51:44] [INFO ] Load time of PNML (sax parser for PT used): 404 ms
[2022-06-11 06:51:44] [INFO ] Transformed 6690 places.
[2022-06-11 06:51:44] [INFO ] Transformed 11934 transitions.
[2022-06-11 06:51:44] [INFO ] Parsed PT model containing 6690 places and 11934 transitions in 555 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 4305 places in 37 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1083 places :
Symmetric choice reduction at 1 with 1083 rule applications. Total rules 1202 place count 1285 transition count 7888
Iterating global reduction 1 with 1083 rules applied. Total rules applied 2285 place count 1285 transition count 7888
Ensure Unique test removed 315 transitions
Reduce isomorphic transitions removed 315 transitions.
Iterating post reduction 1 with 315 rules applied. Total rules applied 2600 place count 1285 transition count 7573
Discarding 882 places :
Symmetric choice reduction at 2 with 882 rule applications. Total rules 3482 place count 403 transition count 6691
Iterating global reduction 2 with 882 rules applied. Total rules applied 4364 place count 403 transition count 6691
Ensure Unique test removed 5141 transitions
Reduce isomorphic transitions removed 5141 transitions.
Iterating post reduction 2 with 5141 rules applied. Total rules applied 9505 place count 403 transition count 1550
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 9565 place count 343 transition count 1490
Iterating global reduction 3 with 60 rules applied. Total rules applied 9625 place count 343 transition count 1490
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 3 with 127 rules applied. Total rules applied 9752 place count 343 transition count 1363
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9760 place count 335 transition count 1355
Iterating global reduction 4 with 8 rules applied. Total rules applied 9768 place count 335 transition count 1355
Applied a total of 9768 rules in 352 ms. Remains 335 /2385 variables (removed 2050) and now considering 1355/11934 (removed 10579) transitions.
// Phase 1: matrix 1355 rows 335 cols
[2022-06-11 06:51:45] [INFO ] Computed 3 place invariants in 29 ms
[2022-06-11 06:51:45] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 1355 rows 335 cols
[2022-06-11 06:51:45] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 06:51:46] [INFO ] State equation strengthened by 1052 read => feed constraints.
[2022-06-11 06:51:48] [INFO ] Implicit Places using invariants and state equation in 2370 ms returned []
Implicit Place search using SMT with State Equation took 2738 ms to find 0 implicit places.
// Phase 1: matrix 1355 rows 335 cols
[2022-06-11 06:51:48] [INFO ] Computed 3 place invariants in 17 ms
[2022-06-11 06:51:48] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/2385 places, 1355/11934 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/2385 places, 1355/11934 transitions.
Support contains 33 out of 335 places after structural reductions.
[2022-06-11 06:51:48] [INFO ] Flatten gal took : 104 ms
[2022-06-11 06:51:49] [INFO ] Flatten gal took : 73 ms
[2022-06-11 06:51:49] [INFO ] Input system was already deterministic with 1355 transitions.
Support contains 31 out of 335 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1778 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 33) seen :32
Incomplete Best-First random walk after 10001 steps, including 187 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1355 rows 335 cols
[2022-06-11 06:51:49] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 06:51:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 06:51:49] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 06:51:49] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 76 stabilizing places and 521 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&p1&&(!p1 U !p0)))||F(p2)))'
Support contains 5 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 308 transition count 554
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 308 transition count 554
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 308 transition count 549
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 102 place count 265 transition count 506
Iterating global reduction 1 with 43 rules applied. Total rules applied 145 place count 265 transition count 506
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 182 place count 265 transition count 469
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 258 place count 189 transition count 393
Iterating global reduction 2 with 76 rules applied. Total rules applied 334 place count 189 transition count 393
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 426 place count 189 transition count 301
Applied a total of 426 rules in 23 ms. Remains 189 /335 variables (removed 146) and now considering 301/1355 (removed 1054) transitions.
// Phase 1: matrix 301 rows 189 cols
[2022-06-11 06:51:50] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:51:50] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 301 rows 189 cols
[2022-06-11 06:51:50] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:51:50] [INFO ] State equation strengthened by 124 read => feed constraints.
[2022-06-11 06:51:51] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
// Phase 1: matrix 301 rows 189 cols
[2022-06-11 06:51:51] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:51:51] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/335 places, 301/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/335 places, 301/1355 transitions.
Stuttering acceptance computed with spot in 715 ms :[(AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (GEQ s10 1) (GEQ s77 1)), p0:(OR (LT s1 1) (LT s105 1)), p1:(OR (LT s1 1) (LT s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-00 finished in 1521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))&&(p1 U p2))))'
Support contains 4 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 308 transition count 636
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 308 transition count 636
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 308 transition count 628
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 104 place count 266 transition count 586
Iterating global reduction 1 with 42 rules applied. Total rules applied 146 place count 266 transition count 586
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 200 place count 266 transition count 532
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 268 place count 198 transition count 464
Iterating global reduction 2 with 68 rules applied. Total rules applied 336 place count 198 transition count 464
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 448 place count 198 transition count 352
Applied a total of 448 rules in 20 ms. Remains 198 /335 variables (removed 137) and now considering 352/1355 (removed 1003) transitions.
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:51:51] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:51:52] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:51:52] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:51:52] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-06-11 06:51:52] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:51:52] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:51:52] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/335 places, 352/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/335 places, 352/1355 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s165 1)), p1:(AND (GEQ s1 1) (GEQ s164 1)), p0:(AND (GEQ s1 1) (GEQ s166 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 finished in 1297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!((F(p0)||G(p1)) U !(X(p2)||p1))))))'
Support contains 4 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 308 transition count 636
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 308 transition count 636
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 308 transition count 628
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 104 place count 266 transition count 586
Iterating global reduction 1 with 42 rules applied. Total rules applied 146 place count 266 transition count 586
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 200 place count 266 transition count 532
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 268 place count 198 transition count 464
Iterating global reduction 2 with 68 rules applied. Total rules applied 336 place count 198 transition count 464
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 2 with 120 rules applied. Total rules applied 456 place count 198 transition count 344
Applied a total of 456 rules in 26 ms. Remains 198 /335 variables (removed 137) and now considering 344/1355 (removed 1011) transitions.
// Phase 1: matrix 344 rows 198 cols
[2022-06-11 06:51:53] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:51:53] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 344 rows 198 cols
[2022-06-11 06:51:53] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:51:53] [INFO ] State equation strengthened by 160 read => feed constraints.
[2022-06-11 06:51:53] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
// Phase 1: matrix 344 rows 198 cols
[2022-06-11 06:51:53] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-11 06:51:54] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/335 places, 344/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/335 places, 344/1355 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s166 1)), p1:(AND (GEQ s1 1) (GEQ s164 1)), p2:(AND (GEQ s1 1) (GEQ s165 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 finished in 1228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((G(p2)||p1)&&!(p3 U !p4)))||p0)))'
Support contains 3 out of 335 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 308 transition count 634
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 308 transition count 634
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 308 transition count 628
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 102 place count 266 transition count 586
Iterating global reduction 1 with 42 rules applied. Total rules applied 144 place count 266 transition count 586
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 198 place count 266 transition count 532
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 266 place count 198 transition count 464
Iterating global reduction 2 with 68 rules applied. Total rules applied 334 place count 198 transition count 464
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 446 place count 198 transition count 352
Applied a total of 446 rules in 22 ms. Remains 198 /335 variables (removed 137) and now considering 352/1355 (removed 1003) transitions.
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:51:54] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:51:54] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:51:54] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:51:54] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-06-11 06:51:55] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:51:55] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:51:55] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/335 places, 352/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/335 places, 352/1355 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p4))), (OR (NOT p4) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p4))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p4 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p4 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p4) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p4 p1), acceptance={} source=3 dest: 3}, { cond=(AND p4 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p4) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p4 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s165 1)), p4:(AND (GEQ s1 1) (GEQ s166 1)), p1:(OR (LT s1 1) (LT s165 1)), p2:(OR (LT s1 1) (LT s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 455 ms.
Product exploration explored 100000 steps with 50000 reset in 421 ms.
Computed a total of 19 stabilizing places and 84 stable transitions
Computed a total of 19 stabilizing places and 84 stable transitions
Knowledge obtained : [(AND p0 (NOT p4) p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) p4 p1))), (X (NOT (AND (NOT p0) p4 (NOT p1) p2))), (X (X (NOT (AND p4 (NOT p1) p2)))), true, (X (X (NOT (AND p4 p2)))), (X (X (OR (NOT p4) (NOT p2)))), (X (X (NOT (AND p4 p1)))), (X (X (OR (NOT p4) (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p4 (NOT p1) p2)))
Knowledge based reduction with 10 factoid took 274 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-04 finished in 2295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(F(p0))))&&X(p0))))'
Support contains 2 out of 335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 305 transition count 511
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 305 transition count 511
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 305 transition count 505
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 111 place count 260 transition count 460
Iterating global reduction 1 with 45 rules applied. Total rules applied 156 place count 260 transition count 460
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 186 place count 260 transition count 430
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 266 place count 180 transition count 350
Iterating global reduction 2 with 80 rules applied. Total rules applied 346 place count 180 transition count 350
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 422 place count 180 transition count 274
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 424 place count 178 transition count 248
Iterating global reduction 3 with 2 rules applied. Total rules applied 426 place count 178 transition count 248
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 427 place count 177 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 428 place count 177 transition count 247
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 432 place count 173 transition count 243
Iterating global reduction 3 with 4 rules applied. Total rules applied 436 place count 173 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 444 place count 173 transition count 235
Applied a total of 444 rules in 88 ms. Remains 173 /335 variables (removed 162) and now considering 235/1355 (removed 1120) transitions.
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 06:51:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:51:56] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 06:51:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:51:56] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 06:51:57] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2022-06-11 06:51:57] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 06:51:57] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:51:57] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/335 places, 235/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 173/335 places, 235/1355 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19727 reset in 258 ms.
Product exploration explored 100000 steps with 19680 reset in 251 ms.
Computed a total of 6 stabilizing places and 15 stable transitions
Computed a total of 6 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 235/235 transitions.
Applied a total of 0 rules in 20 ms. Remains 173 /173 variables (removed 0) and now considering 235/235 (removed 0) transitions.
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 06:51:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:51:58] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 06:51:58] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:51:58] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 06:51:59] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2022-06-11 06:51:59] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 06:51:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:51:59] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 173/173 places, 235/235 transitions.
Computed a total of 6 stabilizing places and 15 stable transitions
Computed a total of 6 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 79 steps, including 19 resets, run visited all 1 properties in 6 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 1578 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19718 reset in 191 ms.
Product exploration explored 100000 steps with 19744 reset in 187 ms.
Built C files in :
/tmp/ltsmin9248640268786938833
[2022-06-11 06:52:04] [INFO ] Computing symmetric may disable matrix : 235 transitions.
[2022-06-11 06:52:04] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:52:04] [INFO ] Computing symmetric may enable matrix : 235 transitions.
[2022-06-11 06:52:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:52:04] [INFO ] Computing Do-Not-Accords matrix : 235 transitions.
[2022-06-11 06:52:04] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:52:04] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9248640268786938833
Running compilation step : cd /tmp/ltsmin9248640268786938833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 551 ms.
Running link step : cd /tmp/ltsmin9248640268786938833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9248640268786938833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14922820764727011923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 235/235 transitions.
Applied a total of 0 rules in 18 ms. Remains 173 /173 variables (removed 0) and now considering 235/235 (removed 0) transitions.
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 06:52:19] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:52:19] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 06:52:19] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:52:19] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 06:52:19] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2022-06-11 06:52:19] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 06:52:19] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:52:19] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 173/173 places, 235/235 transitions.
Built C files in :
/tmp/ltsmin17604887571834060152
[2022-06-11 06:52:22] [INFO ] Computing symmetric may disable matrix : 235 transitions.
[2022-06-11 06:52:22] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:52:22] [INFO ] Computing symmetric may enable matrix : 235 transitions.
[2022-06-11 06:52:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:52:22] [INFO ] Computing Do-Not-Accords matrix : 235 transitions.
[2022-06-11 06:52:22] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:52:22] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17604887571834060152
Running compilation step : cd /tmp/ltsmin17604887571834060152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 473 ms.
Running link step : cd /tmp/ltsmin17604887571834060152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17604887571834060152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7507748525126282723.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 06:52:37] [INFO ] Flatten gal took : 12 ms
[2022-06-11 06:52:37] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:52:37] [INFO ] Time to serialize gal into /tmp/LTL6922017322521000184.gal : 2 ms
[2022-06-11 06:52:37] [INFO ] Time to serialize properties into /tmp/LTL10528173706038900001.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6922017322521000184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10528173706038900001.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6922017...267
Read 1 LTL properties
Checking formula 0 : !((F((G(F(X(F("((s1<1)||(l195<1))")))))&&(X("((s1<1)||(l195<1))")))))
Formula 0 simplified : !F(GFXF"((s1<1)||(l195<1))" & X"((s1<1)||(l195<1))")
Detected timeout of ITS tools.
[2022-06-11 06:52:53] [INFO ] Flatten gal took : 13 ms
[2022-06-11 06:52:53] [INFO ] Applying decomposition
[2022-06-11 06:52:53] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17862733898645523667.txt' '-o' '/tmp/graph17862733898645523667.bin' '-w' '/tmp/graph17862733898645523667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17862733898645523667.bin' '-l' '-1' '-v' '-w' '/tmp/graph17862733898645523667.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:52:54] [INFO ] Decomposing Gal with order
[2022-06-11 06:52:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:52:55] [INFO ] Removed a total of 207 redundant transitions.
[2022-06-11 06:52:55] [INFO ] Flatten gal took : 83 ms
[2022-06-11 06:52:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 13 ms.
[2022-06-11 06:52:55] [INFO ] Time to serialize gal into /tmp/LTL3075022662686498122.gal : 4 ms
[2022-06-11 06:52:55] [INFO ] Time to serialize properties into /tmp/LTL8683309314031438222.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3075022662686498122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8683309314031438222.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3075022...245
Read 1 LTL properties
Checking formula 0 : !((F((G(F(X(F("((u0.s1<1)||(u3.l195<1))")))))&&(X("((u0.s1<1)||(u3.l195<1))")))))
Formula 0 simplified : !F(GFXF"((u0.s1<1)||(u3.l195<1))" & X"((u0.s1<1)||(u3.l195<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17436201016301356572
[2022-06-11 06:53:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17436201016301356572
Running compilation step : cd /tmp/ltsmin17436201016301356572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 352 ms.
Running link step : cd /tmp/ltsmin17436201016301356572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17436201016301356572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(X(<>((LTLAPp0==true)))))&&X((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-05 finished in 88557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p1 U !F(p1))&&p0)))'
Support contains 5 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 308 transition count 556
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 308 transition count 556
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 308 transition count 548
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 83 place count 287 transition count 527
Iterating global reduction 1 with 21 rules applied. Total rules applied 104 place count 287 transition count 527
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 287 transition count 525
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 201 place count 192 transition count 430
Iterating global reduction 2 with 95 rules applied. Total rules applied 296 place count 192 transition count 430
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 2 with 115 rules applied. Total rules applied 411 place count 192 transition count 315
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 412 place count 191 transition count 300
Iterating global reduction 3 with 1 rules applied. Total rules applied 413 place count 191 transition count 300
Applied a total of 413 rules in 18 ms. Remains 191 /335 variables (removed 144) and now considering 300/1355 (removed 1055) transitions.
// Phase 1: matrix 300 rows 191 cols
[2022-06-11 06:53:25] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:53:25] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 300 rows 191 cols
[2022-06-11 06:53:25] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:53:25] [INFO ] State equation strengthened by 121 read => feed constraints.
[2022-06-11 06:53:25] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
// Phase 1: matrix 300 rows 191 cols
[2022-06-11 06:53:25] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:53:25] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/335 places, 300/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/335 places, 300/1355 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s12 1) (GEQ s77 1)), p0:(AND (GEQ s1 1) (GEQ s158 1) (GEQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 finished in 919 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(X(p2)||p1))))'
Support contains 4 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 308 transition count 636
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 308 transition count 636
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 308 transition count 628
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 104 place count 266 transition count 586
Iterating global reduction 1 with 42 rules applied. Total rules applied 146 place count 266 transition count 586
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 200 place count 266 transition count 532
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 268 place count 198 transition count 464
Iterating global reduction 2 with 68 rules applied. Total rules applied 336 place count 198 transition count 464
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 460 place count 198 transition count 340
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 461 place count 197 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 462 place count 197 transition count 327
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 463 place count 196 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 464 place count 196 transition count 326
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 468 place count 192 transition count 322
Iterating global reduction 3 with 4 rules applied. Total rules applied 472 place count 192 transition count 322
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 496 place count 192 transition count 298
Applied a total of 496 rules in 33 ms. Remains 192 /335 variables (removed 143) and now considering 298/1355 (removed 1057) transitions.
// Phase 1: matrix 298 rows 192 cols
[2022-06-11 06:53:26] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:53:26] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 298 rows 192 cols
[2022-06-11 06:53:26] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:53:26] [INFO ] State equation strengthened by 119 read => feed constraints.
[2022-06-11 06:53:26] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 192 cols
[2022-06-11 06:53:26] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 06:53:26] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/335 places, 298/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/335 places, 298/1355 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s158 1)), p2:(AND (GEQ s1 1) (GEQ s159 1)), p1:(OR (LT s1 1) (LT s160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 finished in 978 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 306 transition count 554
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 306 transition count 554
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 66 place count 306 transition count 546
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 110 place count 262 transition count 502
Iterating global reduction 1 with 44 rules applied. Total rules applied 154 place count 262 transition count 502
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 192 place count 262 transition count 464
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 268 place count 186 transition count 388
Iterating global reduction 2 with 76 rules applied. Total rules applied 344 place count 186 transition count 388
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 436 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 438 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 440 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 441 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 442 place count 183 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 443 place count 183 transition count 268
Applied a total of 443 rules in 39 ms. Remains 183 /335 variables (removed 152) and now considering 268/1355 (removed 1087) transitions.
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 06:53:27] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:53:27] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 06:53:27] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:53:27] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 06:53:27] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2022-06-11 06:53:27] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 06:53:27] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:53:27] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/335 places, 268/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/335 places, 268/1355 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s151 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-09 finished in 754 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((X(!p0) U p1)))||(F(p1) U G(p0))))'
Support contains 3 out of 335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 307 transition count 597
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 307 transition count 597
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 66 place count 307 transition count 587
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 109 place count 264 transition count 544
Iterating global reduction 1 with 43 rules applied. Total rules applied 152 place count 264 transition count 544
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 198 place count 264 transition count 498
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 270 place count 192 transition count 426
Iterating global reduction 2 with 72 rules applied. Total rules applied 342 place count 192 transition count 426
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 442 place count 192 transition count 326
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 443 place count 191 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 444 place count 191 transition count 313
Applied a total of 444 rules in 38 ms. Remains 191 /335 variables (removed 144) and now considering 313/1355 (removed 1042) transitions.
// Phase 1: matrix 313 rows 191 cols
[2022-06-11 06:53:27] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:53:28] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 313 rows 191 cols
[2022-06-11 06:53:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:53:28] [INFO ] State equation strengthened by 134 read => feed constraints.
[2022-06-11 06:53:28] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2022-06-11 06:53:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 313 rows 191 cols
[2022-06-11 06:53:28] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:53:28] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 191/335 places, 313/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/335 places, 313/1355 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s158 1)), p0:(AND (GEQ s1 1) (GEQ s159 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-10 finished in 841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(G(p1)||!p0)))))'
Support contains 3 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 307 transition count 555
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 307 transition count 555
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 307 transition count 549
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 106 place count 263 transition count 505
Iterating global reduction 1 with 44 rules applied. Total rules applied 150 place count 263 transition count 505
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 188 place count 263 transition count 467
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 264 place count 187 transition count 391
Iterating global reduction 2 with 76 rules applied. Total rules applied 340 place count 187 transition count 391
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 432 place count 187 transition count 299
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 433 place count 186 transition count 286
Iterating global reduction 3 with 1 rules applied. Total rules applied 434 place count 186 transition count 286
Applied a total of 434 rules in 20 ms. Remains 186 /335 variables (removed 149) and now considering 286/1355 (removed 1069) transitions.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:28] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:53:28] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:28] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:53:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-11 06:53:29] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:29] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-11 06:53:29] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/335 places, 286/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/335 places, 286/1355 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s154 1)), p1:(OR (LT s1 1) (LT s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23704 reset in 270 ms.
Product exploration explored 100000 steps with 23440 reset in 297 ms.
Computed a total of 12 stabilizing places and 42 stable transitions
Computed a total of 12 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 389 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1820 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 295 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:53:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-11 06:53:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 6 ms returned sat
[2022-06-11 06:53:31] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 454 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 286/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 286/286 (removed 0) transitions.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:31] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:53:31] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:31] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:53:31] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-11 06:53:32] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:32] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:53:32] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 286/286 transitions.
Computed a total of 12 stabilizing places and 42 stable transitions
Computed a total of 12 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 766 steps, including 138 resets, run visited all 3 properties in 10 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 23712 reset in 230 ms.
Product exploration explored 100000 steps with 23549 reset in 234 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 286/286 transitions.
Applied a total of 0 rules in 20 ms. Remains 186 /186 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2022-06-11 06:53:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:53:34] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 286/286 transitions.
Product exploration explored 100000 steps with 23826 reset in 403 ms.
Product exploration explored 100000 steps with 23816 reset in 416 ms.
Built C files in :
/tmp/ltsmin11993975723098715214
[2022-06-11 06:53:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11993975723098715214
Running compilation step : cd /tmp/ltsmin11993975723098715214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 441 ms.
Running link step : cd /tmp/ltsmin11993975723098715214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11993975723098715214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10759907393678445712.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 286/286 transitions.
Applied a total of 0 rules in 6 ms. Remains 186 /186 variables (removed 0) and now considering 286/286 (removed 0) transitions.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:50] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:53:50] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:50] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:53:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-11 06:53:51] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:53:51] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-11 06:53:51] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 286/286 transitions.
Built C files in :
/tmp/ltsmin15427576401019873234
[2022-06-11 06:53:51] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15427576401019873234
Running compilation step : cd /tmp/ltsmin15427576401019873234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 405 ms.
Running link step : cd /tmp/ltsmin15427576401019873234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15427576401019873234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7256470519829795370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 06:54:06] [INFO ] Flatten gal took : 12 ms
[2022-06-11 06:54:06] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:54:06] [INFO ] Time to serialize gal into /tmp/LTL17362155962555608597.gal : 5 ms
[2022-06-11 06:54:06] [INFO ] Time to serialize properties into /tmp/LTL7755877806612647196.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17362155962555608597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7755877806612647196.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1736215...267
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((s1<1)||(l3921<1))"))&&((G("((s1<1)||(l2585<1))"))||("((s1>=1)&&(l3921>=1))"))))))
Formula 0 simplified : !XF(X"((s1<1)||(l3921<1))" & ("((s1>=1)&&(l3921>=1))" | G"((s1<1)||(l2585<1))"))
Detected timeout of ITS tools.
[2022-06-11 06:54:21] [INFO ] Flatten gal took : 13 ms
[2022-06-11 06:54:21] [INFO ] Applying decomposition
[2022-06-11 06:54:21] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5305600602019820502.txt' '-o' '/tmp/graph5305600602019820502.bin' '-w' '/tmp/graph5305600602019820502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5305600602019820502.bin' '-l' '-1' '-v' '-w' '/tmp/graph5305600602019820502.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:54:21] [INFO ] Decomposing Gal with order
[2022-06-11 06:54:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:54:21] [INFO ] Removed a total of 286 redundant transitions.
[2022-06-11 06:54:21] [INFO ] Flatten gal took : 27 ms
[2022-06-11 06:54:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 9 ms.
[2022-06-11 06:54:21] [INFO ] Time to serialize gal into /tmp/LTL7557532326950520790.gal : 3 ms
[2022-06-11 06:54:21] [INFO ] Time to serialize properties into /tmp/LTL11323239855516489108.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7557532326950520790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11323239855516489108.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7557532...246
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((u0.s1<1)||(u0.l3921<1))"))&&((G("((u0.s1<1)||(u0.l2585<1))"))||("((u0.s1>=1)&&(u0.l3921>=1))"))))))
Formula 0 simplified : !XF(X"((u0.s1<1)||(u0.l3921<1))" & ("((u0.s1>=1)&&(u0.l3921>=1))" | G"((u0.s1<1)||(u0.l2585<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10981582886028110301
[2022-06-11 06:54:36] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10981582886028110301
Running compilation step : cd /tmp/ltsmin10981582886028110301;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 423 ms.
Running link step : cd /tmp/ltsmin10981582886028110301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10981582886028110301;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&([]((LTLAPp1==true))||!(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 finished in 83025 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 308 transition count 636
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 308 transition count 636
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 308 transition count 628
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 104 place count 266 transition count 586
Iterating global reduction 1 with 42 rules applied. Total rules applied 146 place count 266 transition count 586
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 200 place count 266 transition count 532
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 268 place count 198 transition count 464
Iterating global reduction 2 with 68 rules applied. Total rules applied 336 place count 198 transition count 464
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 448 place count 198 transition count 352
Applied a total of 448 rules in 52 ms. Remains 198 /335 variables (removed 137) and now considering 352/1355 (removed 1003) transitions.
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:54:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:54:51] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:54:51] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:54:52] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-06-11 06:54:52] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2022-06-11 06:54:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:54:52] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:54:52] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 198/335 places, 352/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/335 places, 352/1355 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s161 1) (AND (GEQ s1 1) (GEQ s166 1))), p1:(OR (LT s1 1) (LT s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 18018 reset in 284 ms.
Product exploration explored 100000 steps with 18241 reset in 285 ms.
Computed a total of 13 stabilizing places and 58 stable transitions
Computed a total of 13 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 821 steps, including 155 resets, run visited all 2 properties in 11 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 352/352 transitions.
Applied a total of 0 rules in 15 ms. Remains 198 /198 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:54:54] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:54:54] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:54:54] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:54:54] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-06-11 06:54:54] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2022-06-11 06:54:54] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:54:55] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:54:55] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 352/352 transitions.
Computed a total of 13 stabilizing places and 58 stable transitions
Computed a total of 13 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 286 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 487 steps, including 83 resets, run visited all 2 properties in 7 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 18274 reset in 269 ms.
Product exploration explored 100000 steps with 18056 reset in 257 ms.
Built C files in :
/tmp/ltsmin18267797412517043398
[2022-06-11 06:54:56] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2022-06-11 06:54:56] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:54:56] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2022-06-11 06:54:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:54:56] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2022-06-11 06:54:56] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:54:56] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18267797412517043398
Running compilation step : cd /tmp/ltsmin18267797412517043398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 757 ms.
Running link step : cd /tmp/ltsmin18267797412517043398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18267797412517043398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13577961036608972443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 352/352 transitions.
Applied a total of 0 rules in 16 ms. Remains 198 /198 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:55:11] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:55:11] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:55:11] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:55:11] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-06-11 06:55:12] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2022-06-11 06:55:12] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 352 rows 198 cols
[2022-06-11 06:55:12] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:55:12] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin7525896940975560849
[2022-06-11 06:55:12] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2022-06-11 06:55:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:55:12] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2022-06-11 06:55:12] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:55:12] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2022-06-11 06:55:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:55:12] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7525896940975560849
Running compilation step : cd /tmp/ltsmin7525896940975560849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 756 ms.
Running link step : cd /tmp/ltsmin7525896940975560849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7525896940975560849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13429839628616858796.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 06:55:27] [INFO ] Flatten gal took : 12 ms
[2022-06-11 06:55:27] [INFO ] Flatten gal took : 13 ms
[2022-06-11 06:55:27] [INFO ] Time to serialize gal into /tmp/LTL9628185565142438129.gal : 2 ms
[2022-06-11 06:55:27] [INFO ] Time to serialize properties into /tmp/LTL11937602267065469521.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9628185565142438129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11937602267065469521.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9628185...267
Read 1 LTL properties
Checking formula 0 : !((G((F("(((s1<1)||(l3908<1))||((s1>=1)&&(l3936>=1)))"))&&(F(G("((s1<1)||(l3914<1))"))))))
Formula 0 simplified : !G(F"(((s1<1)||(l3908<1))||((s1>=1)&&(l3936>=1)))" & FG"((s1<1)||(l3914<1))")
Detected timeout of ITS tools.
[2022-06-11 06:55:42] [INFO ] Flatten gal took : 17 ms
[2022-06-11 06:55:42] [INFO ] Applying decomposition
[2022-06-11 06:55:42] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14634070815691050157.txt' '-o' '/tmp/graph14634070815691050157.bin' '-w' '/tmp/graph14634070815691050157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14634070815691050157.bin' '-l' '-1' '-v' '-w' '/tmp/graph14634070815691050157.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:55:42] [INFO ] Decomposing Gal with order
[2022-06-11 06:55:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:55:42] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-11 06:55:42] [INFO ] Flatten gal took : 32 ms
[2022-06-11 06:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 219 labels/synchronizations in 12 ms.
[2022-06-11 06:55:43] [INFO ] Time to serialize gal into /tmp/LTL2899013126168048615.gal : 3 ms
[2022-06-11 06:55:43] [INFO ] Time to serialize properties into /tmp/LTL133197094620920041.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2899013126168048615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL133197094620920041.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2899013...244
Read 1 LTL properties
Checking formula 0 : !((G((F("(((i0.u0.s1<1)||(i0.u6.l3908<1))||((i0.u0.s1>=1)&&(i0.u6.l3936>=1)))"))&&(F(G("((i0.u0.s1<1)||(i0.u25.l3914<1))"))))))
Formula 0 simplified : !G(F"(((i0.u0.s1<1)||(i0.u6.l3908<1))||((i0.u0.s1>=1)&&(i0.u6.l3936>=1)))" & FG"((i0.u0.s1<1)||(i0.u25.l3914<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6781137079191024703
[2022-06-11 06:55:58] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6781137079191024703
Running compilation step : cd /tmp/ltsmin6781137079191024703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 507 ms.
Running link step : cd /tmp/ltsmin6781137079191024703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6781137079191024703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 finished in 81377 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(!(F(p0)||(p0 U p1)))) U G((p2 U p1))))'
Support contains 4 out of 335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 308 transition count 596
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 308 transition count 596
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 61 place count 308 transition count 589
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 104 place count 265 transition count 546
Iterating global reduction 1 with 43 rules applied. Total rules applied 147 place count 265 transition count 546
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 193 place count 265 transition count 500
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 265 place count 193 transition count 428
Iterating global reduction 2 with 72 rules applied. Total rules applied 337 place count 193 transition count 428
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 441 place count 193 transition count 324
Applied a total of 441 rules in 32 ms. Remains 193 /335 variables (removed 142) and now considering 324/1355 (removed 1031) transitions.
// Phase 1: matrix 324 rows 193 cols
[2022-06-11 06:56:13] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:56:13] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 324 rows 193 cols
[2022-06-11 06:56:13] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:56:13] [INFO ] State equation strengthened by 144 read => feed constraints.
[2022-06-11 06:56:13] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2022-06-11 06:56:13] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 324 rows 193 cols
[2022-06-11 06:56:13] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:56:13] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 193/335 places, 324/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/335 places, 324/1355 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR p0 p1), (NOT p1), p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 2}], [{ cond=(OR p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s161 1)), p2:(AND (GEQ s1 1) (GEQ s160 1)), p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 44 steps with 7 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-13 finished in 1052 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&(p0 U F(((!p2 U p3)&&p1)))))'
Support contains 4 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 307 transition count 553
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 307 transition count 553
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 307 transition count 548
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 105 place count 263 transition count 504
Iterating global reduction 1 with 44 rules applied. Total rules applied 149 place count 263 transition count 504
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 187 place count 263 transition count 466
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 263 place count 187 transition count 390
Iterating global reduction 2 with 76 rules applied. Total rules applied 339 place count 187 transition count 390
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 427 place count 187 transition count 302
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 428 place count 186 transition count 289
Iterating global reduction 3 with 1 rules applied. Total rules applied 429 place count 186 transition count 289
Applied a total of 429 rules in 16 ms. Remains 186 /335 variables (removed 149) and now considering 289/1355 (removed 1066) transitions.
// Phase 1: matrix 289 rows 186 cols
[2022-06-11 06:56:14] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:56:14] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 289 rows 186 cols
[2022-06-11 06:56:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:56:14] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-06-11 06:56:14] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 186 cols
[2022-06-11 06:56:14] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:56:14] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/335 places, 289/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/335 places, 289/1355 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p3)), (NOT p3), (NOT p0), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p3) p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (AND (NOT p3) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s85 1)), p3:(AND (GEQ s1 1) (GEQ s99 1)), p2:(OR (LT s1 1) (LT s85 1)), p0:(AND (GEQ s1 1) (GEQ s154 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-14 finished in 1017 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(!p0) U (X(p1)||p2)))'
Support contains 4 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 308 transition count 636
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 308 transition count 636
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 308 transition count 628
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 104 place count 266 transition count 586
Iterating global reduction 1 with 42 rules applied. Total rules applied 146 place count 266 transition count 586
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 200 place count 266 transition count 532
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 268 place count 198 transition count 464
Iterating global reduction 2 with 68 rules applied. Total rules applied 336 place count 198 transition count 464
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 444 place count 198 transition count 356
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 445 place count 197 transition count 343
Iterating global reduction 3 with 1 rules applied. Total rules applied 446 place count 197 transition count 343
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 447 place count 196 transition count 342
Iterating global reduction 3 with 1 rules applied. Total rules applied 448 place count 196 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 449 place count 196 transition count 341
Applied a total of 449 rules in 24 ms. Remains 196 /335 variables (removed 139) and now considering 341/1355 (removed 1014) transitions.
// Phase 1: matrix 341 rows 196 cols
[2022-06-11 06:56:15] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:56:15] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 341 rows 196 cols
[2022-06-11 06:56:15] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:56:15] [INFO ] State equation strengthened by 158 read => feed constraints.
[2022-06-11 06:56:15] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
// Phase 1: matrix 341 rows 196 cols
[2022-06-11 06:56:15] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:56:16] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/335 places, 341/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/335 places, 341/1355 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, p1, (OR p1 p2), (OR p1 (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s164 1)), p2:(AND (GEQ s1 1) (GEQ s163 1)), p0:(AND (GEQ s1 1) (GEQ s161 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 6 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 finished in 1012 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(F(p0))))&&X(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(G(p1)||!p0)))))'
Found a CL insensitive property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 335 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 335/335 places, 1355/1355 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 307 transition count 555
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 307 transition count 555
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 307 transition count 549
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 106 place count 263 transition count 505
Iterating global reduction 1 with 44 rules applied. Total rules applied 150 place count 263 transition count 505
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 188 place count 263 transition count 467
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 264 place count 187 transition count 391
Iterating global reduction 2 with 76 rules applied. Total rules applied 340 place count 187 transition count 391
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 432 place count 187 transition count 299
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 433 place count 186 transition count 286
Iterating global reduction 3 with 1 rules applied. Total rules applied 434 place count 186 transition count 286
Applied a total of 434 rules in 27 ms. Remains 186 /335 variables (removed 149) and now considering 286/1355 (removed 1069) transitions.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:16] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-11 06:56:16] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:56:16] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-11 06:56:17] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:56:17] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 186/335 places, 286/1355 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/335 places, 286/1355 transitions.
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s154 1)), p1:(OR (LT s1 1) (LT s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23856 reset in 231 ms.
Product exploration explored 100000 steps with 23811 reset in 241 ms.
Computed a total of 12 stabilizing places and 42 stable transitions
Computed a total of 12 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 436 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1795 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:18] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-11 06:56:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 06:56:18] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 06:56:18] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 479 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 286/286 transitions.
Applied a total of 0 rules in 4 ms. Remains 186 /186 variables (removed 0) and now considering 286/286 (removed 0) transitions.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:19] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:56:19] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:19] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 06:56:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-11 06:56:20] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:20] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:56:20] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 286/286 transitions.
Computed a total of 12 stabilizing places and 42 stable transitions
Computed a total of 12 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 1733 steps, including 311 resets, run visited all 3 properties in 22 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 247 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 23626 reset in 228 ms.
Product exploration explored 100000 steps with 23860 reset in 232 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 286/286 transitions.
Applied a total of 0 rules in 13 ms. Remains 186 /186 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2022-06-11 06:56:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:22] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:56:22] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 286/286 transitions.
Product exploration explored 100000 steps with 23670 reset in 372 ms.
Product exploration explored 100000 steps with 23805 reset in 360 ms.
Built C files in :
/tmp/ltsmin10373645954825748272
[2022-06-11 06:56:23] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10373645954825748272
Running compilation step : cd /tmp/ltsmin10373645954825748272;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 431 ms.
Running link step : cd /tmp/ltsmin10373645954825748272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10373645954825748272;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased141518220755568312.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 286/286 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 286/286 (removed 0) transitions.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:38] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:56:38] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:56:38] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-11 06:56:38] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 186 cols
[2022-06-11 06:56:38] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:56:38] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 286/286 transitions.
Built C files in :
/tmp/ltsmin12715605100066874217
[2022-06-11 06:56:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12715605100066874217
Running compilation step : cd /tmp/ltsmin12715605100066874217;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 413 ms.
Running link step : cd /tmp/ltsmin12715605100066874217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12715605100066874217;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1401013306914696737.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 06:56:53] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:56:54] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:56:54] [INFO ] Time to serialize gal into /tmp/LTL2217333636816976022.gal : 2 ms
[2022-06-11 06:56:54] [INFO ] Time to serialize properties into /tmp/LTL12635097512897359328.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2217333636816976022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12635097512897359328.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2217333...267
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((s1<1)||(l3921<1))"))&&((G("((s1<1)||(l2585<1))"))||("((s1>=1)&&(l3921>=1))"))))))
Formula 0 simplified : !XF(X"((s1<1)||(l3921<1))" & ("((s1>=1)&&(l3921>=1))" | G"((s1<1)||(l2585<1))"))
Detected timeout of ITS tools.
[2022-06-11 06:57:09] [INFO ] Flatten gal took : 12 ms
[2022-06-11 06:57:09] [INFO ] Applying decomposition
[2022-06-11 06:57:09] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10914810655801594145.txt' '-o' '/tmp/graph10914810655801594145.bin' '-w' '/tmp/graph10914810655801594145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10914810655801594145.bin' '-l' '-1' '-v' '-w' '/tmp/graph10914810655801594145.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:57:09] [INFO ] Decomposing Gal with order
[2022-06-11 06:57:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:57:09] [INFO ] Removed a total of 299 redundant transitions.
[2022-06-11 06:57:09] [INFO ] Flatten gal took : 35 ms
[2022-06-11 06:57:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 10 ms.
[2022-06-11 06:57:09] [INFO ] Time to serialize gal into /tmp/LTL2044727868879501791.gal : 8 ms
[2022-06-11 06:57:09] [INFO ] Time to serialize properties into /tmp/LTL14020981762490333839.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2044727868879501791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14020981762490333839.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2044727...246
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((i2.u1.s1<1)||(u23.l3921<1))"))&&((G("((i2.u1.s1<1)||(u23.l2585<1))"))||("((i2.u1.s1>=1)&&(u23.l3921>=1))"))))))
Formula 0 simplified : !XF(X"((i2.u1.s1<1)||(u23.l3921<1))" & ("((i2.u1.s1>=1)&&(u23.l3921>=1))" | G"((i2.u1.s1<1)||(u23.l2585<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4994674973879526114
[2022-06-11 06:57:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4994674973879526114
Running compilation step : cd /tmp/ltsmin4994674973879526114;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 423 ms.
Running link step : cd /tmp/ltsmin4994674973879526114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4994674973879526114;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&([]((LTLAPp1==true))||!(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 finished in 82877 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2022-06-11 06:57:39] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18428828529572465721
[2022-06-11 06:57:39] [INFO ] Computing symmetric may disable matrix : 1355 transitions.
[2022-06-11 06:57:39] [INFO ] Applying decomposition
[2022-06-11 06:57:39] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:57:39] [INFO ] Computing symmetric may enable matrix : 1355 transitions.
[2022-06-11 06:57:39] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:57:39] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4073002175768683475.txt' '-o' '/tmp/graph4073002175768683475.bin' '-w' '/tmp/graph4073002175768683475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4073002175768683475.bin' '-l' '-1' '-v' '-w' '/tmp/graph4073002175768683475.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:57:39] [INFO ] Decomposing Gal with order
[2022-06-11 06:57:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:57:39] [INFO ] Computing Do-Not-Accords matrix : 1355 transitions.
[2022-06-11 06:57:39] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 06:57:39] [INFO ] Removed a total of 1058 redundant transitions.
[2022-06-11 06:57:39] [INFO ] Built C files in 398ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18428828529572465721
Running compilation step : cd /tmp/ltsmin18428828529572465721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 06:57:39] [INFO ] Flatten gal took : 192 ms
[2022-06-11 06:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 902 labels/synchronizations in 37 ms.
[2022-06-11 06:57:40] [INFO ] Time to serialize gal into /tmp/LTLFireability5178595965067661390.gal : 12 ms
[2022-06-11 06:57:40] [INFO ] Time to serialize properties into /tmp/LTLFireability12525664417491406265.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5178595965067661390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12525664417491406265.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F((G(F(X(F("((u0.s1<1)||(i1.u4.l195<1))")))))&&(X("((u0.s1<1)||(i1.u4.l195<1))")))))
Formula 0 simplified : !F(GFXF"((u0.s1<1)||(i1.u4.l195<1))" & X"((u0.s1<1)||(i1.u4.l195<1))")
Compilation finished in 5134 ms.
Running link step : cd /tmp/ltsmin18428828529572465721;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin18428828529572465721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(X(<>((LTLAPp0==true)))))&&X((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin18428828529572465721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(X(<>((LTLAPp0==true)))))&&X((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18428828529572465721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp1==true))&&([]((LTLAPp2==true))||!(LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 07:19:38] [INFO ] Flatten gal took : 99 ms
[2022-06-11 07:19:38] [INFO ] Time to serialize gal into /tmp/LTLFireability15052554838750746949.gal : 22 ms
[2022-06-11 07:19:38] [INFO ] Time to serialize properties into /tmp/LTLFireability2210396136157675384.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15052554838750746949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2210396136157675384.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 3 LTL properties
Checking formula 0 : !((F((G(F(X(F("((s1<1)||(l195<1))")))))&&(X("((s1<1)||(l195<1))")))))
Formula 0 simplified : !F(GFXF"((s1<1)||(l195<1))" & X"((s1<1)||(l195<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t30, t31, t32, t33, t34, t46, t47, t48, t49, t50, t74, t75, t76,...6171
Computing Next relation with stutter on 9.16493e+11 deadlock states
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin18428828529572465721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp1==true))&&([]((LTLAPp2==true))||!(LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18428828529572465721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp3==true))&&<>([]((LTLAPp4==true)))))' '--buchi-type=spotba'
207 unique states visited
0 strongly connected components in search stack
208 transitions explored
104 items max in DFS search stack
57599 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,576.104,4030964,1,0,1019,8.32792e+06,22,390,7337,8.36166e+06,201
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(F((X("((s1<1)||(l3921<1))"))&&((G("((s1<1)||(l2585<1))"))||("((s1>=1)&&(l3921>=1))"))))))
Formula 1 simplified : !XF(X"((s1<1)||(l3921<1))" & ("((s1>=1)&&(l3921>=1))" | G"((s1<1)||(l2585<1))"))
Detected timeout of ITS tools.
[2022-06-11 07:41:37] [INFO ] Flatten gal took : 122 ms
[2022-06-11 07:41:37] [INFO ] Input system was already deterministic with 1355 transitions.
[2022-06-11 07:41:37] [INFO ] Transformed 335 places.
[2022-06-11 07:41:37] [INFO ] Transformed 1355 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-11 07:41:37] [INFO ] Time to serialize gal into /tmp/LTLFireability8216824939853271462.gal : 12 ms
[2022-06-11 07:41:37] [INFO ] Time to serialize properties into /tmp/LTLFireability11872361213938855118.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8216824939853271462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11872361213938855118.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F((X("((s1<1)||(l3921<1))"))&&((G("((s1<1)||(l2585<1))"))||("((s1>=1)&&(l3921>=1))"))))))
Formula 0 simplified : !XF(X"((s1<1)||(l3921<1))" & ("((s1>=1)&&(l3921>=1))" | G"((s1<1)||(l2585<1))"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d1m020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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