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-165472282700788.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-d1m160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282700788
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Jun 7 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 7 17:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 17:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Jun 7 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 7 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:52 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-d1m160-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654936410749

Running Version 202205111006
[2022-06-11 08:33:31] [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 08:33:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 08:33:32] [INFO ] Load time of PNML (sax parser for PT used): 557 ms
[2022-06-11 08:33:32] [INFO ] Transformed 6690 places.
[2022-06-11 08:33:32] [INFO ] Transformed 11934 transitions.
[2022-06-11 08:33:32] [INFO ] Parsed PT model containing 6690 places and 11934 transitions in 714 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4305 places in 40 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 1086 places :
Symmetric choice reduction at 1 with 1086 rule applications. Total rules 1205 place count 1282 transition count 7341
Iterating global reduction 1 with 1086 rules applied. Total rules applied 2291 place count 1282 transition count 7341
Ensure Unique test removed 291 transitions
Reduce isomorphic transitions removed 291 transitions.
Iterating post reduction 1 with 291 rules applied. Total rules applied 2582 place count 1282 transition count 7050
Discarding 889 places :
Symmetric choice reduction at 2 with 889 rule applications. Total rules 3471 place count 393 transition count 6161
Iterating global reduction 2 with 889 rules applied. Total rules applied 4360 place count 393 transition count 6161
Ensure Unique test removed 4718 transitions
Reduce isomorphic transitions removed 4718 transitions.
Iterating post reduction 2 with 4718 rules applied. Total rules applied 9078 place count 393 transition count 1443
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 9148 place count 323 transition count 1373
Iterating global reduction 3 with 70 rules applied. Total rules applied 9218 place count 323 transition count 1373
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Iterating post reduction 3 with 167 rules applied. Total rules applied 9385 place count 323 transition count 1206
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9393 place count 315 transition count 1198
Iterating global reduction 4 with 8 rules applied. Total rules applied 9401 place count 315 transition count 1198
Applied a total of 9401 rules in 385 ms. Remains 315 /2385 variables (removed 2070) and now considering 1198/11934 (removed 10736) transitions.
// Phase 1: matrix 1198 rows 315 cols
[2022-06-11 08:33:33] [INFO ] Computed 3 place invariants in 38 ms
[2022-06-11 08:33:33] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 1198 rows 315 cols
[2022-06-11 08:33:33] [INFO ] Computed 3 place invariants in 19 ms
[2022-06-11 08:33:33] [INFO ] State equation strengthened by 913 read => feed constraints.
[2022-06-11 08:33:35] [INFO ] Implicit Places using invariants and state equation in 2023 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
// Phase 1: matrix 1198 rows 315 cols
[2022-06-11 08:33:35] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-11 08:33:35] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 315/2385 places, 1198/11934 transitions.
Finished structural reductions, in 1 iterations. Remains : 315/2385 places, 1198/11934 transitions.
Support contains 27 out of 315 places after structural reductions.
[2022-06-11 08:33:36] [INFO ] Flatten gal took : 102 ms
[2022-06-11 08:33:36] [INFO ] Flatten gal took : 69 ms
[2022-06-11 08:33:36] [INFO ] Input system was already deterministic with 1198 transitions.
Support contains 24 out of 315 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1731 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10001 steps, including 189 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1198 rows 315 cols
[2022-06-11 08:33:37] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 08:33:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 08:33:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 08:33:37] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-11 08:33:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 08:33:37] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 08:33:37] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-06-11 08:33:38] [INFO ] State equation strengthened by 913 read => feed constraints.
[2022-06-11 08:33:38] [INFO ] After 227ms SMT Verify possible using 913 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-06-11 08:33:38] [INFO ] Deduced a trap composed of 109 places in 81 ms of which 4 ms to minimize.
[2022-06-11 08:33:38] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2022-06-11 08:33:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 236 ms
[2022-06-11 08:33:38] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2022-06-11 08:33:38] [INFO ] After 1112ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 72 stabilizing places and 496 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p0) U p0))||F(p1))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 561
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 561
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 294 transition count 557
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 84 place count 256 transition count 519
Iterating global reduction 1 with 38 rules applied. Total rules applied 122 place count 256 transition count 519
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 163 place count 256 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 227 place count 192 transition count 414
Iterating global reduction 2 with 64 rules applied. Total rules applied 291 place count 192 transition count 414
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 379 place count 192 transition count 326
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 380 place count 191 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 381 place count 191 transition count 313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 382 place count 190 transition count 312
Iterating global reduction 3 with 1 rules applied. Total rules applied 383 place count 190 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 384 place count 190 transition count 311
Applied a total of 384 rules in 38 ms. Remains 190 /315 variables (removed 125) and now considering 311/1198 (removed 887) transitions.
// Phase 1: matrix 311 rows 190 cols
[2022-06-11 08:33:38] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:33:39] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 311 rows 190 cols
[2022-06-11 08:33:39] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:33:39] [INFO ] State equation strengthened by 133 read => feed constraints.
[2022-06-11 08:33:39] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
// Phase 1: matrix 311 rows 190 cols
[2022-06-11 08:33:39] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:33:39] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/315 places, 311/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/315 places, 311/1198 transitions.
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s157 1)), p0:(AND (GEQ s1 1) (GEQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 506 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-00 finished in 2284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(X(p0))||p0))&&X(X(p1))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 569
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 569
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 294 transition count 563
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 86 place count 256 transition count 525
Iterating global reduction 1 with 38 rules applied. Total rules applied 124 place count 256 transition count 525
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 167 place count 256 transition count 482
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 231 place count 192 transition count 418
Iterating global reduction 2 with 64 rules applied. Total rules applied 295 place count 192 transition count 418
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 387 place count 192 transition count 326
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 388 place count 191 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 389 place count 191 transition count 313
Applied a total of 389 rules in 34 ms. Remains 191 /315 variables (removed 124) and now considering 313/1198 (removed 885) transitions.
// Phase 1: matrix 313 rows 191 cols
[2022-06-11 08:33:41] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:33:41] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 313 rows 191 cols
[2022-06-11 08:33:41] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:33:41] [INFO ] State equation strengthened by 134 read => feed constraints.
[2022-06-11 08:33:41] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
// Phase 1: matrix 313 rows 191 cols
[2022-06-11 08:33:41] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:33:41] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/315 places, 313/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/315 places, 313/1198 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s159 1)), p1:(OR (LT s1 1) (LT s158 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-01 finished in 986 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 293 transition count 526
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 293 transition count 526
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 293 transition count 522
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 87 place count 254 transition count 483
Iterating global reduction 1 with 39 rules applied. Total rules applied 126 place count 254 transition count 483
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 161 place count 254 transition count 448
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 229 place count 186 transition count 380
Iterating global reduction 2 with 68 rules applied. Total rules applied 297 place count 186 transition count 380
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 381 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 383 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 385 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 386 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 387 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 388 place count 183 transition count 268
Applied a total of 388 rules in 22 ms. Remains 183 /315 variables (removed 132) and now considering 268/1198 (removed 930) transitions.
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:33:42] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 08:33:42] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:33:42] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 08:33:42] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 08:33:42] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:33:42] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 08:33:42] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/315 places, 268/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/315 places, 268/1198 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s150 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 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-02 finished in 890 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(F(!(F(!p1) U p2)))||p0)))&&X(p3)))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 561
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 561
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 294 transition count 557
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 84 place count 256 transition count 519
Iterating global reduction 1 with 38 rules applied. Total rules applied 122 place count 256 transition count 519
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 163 place count 256 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 227 place count 192 transition count 414
Iterating global reduction 2 with 64 rules applied. Total rules applied 291 place count 192 transition count 414
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 387 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 388 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 389 place count 191 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 390 place count 190 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 190 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 395 place count 186 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 399 place count 186 transition count 300
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 419 place count 186 transition count 280
Applied a total of 419 rules in 30 ms. Remains 186 /315 variables (removed 129) and now considering 280/1198 (removed 918) transitions.
// Phase 1: matrix 280 rows 186 cols
[2022-06-11 08:33:43] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:33:43] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 280 rows 186 cols
[2022-06-11 08:33:43] [INFO ] Computed 3 place invariants in 17 ms
[2022-06-11 08:33:43] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-06-11 08:33:43] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
// Phase 1: matrix 280 rows 186 cols
[2022-06-11 08:33:43] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:33:43] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/315 places, 280/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/315 places, 280/1198 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p3) (AND (NOT p0) p2)), (OR (NOT p3) (AND (NOT p0) p2)), true, p2, p2, (AND (NOT p0) p2), (AND (NOT p1) p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p3 (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p3 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p2), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s154 1)), p0:(OR (LT s1 1) (LT s154 1)), p1:(AND (GEQ s1 1) (GEQ s153 1)), p2:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, 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-d1m160-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-03 finished in 1118 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(G((X(p0)||p0)) U G(p0)))))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 293 transition count 526
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 293 transition count 526
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 293 transition count 522
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 87 place count 254 transition count 483
Iterating global reduction 1 with 39 rules applied. Total rules applied 126 place count 254 transition count 483
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 161 place count 254 transition count 448
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 229 place count 186 transition count 380
Iterating global reduction 2 with 68 rules applied. Total rules applied 297 place count 186 transition count 380
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 381 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 383 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 385 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 386 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 387 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 388 place count 183 transition count 268
Applied a total of 388 rules in 79 ms. Remains 183 /315 variables (removed 132) and now considering 268/1198 (removed 930) transitions.
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:33:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:33:44] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:33:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:33:44] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 08:33:44] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2022-06-11 08:33:44] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:33:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:33:45] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/315 places, 268/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/315 places, 268/1198 transitions.
Stuttering acceptance computed with spot in 188 ms :[p0, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s150 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 20677 reset in 267 ms.
Product exploration explored 100000 steps with 20511 reset in 236 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 51 ms :[p0, p0]
Finished random walk after 158 steps, including 34 resets, run visited all 1 properties in 3 ms. (steps per millisecond=52 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 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 64 ms :[p0, p0]
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 268/268 transitions.
Applied a total of 0 rules in 18 ms. Remains 183 /183 variables (removed 0) and now considering 268/268 (removed 0) transitions.
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:33:46] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:33:46] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:33:46] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 08:33:46] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 08:33:46] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2022-06-11 08:33:46] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:33:46] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:33:46] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 268/268 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Finished random walk after 1076 steps, including 231 resets, run visited all 1 properties in 3 ms. (steps per millisecond=358 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 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 56 ms :[p0, p0]
Stuttering acceptance computed with spot in 52 ms :[p0, p0]
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Product exploration explored 100000 steps with 20621 reset in 205 ms.
Product exploration explored 100000 steps with 20516 reset in 247 ms.
Built C files in :
/tmp/ltsmin16478638740700163495
[2022-06-11 08:33:47] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2022-06-11 08:33:47] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:33:47] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2022-06-11 08:33:47] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:33:47] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2022-06-11 08:33:47] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:33:47] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16478638740700163495
Running compilation step : cd /tmp/ltsmin16478638740700163495;'/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 889 ms.
Running link step : cd /tmp/ltsmin16478638740700163495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16478638740700163495;'/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/stateBased17812833762473898209.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 268/268 transitions.
Applied a total of 0 rules in 18 ms. Remains 183 /183 variables (removed 0) and now considering 268/268 (removed 0) transitions.
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:34:03] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:34:03] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:34:03] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 08:34:03] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 08:34:03] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2022-06-11 08:34:03] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:34:03] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 08:34:03] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 268/268 transitions.
Built C files in :
/tmp/ltsmin15515444305479672836
[2022-06-11 08:34:03] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2022-06-11 08:34:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:34:03] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2022-06-11 08:34:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:34:03] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2022-06-11 08:34:03] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:34:03] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15515444305479672836
Running compilation step : cd /tmp/ltsmin15515444305479672836;'/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 575 ms.
Running link step : cd /tmp/ltsmin15515444305479672836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15515444305479672836;'/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/stateBased11671492062217993577.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 08:34:19] [INFO ] Flatten gal took : 14 ms
[2022-06-11 08:34:19] [INFO ] Flatten gal took : 13 ms
[2022-06-11 08:34:19] [INFO ] Time to serialize gal into /tmp/LTL5669519236124997013.gal : 2 ms
[2022-06-11 08:34:19] [INFO ] Time to serialize properties into /tmp/LTL7271211492708633474.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/LTL5669519236124997013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7271211492708633474.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/LTL5669519...266
Read 1 LTL properties
Checking formula 0 : !((F(G(!((G((X("((s1>=1)&&(l3912>=1))"))||("((s1>=1)&&(l3912>=1))")))U(G("((s1>=1)&&(l3912>=1))")))))))
Formula 0 simplified : !FG!(G("((s1>=1)&&(l3912>=1))" | X"((s1>=1)&&(l3912>=1))") U G"((s1>=1)&&(l3912>=1))")
Detected timeout of ITS tools.
[2022-06-11 08:34:34] [INFO ] Flatten gal took : 12 ms
[2022-06-11 08:34:34] [INFO ] Applying decomposition
[2022-06-11 08:34:34] [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/graph14255264845377219607.txt' '-o' '/tmp/graph14255264845377219607.bin' '-w' '/tmp/graph14255264845377219607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14255264845377219607.bin' '-l' '-1' '-v' '-w' '/tmp/graph14255264845377219607.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:34:34] [INFO ] Decomposing Gal with order
[2022-06-11 08:34:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:34:34] [INFO ] Removed a total of 256 redundant transitions.
[2022-06-11 08:34:34] [INFO ] Flatten gal took : 71 ms
[2022-06-11 08:34:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 12 ms.
[2022-06-11 08:34:34] [INFO ] Time to serialize gal into /tmp/LTL15787981563259837695.gal : 5 ms
[2022-06-11 08:34:34] [INFO ] Time to serialize properties into /tmp/LTL13360168582390755010.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/LTL15787981563259837695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13360168582390755010.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/LTL1578798...247
Read 1 LTL properties
Checking formula 0 : !((F(G(!((G((X("((i3.i0.u0.s1>=1)&&(u5.l3912>=1))"))||("((i3.i0.u0.s1>=1)&&(u5.l3912>=1))")))U(G("((i3.i0.u0.s1>=1)&&(u5.l3912>=1))"))...160
Formula 0 simplified : !FG!(G("((i3.i0.u0.s1>=1)&&(u5.l3912>=1))" | X"((i3.i0.u0.s1>=1)&&(u5.l3912>=1))") U G"((i3.i0.u0.s1>=1)&&(u5.l3912>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13191981581362233233
[2022-06-11 08:34:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13191981581362233233
Running compilation step : cd /tmp/ltsmin13191981581362233233;'/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 378 ms.
Running link step : cd /tmp/ltsmin13191981581362233233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13191981581362233233;'/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))||(LTLAPp0==true))) U []((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-04 finished in 80307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U !p0)))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 561
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 561
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 294 transition count 557
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 84 place count 256 transition count 519
Iterating global reduction 1 with 38 rules applied. Total rules applied 122 place count 256 transition count 519
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 163 place count 256 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 227 place count 192 transition count 414
Iterating global reduction 2 with 64 rules applied. Total rules applied 291 place count 192 transition count 414
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 383 place count 192 transition count 322
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 384 place count 191 transition count 309
Iterating global reduction 3 with 1 rules applied. Total rules applied 385 place count 191 transition count 309
Applied a total of 385 rules in 45 ms. Remains 191 /315 variables (removed 124) and now considering 309/1198 (removed 889) transitions.
// Phase 1: matrix 309 rows 191 cols
[2022-06-11 08:35:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 08:35:04] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 309 rows 191 cols
[2022-06-11 08:35:04] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 08:35:04] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-06-11 08:35:05] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2022-06-11 08:35:05] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 309 rows 191 cols
[2022-06-11 08:35:05] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:35:05] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 191/315 places, 309/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/315 places, 309/1198 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, false, (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s159 1)), p1:(AND (GEQ s1 1) (GEQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1778 steps with 331 reset in 8 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-05 finished in 1009 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(!(false U p0)))))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 293 transition count 518
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 293 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 293 transition count 516
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 85 place count 254 transition count 477
Iterating global reduction 1 with 39 rules applied. Total rules applied 124 place count 254 transition count 477
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 157 place count 254 transition count 444
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 225 place count 186 transition count 376
Iterating global reduction 2 with 68 rules applied. Total rules applied 293 place count 186 transition count 376
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 373 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 375 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 377 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 378 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 379 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 380 place count 183 transition count 268
Applied a total of 380 rules in 17 ms. Remains 183 /315 variables (removed 132) and now considering 268/1198 (removed 930) transitions.
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:35:05] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 08:35:05] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:35:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 08:35:05] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 08:35:06] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 183 cols
[2022-06-11 08:35:06] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 08:35:06] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/315 places, 268/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/315 places, 268/1198 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s151 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-07 finished in 1415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 561
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 561
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 294 transition count 557
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 84 place count 256 transition count 519
Iterating global reduction 1 with 38 rules applied. Total rules applied 122 place count 256 transition count 519
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 163 place count 256 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 227 place count 192 transition count 414
Iterating global reduction 2 with 64 rules applied. Total rules applied 291 place count 192 transition count 414
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 383 place count 192 transition count 322
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 384 place count 191 transition count 309
Iterating global reduction 3 with 1 rules applied. Total rules applied 385 place count 191 transition count 309
Applied a total of 385 rules in 49 ms. Remains 191 /315 variables (removed 124) and now considering 309/1198 (removed 889) transitions.
// Phase 1: matrix 309 rows 191 cols
[2022-06-11 08:35:06] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:35:07] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 309 rows 191 cols
[2022-06-11 08:35:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:35:07] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-06-11 08:35:07] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2022-06-11 08:35:07] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 309 rows 191 cols
[2022-06-11 08:35:07] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 08:35:07] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 191/315 places, 309/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/315 places, 309/1198 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s159 1)), p0:(AND (GEQ s1 1) (GEQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-08 finished in 904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U p1))) U X(G(p1))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 553
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 553
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 294 transition count 551
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 82 place count 256 transition count 513
Iterating global reduction 1 with 38 rules applied. Total rules applied 120 place count 256 transition count 513
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 159 place count 256 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 223 place count 192 transition count 410
Iterating global reduction 2 with 64 rules applied. Total rules applied 287 place count 192 transition count 410
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 379 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 380 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 381 place count 191 transition count 305
Applied a total of 381 rules in 27 ms. Remains 191 /315 variables (removed 124) and now considering 305/1198 (removed 893) transitions.
// Phase 1: matrix 305 rows 191 cols
[2022-06-11 08:35:07] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 08:35:07] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 305 rows 191 cols
[2022-06-11 08:35:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:35:08] [INFO ] State equation strengthened by 126 read => feed constraints.
[2022-06-11 08:35:08] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
// Phase 1: matrix 305 rows 191 cols
[2022-06-11 08:35:08] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 08:35:08] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/315 places, 305/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/315 places, 305/1198 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s159 1)), p0:(AND (GEQ s1 1) (GEQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-10 finished in 920 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(!X(G(p0))))) U p0))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 293 transition count 484
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 293 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 293 transition count 483
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 85 place count 253 transition count 443
Iterating global reduction 1 with 40 rules applied. Total rules applied 125 place count 253 transition count 443
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 152 place count 253 transition count 416
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 224 place count 181 transition count 344
Iterating global reduction 2 with 72 rules applied. Total rules applied 296 place count 181 transition count 344
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 364 place count 181 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 366 place count 179 transition count 250
Iterating global reduction 3 with 2 rules applied. Total rules applied 368 place count 179 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 178 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 178 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 178 transition count 248
Applied a total of 371 rules in 54 ms. Remains 178 /315 variables (removed 137) and now considering 248/1198 (removed 950) transitions.
// Phase 1: matrix 248 rows 178 cols
[2022-06-11 08:35:08] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:35:08] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 248 rows 178 cols
[2022-06-11 08:35:08] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:35:08] [INFO ] State equation strengthened by 79 read => feed constraints.
[2022-06-11 08:35:09] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2022-06-11 08:35:09] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 248 rows 178 cols
[2022-06-11 08:35:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 08:35:09] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 178/315 places, 248/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 178/315 places, 248/1198 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), p0, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 3 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-12 finished in 872 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((F(p1)||G(F(G(p2)))))))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 295 transition count 562
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 295 transition count 562
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 295 transition count 558
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 277 transition count 540
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 277 transition count 540
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 277 transition count 537
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 163 place count 197 transition count 457
Iterating global reduction 2 with 80 rules applied. Total rules applied 243 place count 197 transition count 457
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 2 with 115 rules applied. Total rules applied 358 place count 197 transition count 342
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 359 place count 196 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 360 place count 196 transition count 327
Applied a total of 360 rules in 22 ms. Remains 196 /315 variables (removed 119) and now considering 327/1198 (removed 871) transitions.
// Phase 1: matrix 327 rows 196 cols
[2022-06-11 08:35:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:35:09] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 327 rows 196 cols
[2022-06-11 08:35:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 08:35:09] [INFO ] State equation strengthened by 144 read => feed constraints.
[2022-06-11 08:35:10] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
// Phase 1: matrix 327 rows 196 cols
[2022-06-11 08:35:10] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 08:35:10] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/315 places, 327/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/315 places, 327/1198 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s166 1)), p2:(AND (GEQ s1 1) (GEQ s166 1) (GEQ s1 1) (GEQ s162 1)), p1:(AND (GEQ s1 1) (GEQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-14 finished in 1032 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p0))||F(X(G(p1)))))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 1198/1198 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 519
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 294 transition count 518
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 82 place count 255 transition count 479
Iterating global reduction 1 with 39 rules applied. Total rules applied 121 place count 255 transition count 479
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 154 place count 255 transition count 446
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 222 place count 187 transition count 378
Iterating global reduction 2 with 68 rules applied. Total rules applied 290 place count 187 transition count 378
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 366 place count 187 transition count 302
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 367 place count 186 transition count 289
Iterating global reduction 3 with 1 rules applied. Total rules applied 368 place count 186 transition count 289
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 185 transition count 288
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 185 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 185 transition count 287
Applied a total of 371 rules in 22 ms. Remains 185 /315 variables (removed 130) and now considering 287/1198 (removed 911) transitions.
// Phase 1: matrix 287 rows 185 cols
[2022-06-11 08:35:10] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 08:35:10] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 287 rows 185 cols
[2022-06-11 08:35:10] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 08:35:10] [INFO ] State equation strengthened by 113 read => feed constraints.
[2022-06-11 08:35:11] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
// Phase 1: matrix 287 rows 185 cols
[2022-06-11 08:35:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 08:35:11] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/315 places, 287/1198 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/315 places, 287/1198 transitions.
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s101 1)), p0:(OR (LT s1 1) (LT s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 246 ms.
Product exploration explored 100000 steps with 33333 reset in 236 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-15 finished in 1820 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(G((X(p0)||p0)) U G(p0)))))'
[2022-06-11 08:35:12] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9552222328217653160
[2022-06-11 08:35:12] [INFO ] Applying decomposition
[2022-06-11 08:35:12] [INFO ] Computing symmetric may disable matrix : 1198 transitions.
[2022-06-11 08:35:12] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:35:12] [INFO ] Computing symmetric may enable matrix : 1198 transitions.
[2022-06-11 08:35:12] [INFO ] Flatten gal took : 42 ms
[2022-06-11 08:35:12] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph7402997328033844195.txt' '-o' '/tmp/graph7402997328033844195.bin' '-w' '/tmp/graph7402997328033844195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7402997328033844195.bin' '-l' '-1' '-v' '-w' '/tmp/graph7402997328033844195.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:35:12] [INFO ] Decomposing Gal with order
[2022-06-11 08:35:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:35:12] [INFO ] Computing Do-Not-Accords matrix : 1198 transitions.
[2022-06-11 08:35:12] [INFO ] Removed a total of 1011 redundant transitions.
[2022-06-11 08:35:13] [INFO ] Computation of Completed DNA matrix. took 77 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:35:13] [INFO ] Flatten gal took : 162 ms
[2022-06-11 08:35:13] [INFO ] Built C files in 395ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9552222328217653160
Running compilation step : cd /tmp/ltsmin9552222328217653160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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 08:35:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 667 labels/synchronizations in 29 ms.
[2022-06-11 08:35:13] [INFO ] Time to serialize gal into /tmp/LTLFireability10115295613180611420.gal : 4 ms
[2022-06-11 08:35:13] [INFO ] Time to serialize properties into /tmp/LTLFireability3090078442249061650.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/LTLFireability10115295613180611420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3090078442249061650.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 1 LTL properties
Checking formula 0 : !((F(G(!((G((X("((u0.s1>=1)&&(u0.l3912>=1))"))||("((u0.s1>=1)&&(u0.l3912>=1))")))U(G("((u0.s1>=1)&&(u0.l3912>=1))")))))))
Formula 0 simplified : !FG!(G("((u0.s1>=1)&&(u0.l3912>=1))" | X"((u0.s1>=1)&&(u0.l3912>=1))") U G"((u0.s1>=1)&&(u0.l3912>=1))")
Compilation finished in 4511 ms.
Running link step : cd /tmp/ltsmin9552222328217653160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin9552222328217653160;'/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))||(LTLAPp0==true))) U []((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 08:55:47] [INFO ] Flatten gal took : 103 ms
[2022-06-11 08:55:47] [INFO ] Time to serialize gal into /tmp/LTLFireability12328294550050954397.gal : 5 ms
[2022-06-11 08:55:47] [INFO ] Time to serialize properties into /tmp/LTLFireability18167557757310654010.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/LTLFireability12328294550050954397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18167557757310654010.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...290
Read 1 LTL properties
Checking formula 0 : !((F(G(!((G((X("((s1>=1)&&(l3912>=1))"))||("((s1>=1)&&(l3912>=1))")))U(G("((s1>=1)&&(l3912>=1))")))))))
Formula 0 simplified : !FG!(G("((s1>=1)&&(l3912>=1))" | X"((s1>=1)&&(l3912>=1))") U G"((s1>=1)&&(l3912>=1))")
Detected timeout of ITS tools.
[2022-06-11 09:16:21] [INFO ] Flatten gal took : 133 ms
[2022-06-11 09:16:21] [INFO ] Input system was already deterministic with 1198 transitions.
[2022-06-11 09:16:21] [INFO ] Transformed 315 places.
[2022-06-11 09:16:21] [INFO ] Transformed 1198 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 09:16:21] [INFO ] Time to serialize gal into /tmp/LTLFireability16159529836010207709.gal : 17 ms
[2022-06-11 09:16:21] [INFO ] Time to serialize properties into /tmp/LTLFireability13188148893937225401.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/LTLFireability16159529836010207709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13188148893937225401.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...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(!((G((X("((s1>=1)&&(l3912>=1))"))||("((s1>=1)&&(l3912>=1))")))U(G("((s1>=1)&&(l3912>=1))")))))))
Formula 0 simplified : !FG!(G("((s1>=1)&&(l3912>=1))" | X"((s1>=1)&&(l3912>=1))") U G"((s1>=1)&&(l3912>=1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.085: LTL layer: formula: <>([](!([]((X((LTLAPp0==true))||(LTLAPp0==true))) U []((LTLAPp0==true)))))
pins2lts-mc-linux64( 0/ 8), 0.085: "<>([](!([]((X((LTLAPp0==true))||(LTLAPp0==true))) U []((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.086: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.124: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.129: buchi has 2 states
pins2lts-mc-linux64( 4/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.132: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.143: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.245: DFS-FIFO for weak LTL, using special progress label 1200
pins2lts-mc-linux64( 0/ 8), 0.245: There are 1201 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.245: State length is 316, there are 1201 groups
pins2lts-mc-linux64( 0/ 8), 0.245: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.245: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.245: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.245: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.301: ~1 levels ~960 states ~8320 transitions
pins2lts-mc-linux64( 0/ 8), 0.344: ~4 levels ~1920 states ~6640 transitions
pins2lts-mc-linux64( 0/ 8), 0.390: ~7 levels ~3840 states ~8640 transitions
pins2lts-mc-linux64( 0/ 8), 0.501: ~7 levels ~7680 states ~12168 transitions
pins2lts-mc-linux64( 0/ 8), 0.711: ~7 levels ~15360 states ~24576 transitions
pins2lts-mc-linux64( 0/ 8), 1.149: ~7 levels ~30720 states ~50392 transitions
pins2lts-mc-linux64( 3/ 8), 2.243: ~9 levels ~61440 states ~182176 transitions
pins2lts-mc-linux64( 7/ 8), 3.816: ~9 levels ~122880 states ~306232 transitions
pins2lts-mc-linux64( 0/ 8), 7.303: ~11 levels ~245760 states ~652544 transitions
pins2lts-mc-linux64( 7/ 8), 12.714: ~11 levels ~491520 states ~1053544 transitions
pins2lts-mc-linux64( 2/ 8), 24.744: ~13 levels ~983040 states ~2440496 transitions
pins2lts-mc-linux64( 7/ 8), 45.766: ~13 levels ~1966080 states ~4422112 transitions
pins2lts-mc-linux64( 5/ 8), 90.030: ~15 levels ~3932160 states ~8980784 transitions
pins2lts-mc-linux64( 5/ 8), 176.765: ~15 levels ~7864320 states ~16907352 transitions
pins2lts-mc-linux64( 5/ 8), 342.212: ~17 levels ~15728640 states ~28311312 transitions
pins2lts-mc-linux64( 5/ 8), 692.643: ~19 levels ~31457280 states ~62824536 transitions
pins2lts-mc-linux64( 7/ 8), 1384.907: ~19 levels ~62914560 states ~126518520 transitions
pins2lts-mc-linux64( 1/ 8), 2470.516: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2471.330:
pins2lts-mc-linux64( 0/ 8), 2471.330: mean standard work distribution: 4.9% (states) 19.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 2471.330:
pins2lts-mc-linux64( 0/ 8), 2471.330: Explored 107455791 states 263044025 transitions, fanout: 2.448
pins2lts-mc-linux64( 0/ 8), 2471.330: Total exploration time 2471.060 sec (2470.260 sec minimum, 2470.459 sec on average)
pins2lts-mc-linux64( 0/ 8), 2471.330: States per second: 43486, Transitions per second: 106450
pins2lts-mc-linux64( 0/ 8), 2471.330:
pins2lts-mc-linux64( 0/ 8), 2471.330: Progress states detected: 68424214
pins2lts-mc-linux64( 0/ 8), 2471.330: Redundant explorations: -14.2585
pins2lts-mc-linux64( 0/ 8), 2471.330:
pins2lts-mc-linux64( 0/ 8), 2471.330: Queue width: 8B, total height: 37730914, memory: 287.86MB
pins2lts-mc-linux64( 0/ 8), 2471.330: Tree memory: 1212.2MB, 10.1 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 2471.330: Tree fill ratio (roots/leafs): 93.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2471.330: Stored 1250 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2471.331: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2471.331: Est. total memory use: 1500.0MB (~1311.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9552222328217653160;'/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))||(LTLAPp0==true))) U []((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9552222328217653160;'/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))||(LTLAPp0==true))) U []((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)

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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-d1m160"
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-d1m160, 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-165472282700788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m160.tgz
mv RingSingleMessageInMbox-PT-d1m160 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 ;