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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.5K Jun 7 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Jun 7 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Jun 7 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 7 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 7 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b08-LTLFireability-00
FORMULA_NAME Szymanski-PT-b08-LTLFireability-01
FORMULA_NAME Szymanski-PT-b08-LTLFireability-02
FORMULA_NAME Szymanski-PT-b08-LTLFireability-03
FORMULA_NAME Szymanski-PT-b08-LTLFireability-04
FORMULA_NAME Szymanski-PT-b08-LTLFireability-05
FORMULA_NAME Szymanski-PT-b08-LTLFireability-06
FORMULA_NAME Szymanski-PT-b08-LTLFireability-07
FORMULA_NAME Szymanski-PT-b08-LTLFireability-08
FORMULA_NAME Szymanski-PT-b08-LTLFireability-09
FORMULA_NAME Szymanski-PT-b08-LTLFireability-10
FORMULA_NAME Szymanski-PT-b08-LTLFireability-11
FORMULA_NAME Szymanski-PT-b08-LTLFireability-12
FORMULA_NAME Szymanski-PT-b08-LTLFireability-13
FORMULA_NAME Szymanski-PT-b08-LTLFireability-14
FORMULA_NAME Szymanski-PT-b08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654981289747

Running Version 202205111006
[2022-06-11 21:01:30] [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 21:01:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 21:01:31] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2022-06-11 21:01:31] [INFO ] Transformed 568 places.
[2022-06-11 21:01:31] [INFO ] Transformed 8320 transitions.
[2022-06-11 21:01:31] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 506 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 260 places in 20 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 138 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 21:01:31] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 21:01:31] [INFO ] Computed 1 place invariants in 58 ms
[2022-06-11 21:01:32] [INFO ] Implicit Places using invariants in 726 ms returned []
[2022-06-11 21:01:32] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 21:01:32] [INFO ] Computed 1 place invariants in 34 ms
[2022-06-11 21:01:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:01:37] [INFO ] Implicit Places using invariants and state equation in 5163 ms returned []
Implicit Place search using SMT with State Equation took 5918 ms to find 0 implicit places.
[2022-06-11 21:01:37] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 21:01:37] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:01:39] [INFO ] Dead Transitions using invariants and state equation in 2096 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/308 places, 8064/8064 transitions.
Support contains 50 out of 306 places after structural reductions.
[2022-06-11 21:01:40] [INFO ] Flatten gal took : 463 ms
[2022-06-11 21:01:40] [INFO ] Flatten gal took : 297 ms
[2022-06-11 21:01:41] [INFO ] Input system was already deterministic with 8064 transitions.
Support contains 48 out of 306 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2022-06-11 21:01:42] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 21:01:42] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:01:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:01:46] [INFO ] After 3925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-06-11 21:01:46] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 6 ms returned sat
[2022-06-11 21:01:56] [INFO ] After 10114ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2022-06-11 21:01:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:02:11] [INFO ] After 14507ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :22
[2022-06-11 21:02:11] [INFO ] After 14511ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :22
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 21:02:11] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :22
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 684 ms.
Support contains 39 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 306 transition count 8010
Applied a total of 54 rules in 452 ms. Remains 306 /306 variables (removed 0) and now considering 8010/8064 (removed 54) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8010/8064 transitions.
Incomplete random walk after 10005 steps, including 3 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 79854 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{12=1, 14=1, 17=1, 21=1}
Probabilistic random walk after 79854 steps, saw 61019 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :4
Running SMT prover for 18 properties.
[2022-06-11 21:02:15] [INFO ] Flow matrix only has 2679 transitions (discarded 5331 similar events)
// Phase 1: matrix 2679 rows 306 cols
[2022-06-11 21:02:15] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:02:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:02:20] [INFO ] After 5162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-06-11 21:02:21] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:02:31] [INFO ] After 10600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-06-11 21:02:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:02:45] [INFO ] After 14171ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2022-06-11 21:02:45] [INFO ] After 14173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-11 21:02:45] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 528 ms.
Support contains 29 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8010/8010 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 306 transition count 8007
Applied a total of 3 rules in 263 ms. Remains 306 /306 variables (removed 0) and now considering 8007/8010 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8007/8010 transitions.
Incomplete random walk after 10004 steps, including 3 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 82525 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82525 steps, saw 62941 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 18 properties.
[2022-06-11 21:02:50] [INFO ] Flow matrix only has 2676 transitions (discarded 5331 similar events)
// Phase 1: matrix 2676 rows 306 cols
[2022-06-11 21:02:50] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 21:02:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:02:55] [INFO ] After 5152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-06-11 21:02:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:03:05] [INFO ] After 9721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-06-11 21:03:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:03:14] [INFO ] After 9355ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2022-06-11 21:03:20] [INFO ] After 15063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-11 21:03:20] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 238 ms.
Support contains 29 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8007/8007 transitions.
Applied a total of 0 rules in 201 ms. Remains 306 /306 variables (removed 0) and now considering 8007/8007 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8007/8007 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8007/8007 transitions.
Applied a total of 0 rules in 211 ms. Remains 306 /306 variables (removed 0) and now considering 8007/8007 (removed 0) transitions.
[2022-06-11 21:03:20] [INFO ] Flow matrix only has 2676 transitions (discarded 5331 similar events)
// Phase 1: matrix 2676 rows 306 cols
[2022-06-11 21:03:20] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:03:21] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-06-11 21:03:21] [INFO ] Flow matrix only has 2676 transitions (discarded 5331 similar events)
// Phase 1: matrix 2676 rows 306 cols
[2022-06-11 21:03:21] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:03:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:03:26] [INFO ] Implicit Places using invariants and state equation in 5230 ms returned []
Implicit Place search using SMT with State Equation took 5652 ms to find 0 implicit places.
[2022-06-11 21:03:27] [INFO ] Redundant transitions in 973 ms returned []
[2022-06-11 21:03:27] [INFO ] Flow matrix only has 2676 transitions (discarded 5331 similar events)
// Phase 1: matrix 2676 rows 306 cols
[2022-06-11 21:03:27] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:03:29] [INFO ] Dead Transitions using invariants and state equation in 2257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8007/8007 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 12 stabilizing places and 2432 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(p0) U X((X(G(p0))&&!p1))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 65 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 21:03:30] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 21:03:30] [INFO ] Computed 1 place invariants in 35 ms
[2022-06-11 21:03:30] [INFO ] Implicit Places using invariants in 475 ms returned []
[2022-06-11 21:03:30] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 21:03:30] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 21:03:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:03:36] [INFO ] Implicit Places using invariants and state equation in 6047 ms returned []
Implicit Place search using SMT with State Equation took 6524 ms to find 0 implicit places.
[2022-06-11 21:03:36] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 21:03:36] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:03:38] [INFO ] Dead Transitions using invariants and state equation in 2103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s27 1) (GEQ s305 1)), p0:(AND (GEQ s106 1) (GEQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 944 ms.
Product exploration explored 100000 steps with 33333 reset in 757 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Szymanski-PT-b08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b08-LTLFireability-00 finished in 10982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(p0)))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 165 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:03:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:03:41] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 21:03:41] [INFO ] Implicit Places using invariants in 414 ms returned []
[2022-06-11 21:03:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:03:41] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:03:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:03:48] [INFO ] Implicit Places using invariants and state equation in 6505 ms returned []
Implicit Place search using SMT with State Equation took 6935 ms to find 0 implicit places.
[2022-06-11 21:03:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:03:48] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:03:50] [INFO ] Dead Transitions using invariants and state equation in 2188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-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: 1}]], initial=2, aps=[p0:(OR (LT s54 1) (LT s302 1) (AND (GEQ s79 1) (GEQ s304 1) (OR (LT s28 1) (LT s271 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 704 ms.
Product exploration explored 100000 steps with 33333 reset in 683 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Szymanski-PT-b08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b08-LTLFireability-02 finished in 10897 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 72 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:03:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:03:52] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 21:03:52] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-06-11 21:03:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:03:52] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:03:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:03:59] [INFO ] Implicit Places using invariants and state equation in 6725 ms returned []
Implicit Place search using SMT with State Equation took 7164 ms to find 0 implicit places.
[2022-06-11 21:03:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:03:59] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:04:01] [INFO ] Dead Transitions using invariants and state equation in 2082 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s101 1) (GEQ s283 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]]
Stuttering criterion allowed to conclude after 339 steps with 0 reset in 5 ms.
FORMULA Szymanski-PT-b08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-03 finished in 9415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(X(p0)))&&F(X(X(!(!p1 U p2))))))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 59 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:04:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:04:01] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 21:04:01] [INFO ] Implicit Places using invariants in 420 ms returned []
[2022-06-11 21:04:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:04:01] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:04:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:04:10] [INFO ] Implicit Places using invariants and state equation in 8312 ms returned []
Implicit Place search using SMT with State Equation took 8736 ms to find 0 implicit places.
[2022-06-11 21:04:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:04:10] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:04:12] [INFO ] Dead Transitions using invariants and state equation in 2014 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 537 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=true, acceptance={} source=4 dest: 6}, { cond=(OR (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 7}, { cond=p2, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s99 1) (LT s298 1)), p1:(AND (GEQ s91 1) (GEQ s297 1)), p2:(AND (GEQ s20 1) (GEQ s269 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 460 ms.
Product exploration explored 100000 steps with 19 reset in 569 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 8 states, 12 edges and 3 AP to 8 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-11 21:04:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:04:14] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:04:14] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:04:16] [INFO ] After 1930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 21:04:16] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:04:18] [INFO ] After 1665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 21:04:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:04:19] [INFO ] After 1523ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 21:04:20] [INFO ] After 1881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 442 ms.
[2022-06-11 21:04:20] [INFO ] After 4064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 212 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 157454 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157454 steps, saw 106789 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 21:04:23] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:04:23] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:04:23] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:04:25] [INFO ] After 1599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 21:04:25] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:04:27] [INFO ] After 1702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 21:04:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:04:37] [INFO ] After 10288ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 21:04:37] [INFO ] After 10511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 636 ms.
[2022-06-11 21:04:38] [INFO ] After 12932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 202 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2022-06-11 21:04:38] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:04:38] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 21:04:39] [INFO ] Implicit Places using invariants in 445 ms returned []
[2022-06-11 21:04:39] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:04:39] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:04:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:04:45] [INFO ] Implicit Places using invariants and state equation in 6040 ms returned []
Implicit Place search using SMT with State Equation took 6489 ms to find 0 implicit places.
[2022-06-11 21:04:46] [INFO ] Redundant transitions in 861 ms returned []
[2022-06-11 21:04:46] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:04:46] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 21:04:48] [INFO ] Dead Transitions using invariants and state equation in 1891 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4552 edges and 305 vertex of which 14 / 305 are part of one of the 6 SCC in 5 ms
Free SCC test removed 8 places
Drop transitions removed 1472 transitions
Ensure Unique test removed 3748 transitions
Reduce isomorphic transitions removed 5220 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 297 transition count 2588
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 294 transition count 2588
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 7 place count 294 transition count 2584
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 290 transition count 2584
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 287 transition count 2581
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 287 transition count 2579
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 287 transition count 2577
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 285 transition count 2577
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 285 transition count 2575
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 283 transition count 2575
Applied a total of 31 rules in 269 ms. Remains 283 /305 variables (removed 22) and now considering 2575/7811 (removed 5236) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2575 rows 283 cols
[2022-06-11 21:04:48] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 21:04:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:04:49] [INFO ] After 1400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 21:04:49] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:04:51] [INFO ] After 1749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 21:04:52] [INFO ] After 2508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 403 ms.
[2022-06-11 21:04:52] [INFO ] After 2977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 8 states, 12 edges and 3 AP to 8 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 36 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:04:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:04:53] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 21:04:54] [INFO ] Implicit Places using invariants in 462 ms returned []
[2022-06-11 21:04:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:04:54] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 21:04:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:05:01] [INFO ] Implicit Places using invariants and state equation in 7156 ms returned []
Implicit Place search using SMT with State Equation took 7622 ms to find 0 implicit places.
[2022-06-11 21:05:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:05:01] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:05:03] [INFO ] Dead Transitions using invariants and state equation in 2090 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 773 ms. Reduced automaton from 8 states, 12 edges and 3 AP to 8 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 96629 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96629 steps, saw 71816 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 21:05:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:05:07] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 21:05:07] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:05:07] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 21:05:07] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:05:12] [INFO ] After 4979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 21:05:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:05:17] [INFO ] After 4636ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 21:05:20] [INFO ] After 7445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2829 ms.
[2022-06-11 21:05:23] [INFO ] After 15351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 47 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 213 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 117229 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117229 steps, saw 75032 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 21:05:26] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:05:26] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 21:05:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:05:26] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 21:05:26] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:05:32] [INFO ] After 5366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 21:05:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:05:39] [INFO ] After 7644ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 21:05:40] [INFO ] Deduced a trap composed of 45 places in 412 ms of which 1 ms to minimize.
[2022-06-11 21:05:40] [INFO ] Deduced a trap composed of 74 places in 258 ms of which 1 ms to minimize.
[2022-06-11 21:05:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 857 ms
[2022-06-11 21:05:42] [INFO ] Deduced a trap composed of 134 places in 223 ms of which 0 ms to minimize.
[2022-06-11 21:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2022-06-11 21:05:44] [INFO ] After 12519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1508 ms.
[2022-06-11 21:05:46] [INFO ] After 19495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 52 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 214 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2022-06-11 21:05:46] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:05:46] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:05:47] [INFO ] Implicit Places using invariants in 454 ms returned []
[2022-06-11 21:05:47] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:05:47] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:05:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:05:53] [INFO ] Implicit Places using invariants and state equation in 6648 ms returned []
Implicit Place search using SMT with State Equation took 7103 ms to find 0 implicit places.
[2022-06-11 21:05:54] [INFO ] Redundant transitions in 666 ms returned []
[2022-06-11 21:05:54] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:05:54] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:05:56] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4552 edges and 305 vertex of which 14 / 305 are part of one of the 6 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 1472 transitions
Ensure Unique test removed 3748 transitions
Reduce isomorphic transitions removed 5220 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 297 transition count 2588
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 294 transition count 2588
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 7 place count 294 transition count 2584
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 290 transition count 2584
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 287 transition count 2581
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 287 transition count 2579
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 287 transition count 2577
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 285 transition count 2577
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 285 transition count 2575
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 283 transition count 2575
Applied a total of 31 rules in 200 ms. Remains 283 /305 variables (removed 22) and now considering 2575/7811 (removed 5236) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2575 rows 283 cols
[2022-06-11 21:05:56] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:05:56] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:05:56] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 21:05:56] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:06:00] [INFO ] After 3915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 21:06:03] [INFO ] After 6588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2628 ms.
[2022-06-11 21:06:06] [INFO ] After 9302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 8 states, 12 edges and 3 AP to 8 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Stuttering acceptance computed with spot in 605 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Product exploration explored 100000 steps with 8 reset in 417 ms.
Product exploration explored 100000 steps with 2 reset in 449 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 441 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:06:09] [INFO ] Redundant transitions in 664 ms returned []
[2022-06-11 21:06:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:06:10] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:06:12] [INFO ] Dead Transitions using invariants and state equation in 2098 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Product exploration explored 100000 steps with 22 reset in 568 ms.
Product exploration explored 100000 steps with 49 reset in 575 ms.
Built C files in :
/tmp/ltsmin13846198429361324798
[2022-06-11 21:06:13] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13846198429361324798
Running compilation step : cd /tmp/ltsmin13846198429361324798;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13846198429361324798;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13846198429361324798;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:06:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:06:16] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 21:06:17] [INFO ] Implicit Places using invariants in 575 ms returned []
[2022-06-11 21:06:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:06:17] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 21:06:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:06:23] [INFO ] Implicit Places using invariants and state equation in 6884 ms returned []
Implicit Place search using SMT with State Equation took 7468 ms to find 0 implicit places.
[2022-06-11 21:06:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:06:23] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 21:06:25] [INFO ] Dead Transitions using invariants and state equation in 2058 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin12990843266660980810
[2022-06-11 21:06:26] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12990843266660980810
Running compilation step : cd /tmp/ltsmin12990843266660980810;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12990843266660980810;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12990843266660980810;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 21:06:29] [INFO ] Flatten gal took : 421 ms
[2022-06-11 21:06:30] [INFO ] Flatten gal took : 268 ms
[2022-06-11 21:06:30] [INFO ] Time to serialize gal into /tmp/LTL8698252631117253949.gal : 49 ms
[2022-06-11 21:06:30] [INFO ] Time to serialize properties into /tmp/LTL11103740621660087908.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/LTL8698252631117253949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11103740621660087908.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/LTL8698252...267
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(X("((p99<1)||(l44<1))"))))&&(F(X(X(!((!("((p91>=1)&&(l43>=1))"))U("((p20>=1)&&(l13>=1))"))))))))))
Formula 0 simplified : !XX(GFX"((p99<1)||(l44<1))" & FXX!(!"((p91>=1)&&(l43>=1))" U "((p20>=1)&&(l13>=1))"))
Detected timeout of ITS tools.
[2022-06-11 21:06:45] [INFO ] Flatten gal took : 243 ms
[2022-06-11 21:06:45] [INFO ] Applying decomposition
[2022-06-11 21:06:45] [INFO ] Flatten gal took : 248 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/graph1865690938709855318.txt' '-o' '/tmp/graph1865690938709855318.bin' '-w' '/tmp/graph1865690938709855318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1865690938709855318.bin' '-l' '-1' '-v' '-w' '/tmp/graph1865690938709855318.weights' '-q' '0' '-e' '0.001'
[2022-06-11 21:06:46] [INFO ] Decomposing Gal with order
[2022-06-11 21:06:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 21:06:47] [INFO ] Removed a total of 18174 redundant transitions.
[2022-06-11 21:06:47] [INFO ] Flatten gal took : 716 ms
[2022-06-11 21:06:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1100 labels/synchronizations in 328 ms.
[2022-06-11 21:06:47] [INFO ] Time to serialize gal into /tmp/LTL15794071044495999223.gal : 39 ms
[2022-06-11 21:06:48] [INFO ] Time to serialize properties into /tmp/LTL15065295169971887406.ltl : 739 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/LTL15794071044495999223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15065295169971887406.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/LTL1579407...247
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(X("((i9.u33.p99<1)||(i2.i1.u60.l44<1))"))))&&(F(X(X(!((!("((i8.i0.u30.p91>=1)&&(i2.i1.u60.l43>=1))"))U("((u50.p20>=1)&&(u5...176
Formula 0 simplified : !XX(GFX"((i9.u33.p99<1)||(i2.i1.u60.l44<1))" & FXX!(!"((i8.i0.u30.p91>=1)&&(i2.i1.u60.l43>=1))" U "((u50.p20>=1)&&(u50.l13>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12745742229952065027
[2022-06-11 21:07:03] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12745742229952065027
Running compilation step : cd /tmp/ltsmin12745742229952065027;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12745742229952065027;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12745742229952065027;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b08-LTLFireability-04 finished in 185366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p0||G(F(p1))))||p0))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 74 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:07:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:06] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 21:07:07] [INFO ] Implicit Places using invariants in 495 ms returned []
[2022-06-11 21:07:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:07] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 21:07:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:07:14] [INFO ] Implicit Places using invariants and state equation in 6880 ms returned []
Implicit Place search using SMT with State Equation took 7381 ms to find 0 implicit places.
[2022-06-11 21:07:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:14] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:07:16] [INFO ] Dead Transitions using invariants and state equation in 2079 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s107 1) (GEQ s296 1)), p1:(AND (GEQ s101 1) (GEQ s269 1))], nbAcceptance=1, 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 118 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-05 finished in 9774 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(!F(p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 265 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:07:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:16] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:07:17] [INFO ] Implicit Places using invariants in 529 ms returned []
[2022-06-11 21:07:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:17] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:07:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:07:21] [INFO ] Implicit Places using invariants and state equation in 4698 ms returned []
Implicit Place search using SMT with State Equation took 5248 ms to find 0 implicit places.
[2022-06-11 21:07:22] [INFO ] Redundant transitions in 700 ms returned []
[2022-06-11 21:07:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:22] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:07:24] [INFO ] Dead Transitions using invariants and state equation in 2153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s51 1) (GEQ s297 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 582 ms.
Product exploration explored 100000 steps with 17 reset in 568 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[p0]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 171232 steps, run visited all 1 properties in 2372 ms. (steps per millisecond=72 )
Probabilistic random walk after 171232 steps, saw 123859 distinct states, run finished after 2373 ms. (steps per millisecond=72 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 240 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:07:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:29] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:07:29] [INFO ] Implicit Places using invariants in 472 ms returned []
[2022-06-11 21:07:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:29] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 21:07:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:07:37] [INFO ] Implicit Places using invariants and state equation in 7468 ms returned []
Implicit Place search using SMT with State Equation took 7945 ms to find 0 implicit places.
[2022-06-11 21:07:37] [INFO ] Redundant transitions in 675 ms returned []
[2022-06-11 21:07:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:37] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 21:07:39] [INFO ] Dead Transitions using invariants and state equation in 1922 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 171232 steps, run visited all 1 properties in 2340 ms. (steps per millisecond=73 )
Probabilistic random walk after 171232 steps, saw 123859 distinct states, run finished after 2340 ms. (steps per millisecond=73 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Product exploration explored 100000 steps with 4 reset in 523 ms.
Product exploration explored 100000 steps with 4 reset in 489 ms.
Built C files in :
/tmp/ltsmin10208832231596418704
[2022-06-11 21:07:43] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 21:07:43] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10208832231596418704
Running compilation step : cd /tmp/ltsmin10208832231596418704;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10208832231596418704;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10208832231596418704;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 212 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:07:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:46] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 21:07:47] [INFO ] Implicit Places using invariants in 462 ms returned []
[2022-06-11 21:07:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:47] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 21:07:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:07:54] [INFO ] Implicit Places using invariants and state equation in 7221 ms returned []
Implicit Place search using SMT with State Equation took 7688 ms to find 0 implicit places.
[2022-06-11 21:07:55] [INFO ] Redundant transitions in 687 ms returned []
[2022-06-11 21:07:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:07:55] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:07:57] [INFO ] Dead Transitions using invariants and state equation in 2065 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin4199105544796581589
[2022-06-11 21:07:57] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 21:07:57] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4199105544796581589
Running compilation step : cd /tmp/ltsmin4199105544796581589;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4199105544796581589;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4199105544796581589;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 21:08:00] [INFO ] Flatten gal took : 222 ms
[2022-06-11 21:08:01] [INFO ] Flatten gal took : 224 ms
[2022-06-11 21:08:01] [INFO ] Time to serialize gal into /tmp/LTL15406932913643707714.gal : 31 ms
[2022-06-11 21:08:01] [INFO ] Time to serialize properties into /tmp/LTL16866027212653540750.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/LTL15406932913643707714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16866027212653540750.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/LTL1540693...268
Read 1 LTL properties
Checking formula 0 : !((("((p51>=1)&&(l43>=1))")U(F(!(F("((p51>=1)&&(l43>=1))"))))))
Formula 0 simplified : !("((p51>=1)&&(l43>=1))" U F!F"((p51>=1)&&(l43>=1))")
Detected timeout of ITS tools.
[2022-06-11 21:08:16] [INFO ] Flatten gal took : 230 ms
[2022-06-11 21:08:16] [INFO ] Applying decomposition
[2022-06-11 21:08:16] [INFO ] Flatten gal took : 250 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/graph6534680940629078161.txt' '-o' '/tmp/graph6534680940629078161.bin' '-w' '/tmp/graph6534680940629078161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6534680940629078161.bin' '-l' '-1' '-v' '-w' '/tmp/graph6534680940629078161.weights' '-q' '0' '-e' '0.001'
[2022-06-11 21:08:17] [INFO ] Decomposing Gal with order
[2022-06-11 21:08:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 21:08:18] [INFO ] Removed a total of 17839 redundant transitions.
[2022-06-11 21:08:18] [INFO ] Flatten gal took : 849 ms
[2022-06-11 21:08:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1050 labels/synchronizations in 269 ms.
[2022-06-11 21:08:18] [INFO ] Time to serialize gal into /tmp/LTL545064905406506872.gal : 113 ms
[2022-06-11 21:08:18] [INFO ] Time to serialize properties into /tmp/LTL16643920756287579909.ltl : 39 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/LTL545064905406506872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16643920756287579909.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/LTL5450649...245
Read 1 LTL properties
Checking formula 0 : !((("((i8.u17.p51>=1)&&(i8.u59.l43>=1))")U(F(!(F("((i8.u17.p51>=1)&&(i8.u59.l43>=1))"))))))
Formula 0 simplified : !("((i8.u17.p51>=1)&&(i8.u59.l43>=1))" U F!F"((i8.u17.p51>=1)&&(i8.u59.l43>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4750633437915794175
[2022-06-11 21:08:33] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4750633437915794175
Running compilation step : cd /tmp/ltsmin4750633437915794175;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4750633437915794175;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4750633437915794175;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b08-LTLFireability-06 finished in 80350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(((G(p0) U (G(p2)&&p1))||X(G(p3))))))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 56 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:08:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:08:36] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:08:37] [INFO ] Implicit Places using invariants in 455 ms returned []
[2022-06-11 21:08:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:08:37] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:08:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:08:43] [INFO ] Implicit Places using invariants and state equation in 6457 ms returned []
Implicit Place search using SMT with State Equation took 6924 ms to find 0 implicit places.
[2022-06-11 21:08:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:08:43] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:08:45] [INFO ] Dead Transitions using invariants and state equation in 2031 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 (NOT p1)) (AND p3 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p3 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p3:(AND (GEQ s93 1) (GEQ s271 1)), p1:(AND (GEQ s93 1) (GEQ s271 1)), p2:(AND (GEQ s124 1) (GEQ s258 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 702 steps with 0 reset in 8 ms.
FORMULA Szymanski-PT-b08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-07 finished in 9194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 56 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:08:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:08:46] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 21:08:46] [INFO ] Implicit Places using invariants in 465 ms returned []
[2022-06-11 21:08:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:08:46] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:08:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:08:54] [INFO ] Implicit Places using invariants and state equation in 8319 ms returned []
Implicit Place search using SMT with State Equation took 8787 ms to find 0 implicit places.
[2022-06-11 21:08:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:08:54] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 21:08:56] [INFO ] Dead Transitions using invariants and state equation in 2051 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s119 1) (GEQ s298 1)), p1:(AND (GEQ s126 1) (GEQ s263 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][false, false, false]]
Stuttering criterion allowed to conclude after 414 steps with 0 reset in 5 ms.
FORMULA Szymanski-PT-b08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-08 finished in 11033 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 216 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:08:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:08:57] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 21:08:57] [INFO ] Implicit Places using invariants in 444 ms returned []
[2022-06-11 21:08:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:08:57] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 21:08:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:09:04] [INFO ] Implicit Places using invariants and state equation in 7223 ms returned []
Implicit Place search using SMT with State Equation took 7671 ms to find 0 implicit places.
[2022-06-11 21:09:05] [INFO ] Redundant transitions in 678 ms returned []
[2022-06-11 21:09:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:09:05] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 21:09:07] [INFO ] Dead Transitions using invariants and state equation in 2050 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s19 1) (LT s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7 reset in 451 ms.
Product exploration explored 100000 steps with 2 reset in 477 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 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 49 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 205016 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205016 steps, saw 142860 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 21:09:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:09:12] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:09:12] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:09:13] [INFO ] After 1136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 21:09:13] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:09:14] [INFO ] After 1454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 21:09:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:09:16] [INFO ] After 1943ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 21:09:16] [INFO ] After 2285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-06-11 21:09:17] [INFO ] After 3918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 212 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 208962 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208962 steps, saw 130479 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 21:09:20] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 21:09:20] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:09:20] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:09:21] [INFO ] After 1015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 21:09:21] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:09:22] [INFO ] After 881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 21:09:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:09:24] [INFO ] After 1809ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 21:09:24] [INFO ] After 2250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-06-11 21:09:24] [INFO ] After 3301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 215 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 197 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 21:09:25] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 21:09:25] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:09:25] [INFO ] Implicit Places using invariants in 435 ms returned []
[2022-06-11 21:09:25] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 21:09:25] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 21:09:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:09:33] [INFO ] Implicit Places using invariants and state equation in 7770 ms returned []
Implicit Place search using SMT with State Equation took 8207 ms to find 0 implicit places.
[2022-06-11 21:09:33] [INFO ] Redundant transitions in 656 ms returned []
[2022-06-11 21:09:33] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 21:09:33] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:09:36] [INFO ] Dead Transitions using invariants and state equation in 2102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 4872 edges and 305 vertex of which 35 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 33 places
Drop transitions removed 3744 transitions
Ensure Unique test removed 1697 transitions
Reduce isomorphic transitions removed 5441 transitions.
Drop transitions removed 320 transitions
Redundant transition composition rules discarded 320 transitions
Iterating global reduction 0 with 320 rules applied. Total rules applied 321 place count 272 transition count 2049
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 322 place count 272 transition count 2048
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 323 place count 271 transition count 2048
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 1 with 112 rules applied. Total rules applied 435 place count 271 transition count 1936
Applied a total of 435 rules in 217 ms. Remains 271 /305 variables (removed 34) and now considering 1936/7810 (removed 5874) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1936 rows 271 cols
[2022-06-11 21:09:36] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 21:09:36] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:09:36] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 21:09:36] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 8 ms returned sat
[2022-06-11 21:09:37] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 21:09:37] [INFO ] State equation strengthened by 480 read => feed constraints.
[2022-06-11 21:09:38] [INFO ] After 1759ms SMT Verify possible using 480 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 21:09:38] [INFO ] After 1865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-06-11 21:09:39] [INFO ] After 2378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 21:09:39] [INFO ] Flatten gal took : 56 ms
[2022-06-11 21:09:39] [INFO ] Flatten gal took : 57 ms
[2022-06-11 21:09:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16709303289441913611.gal : 11 ms
[2022-06-11 21:09:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12190033378946612254.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms18238830116928888391;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16709303289441913611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12190033378946612254.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12190033378946612254.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 189
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :189 after 2091
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2091 after 420235
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :420235 after 448062
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :448062 after 505259
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :505259 after 1.1443e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.1443e+06 after 1.23682e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.23682e+06 after 1.43489e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.43489e+06 after 1.8156e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.8156e+06 after 4.47838e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.47838e+06 after 7.7656e+06
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.05305e+07,8.66123,214792,2,7751,19,486207,6,0,3022,472324,0
Total reachable state count : 20530486

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,9.69112,214792,2,272,19,486207,7,0,3026,472324,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 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 33 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 230 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:09:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:09:49] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:09:49] [INFO ] Implicit Places using invariants in 439 ms returned []
[2022-06-11 21:09:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:09:49] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:09:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:09:55] [INFO ] Implicit Places using invariants and state equation in 6030 ms returned []
Implicit Place search using SMT with State Equation took 6482 ms to find 0 implicit places.
[2022-06-11 21:09:56] [INFO ] Redundant transitions in 682 ms returned []
[2022-06-11 21:09:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:09:56] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 21:09:58] [INFO ] Dead Transitions using invariants and state equation in 2263 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 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 40 ms :[true, (NOT p0)]
Incomplete random walk after 10001 steps, including 6 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 209972 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209972 steps, saw 144039 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 21:10:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:10:02] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 21:10:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:10:03] [INFO ] After 1053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 21:10:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:10:04] [INFO ] After 1391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 21:10:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:10:06] [INFO ] After 1968ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 21:10:06] [INFO ] After 2304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2022-06-11 21:10:07] [INFO ] After 3886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 213762 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213762 steps, saw 131239 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 21:10:10] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 21:10:10] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-11 21:10:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:10:11] [INFO ] After 982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 21:10:11] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:10:12] [INFO ] After 889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 21:10:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:10:14] [INFO ] After 1787ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 21:10:14] [INFO ] After 2224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-06-11 21:10:14] [INFO ] After 3284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 21:10:15] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 21:10:15] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:10:15] [INFO ] Implicit Places using invariants in 413 ms returned []
[2022-06-11 21:10:15] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 21:10:15] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 21:10:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:10:23] [INFO ] Implicit Places using invariants and state equation in 7869 ms returned []
Implicit Place search using SMT with State Equation took 8296 ms to find 0 implicit places.
[2022-06-11 21:10:24] [INFO ] Redundant transitions in 656 ms returned []
[2022-06-11 21:10:24] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 21:10:24] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 21:10:26] [INFO ] Dead Transitions using invariants and state equation in 2074 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 4872 edges and 305 vertex of which 35 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 33 places
Drop transitions removed 3744 transitions
Ensure Unique test removed 1697 transitions
Reduce isomorphic transitions removed 5441 transitions.
Drop transitions removed 320 transitions
Redundant transition composition rules discarded 320 transitions
Iterating global reduction 0 with 320 rules applied. Total rules applied 321 place count 272 transition count 2049
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 322 place count 272 transition count 2048
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 323 place count 271 transition count 2048
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 1 with 112 rules applied. Total rules applied 435 place count 271 transition count 1936
Applied a total of 435 rules in 301 ms. Remains 271 /305 variables (removed 34) and now considering 1936/7810 (removed 5874) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1936 rows 271 cols
[2022-06-11 21:10:26] [INFO ] Computed 1 place invariants in 7 ms
[2022-06-11 21:10:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:10:26] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 21:10:26] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:10:27] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 21:10:27] [INFO ] State equation strengthened by 480 read => feed constraints.
[2022-06-11 21:10:29] [INFO ] After 1773ms SMT Verify possible using 480 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 21:10:29] [INFO ] After 1874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-06-11 21:10:29] [INFO ] After 2404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 21:10:29] [INFO ] Flatten gal took : 57 ms
[2022-06-11 21:10:29] [INFO ] Flatten gal took : 55 ms
[2022-06-11 21:10:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality345144217484455657.gal : 5 ms
[2022-06-11 21:10:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7504071110502560379.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms7331170851144699652;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality345144217484455657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7504071110502560379.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality7504071110502560379.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 189
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :189 after 2091
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2091 after 420235
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :420235 after 448062
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :448062 after 505259
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :505259 after 1.1443e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.1443e+06 after 1.23682e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.23682e+06 after 1.43489e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.43489e+06 after 1.8156e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.8156e+06 after 4.47838e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.47838e+06 after 7.7656e+06
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.05305e+07,8.74669,214768,2,7751,19,486207,6,0,3022,472324,0
Total reachable state count : 20530486

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,9.78126,214768,2,272,19,486207,7,0,3026,472324,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 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 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 88 reset in 489 ms.
Product exploration explored 100000 steps with 10 reset in 405 ms.
Built C files in :
/tmp/ltsmin15587240774140572689
[2022-06-11 21:10:40] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 21:10:40] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15587240774140572689
Running compilation step : cd /tmp/ltsmin15587240774140572689;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15587240774140572689;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15587240774140572689;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:10:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:10:43] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:10:46] [INFO ] Implicit Places using invariants in 2732 ms returned []
[2022-06-11 21:10:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:10:46] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:10:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:10:52] [INFO ] Implicit Places using invariants and state equation in 6132 ms returned []
Implicit Place search using SMT with State Equation took 8870 ms to find 0 implicit places.
[2022-06-11 21:10:53] [INFO ] Redundant transitions in 659 ms returned []
[2022-06-11 21:10:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:10:53] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:10:55] [INFO ] Dead Transitions using invariants and state equation in 1935 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin2884953493366774696
[2022-06-11 21:10:55] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 21:10:55] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2884953493366774696
Running compilation step : cd /tmp/ltsmin2884953493366774696;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2884953493366774696;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2884953493366774696;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 21:10:58] [INFO ] Flatten gal took : 212 ms
[2022-06-11 21:10:58] [INFO ] Flatten gal took : 217 ms
[2022-06-11 21:10:58] [INFO ] Time to serialize gal into /tmp/LTL8103214633884889086.gal : 29 ms
[2022-06-11 21:10:58] [INFO ] Time to serialize properties into /tmp/LTL1389436014626860097.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/LTL8103214633884889086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1389436014626860097.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/LTL8103214...266
Read 1 LTL properties
Checking formula 0 : !((G("((p19<1)||(l18<1))")))
Formula 0 simplified : !G"((p19<1)||(l18<1))"
Detected timeout of ITS tools.
[2022-06-11 21:11:13] [INFO ] Flatten gal took : 211 ms
[2022-06-11 21:11:13] [INFO ] Applying decomposition
[2022-06-11 21:11:14] [INFO ] Flatten gal took : 261 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/graph554651398420338837.txt' '-o' '/tmp/graph554651398420338837.bin' '-w' '/tmp/graph554651398420338837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph554651398420338837.bin' '-l' '-1' '-v' '-w' '/tmp/graph554651398420338837.weights' '-q' '0' '-e' '0.001'
[2022-06-11 21:11:14] [INFO ] Decomposing Gal with order
[2022-06-11 21:11:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 21:11:15] [INFO ] Removed a total of 17871 redundant transitions.
[2022-06-11 21:11:15] [INFO ] Flatten gal took : 440 ms
[2022-06-11 21:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1021 labels/synchronizations in 169 ms.
[2022-06-11 21:11:15] [INFO ] Time to serialize gal into /tmp/LTL7366733926425924673.gal : 13 ms
[2022-06-11 21:11:15] [INFO ] Time to serialize properties into /tmp/LTL10051339211427329353.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/LTL7366733926425924673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10051339211427329353.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/LTL7366733...246
Read 1 LTL properties
Checking formula 0 : !((G("((i0.i1.u6.p19<1)||(i4.u51.l18<1))")))
Formula 0 simplified : !G"((i0.i1.u6.p19<1)||(i4.u51.l18<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7614448641971866036
[2022-06-11 21:11:30] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7614448641971866036
Running compilation step : cd /tmp/ltsmin7614448641971866036;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7614448641971866036;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7614448641971866036;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b08-LTLFireability-09 finished in 156476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!G(p0))) U X(G(p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:11:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:11:33] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 21:11:34] [INFO ] Implicit Places using invariants in 483 ms returned []
[2022-06-11 21:11:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:11:34] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:11:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:11:40] [INFO ] Implicit Places using invariants and state equation in 6441 ms returned []
Implicit Place search using SMT with State Equation took 6927 ms to find 0 implicit places.
[2022-06-11 21:11:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:11:40] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 21:11:42] [INFO ] Dead Transitions using invariants and state equation in 2023 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s299 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-10 finished in 9130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p1))||p0))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 241 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:11:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:11:42] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:11:43] [INFO ] Implicit Places using invariants in 453 ms returned []
[2022-06-11 21:11:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:11:43] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:11:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:11:50] [INFO ] Implicit Places using invariants and state equation in 7493 ms returned []
Implicit Place search using SMT with State Equation took 7950 ms to find 0 implicit places.
[2022-06-11 21:11:51] [INFO ] Redundant transitions in 685 ms returned []
[2022-06-11 21:11:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:11:51] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:11:53] [INFO ] Dead Transitions using invariants and state equation in 2097 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s49 1) (LT s274 1)), p1:(OR (LT s92 1) (LT s295 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 11 reset in 571 ms.
Product exploration explored 100000 steps with 11 reset in 599 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 204310 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204310 steps, saw 142690 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 21:11:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:11:58] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:11:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:11:58] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Szymanski-PT-b08-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b08-LTLFireability-12 finished in 16301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(p0) U X(p1))))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 253 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:11:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:11:59] [INFO ] Computed 1 place invariants in 72 ms
[2022-06-11 21:12:00] [INFO ] Implicit Places using invariants in 790 ms returned []
[2022-06-11 21:12:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:00] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:12:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:12:05] [INFO ] Implicit Places using invariants and state equation in 5245 ms returned []
Implicit Place search using SMT with State Equation took 6043 ms to find 0 implicit places.
[2022-06-11 21:12:05] [INFO ] Redundant transitions in 690 ms returned []
[2022-06-11 21:12:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:05] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:12:08] [INFO ] Dead Transitions using invariants and state equation in 2269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s300 1)), p0:(AND (GEQ s104 1) (GEQ s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 235 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-13 finished in 9398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((X(G(p2))&&p1)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 55 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:12:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:08] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:12:08] [INFO ] Implicit Places using invariants in 466 ms returned []
[2022-06-11 21:12:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:08] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:12:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:12:15] [INFO ] Implicit Places using invariants and state equation in 6862 ms returned []
Implicit Place search using SMT with State Equation took 7329 ms to find 0 implicit places.
[2022-06-11 21:12:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:15] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:12:17] [INFO ] Dead Transitions using invariants and state equation in 2125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s192 1) (GEQ s266 1)), p1:(AND (GEQ s192 1) (GEQ s266 1)), p2:(AND (GEQ s47 1) (GEQ s267 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-14 finished in 9730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 243 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:12:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:18] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 21:12:18] [INFO ] Implicit Places using invariants in 459 ms returned []
[2022-06-11 21:12:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:18] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:12:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:12:25] [INFO ] Implicit Places using invariants and state equation in 6686 ms returned []
Implicit Place search using SMT with State Equation took 7148 ms to find 0 implicit places.
[2022-06-11 21:12:26] [INFO ] Redundant transitions in 691 ms returned []
[2022-06-11 21:12:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:26] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:12:28] [INFO ] Dead Transitions using invariants and state equation in 2078 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s93 1) (GEQ s272 1)), p1:(AND (GEQ s106 1) (GEQ s284 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 131 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-15 finished in 10272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(X(p0)))&&F(X(X(!(!p1 U p2))))))))'
Found a CL insensitive property : Szymanski-PT-b08-LTLFireability-04
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 87 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 21:12:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:28] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 21:12:29] [INFO ] Implicit Places using invariants in 444 ms returned []
[2022-06-11 21:12:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:29] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 21:12:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:12:37] [INFO ] Implicit Places using invariants and state equation in 7676 ms returned []
Implicit Place search using SMT with State Equation took 8132 ms to find 0 implicit places.
[2022-06-11 21:12:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:37] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 21:12:39] [INFO ] Dead Transitions using invariants and state equation in 2090 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=true, acceptance={} source=4 dest: 6}, { cond=(OR (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 7}, { cond=p2, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s99 1) (LT s298 1)), p1:(AND (GEQ s91 1) (GEQ s297 1)), p2:(AND (GEQ s20 1) (GEQ s269 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 393 ms.
Product exploration explored 100000 steps with 1 reset in 377 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 8 states, 12 edges and 3 AP to 8 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 110850 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110850 steps, saw 75716 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 21:12:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:12:43] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 21:12:43] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:12:43] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 21:12:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:12:48] [INFO ] After 4588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 21:12:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:12:52] [INFO ] After 4380ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 21:12:55] [INFO ] After 7296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2786 ms.
[2022-06-11 21:12:58] [INFO ] After 14781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 52 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 216 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 107470 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107470 steps, saw 67532 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 21:13:02] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:13:02] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 21:13:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:13:02] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 21:13:02] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:13:07] [INFO ] After 5062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 21:13:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:13:15] [INFO ] After 7836ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 21:13:15] [INFO ] Deduced a trap composed of 45 places in 317 ms of which 0 ms to minimize.
[2022-06-11 21:13:16] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 1 ms to minimize.
[2022-06-11 21:13:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 763 ms
[2022-06-11 21:13:17] [INFO ] Deduced a trap composed of 134 places in 236 ms of which 1 ms to minimize.
[2022-06-11 21:13:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2022-06-11 21:13:19] [INFO ] After 12534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1465 ms.
[2022-06-11 21:13:21] [INFO ] After 19160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 47 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 200 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2022-06-11 21:13:21] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:13:21] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:13:22] [INFO ] Implicit Places using invariants in 442 ms returned []
[2022-06-11 21:13:22] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:13:22] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 21:13:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:13:29] [INFO ] Implicit Places using invariants and state equation in 7584 ms returned []
Implicit Place search using SMT with State Equation took 8031 ms to find 0 implicit places.
[2022-06-11 21:13:30] [INFO ] Redundant transitions in 666 ms returned []
[2022-06-11 21:13:30] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:13:30] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:13:32] [INFO ] Dead Transitions using invariants and state equation in 1932 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4552 edges and 305 vertex of which 14 / 305 are part of one of the 6 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 1472 transitions
Ensure Unique test removed 3748 transitions
Reduce isomorphic transitions removed 5220 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 297 transition count 2588
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 294 transition count 2588
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 7 place count 294 transition count 2584
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 290 transition count 2584
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 287 transition count 2581
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 287 transition count 2579
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 287 transition count 2577
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 285 transition count 2577
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 285 transition count 2575
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 283 transition count 2575
Applied a total of 31 rules in 178 ms. Remains 283 /305 variables (removed 22) and now considering 2575/7811 (removed 5236) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2575 rows 283 cols
[2022-06-11 21:13:32] [INFO ] Computed 1 place invariants in 33 ms
[2022-06-11 21:13:32] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:13:32] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 21:13:32] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:13:36] [INFO ] After 3891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 21:13:39] [INFO ] After 6623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2451 ms.
[2022-06-11 21:13:41] [INFO ] After 9157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 8 states, 12 edges and 3 AP to 8 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:13:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:13:42] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 21:13:43] [INFO ] Implicit Places using invariants in 478 ms returned []
[2022-06-11 21:13:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:13:43] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:13:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:13:51] [INFO ] Implicit Places using invariants and state equation in 8133 ms returned []
Implicit Place search using SMT with State Equation took 8614 ms to find 0 implicit places.
[2022-06-11 21:13:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:13:51] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 21:13:53] [INFO ] Dead Transitions using invariants and state equation in 1923 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 8 states, 12 edges and 3 AP to 8 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 117265 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117265 steps, saw 80836 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 21:13:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:13:56] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 21:13:56] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:13:57] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 21:13:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:14:01] [INFO ] After 4806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 21:14:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:14:06] [INFO ] After 4577ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 21:14:09] [INFO ] After 7503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2963 ms.
[2022-06-11 21:14:12] [INFO ] After 15388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 56 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 127003 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127003 steps, saw 82356 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 21:14:15] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:14:15] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 21:14:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:14:15] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 21:14:16] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:14:21] [INFO ] After 5272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 21:14:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:14:29] [INFO ] After 8164ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 21:14:30] [INFO ] Deduced a trap composed of 45 places in 311 ms of which 1 ms to minimize.
[2022-06-11 21:14:30] [INFO ] Deduced a trap composed of 74 places in 248 ms of which 1 ms to minimize.
[2022-06-11 21:14:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 749 ms
[2022-06-11 21:14:31] [INFO ] Deduced a trap composed of 134 places in 203 ms of which 1 ms to minimize.
[2022-06-11 21:14:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2022-06-11 21:14:34] [INFO ] After 13099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1559 ms.
[2022-06-11 21:14:36] [INFO ] After 20040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 46 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 207 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2022-06-11 21:14:36] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:14:36] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:14:36] [INFO ] Implicit Places using invariants in 423 ms returned []
[2022-06-11 21:14:36] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:14:36] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 21:14:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:14:43] [INFO ] Implicit Places using invariants and state equation in 6395 ms returned []
Implicit Place search using SMT with State Equation took 6822 ms to find 0 implicit places.
[2022-06-11 21:14:43] [INFO ] Redundant transitions in 669 ms returned []
[2022-06-11 21:14:43] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 21:14:43] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 21:14:46] [INFO ] Dead Transitions using invariants and state equation in 2177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4552 edges and 305 vertex of which 14 / 305 are part of one of the 6 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions removed 1472 transitions
Ensure Unique test removed 3748 transitions
Reduce isomorphic transitions removed 5220 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 297 transition count 2588
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 294 transition count 2588
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 7 place count 294 transition count 2584
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 290 transition count 2584
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 287 transition count 2581
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 287 transition count 2579
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 287 transition count 2577
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 285 transition count 2577
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 285 transition count 2575
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 283 transition count 2575
Applied a total of 31 rules in 194 ms. Remains 283 /305 variables (removed 22) and now considering 2575/7811 (removed 5236) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2575 rows 283 cols
[2022-06-11 21:14:46] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 21:14:46] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 21:14:46] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 21:14:46] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 21:14:50] [INFO ] After 4151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 21:14:53] [INFO ] After 7040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2633 ms.
[2022-06-11 21:14:56] [INFO ] After 9751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 8 states, 12 edges and 3 AP to 8 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Product exploration explored 100000 steps with 16 reset in 461 ms.
Product exploration explored 100000 steps with 44 reset in 611 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), p2]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 207 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:14:59] [INFO ] Redundant transitions in 675 ms returned []
[2022-06-11 21:14:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:14:59] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:15:02] [INFO ] Dead Transitions using invariants and state equation in 2168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Product exploration explored 100000 steps with 38 reset in 604 ms.
Product exploration explored 100000 steps with 3 reset in 522 ms.
Built C files in :
/tmp/ltsmin11500585873630585956
[2022-06-11 21:15:03] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11500585873630585956
Running compilation step : cd /tmp/ltsmin11500585873630585956;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11500585873630585956;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11500585873630585956;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 21:15:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:15:06] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 21:15:06] [INFO ] Implicit Places using invariants in 483 ms returned []
[2022-06-11 21:15:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:15:06] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 21:15:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 21:15:14] [INFO ] Implicit Places using invariants and state equation in 7993 ms returned []
Implicit Place search using SMT with State Equation took 8478 ms to find 0 implicit places.
[2022-06-11 21:15:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 21:15:14] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 21:15:16] [INFO ] Dead Transitions using invariants and state equation in 2077 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin11489307806626497375
[2022-06-11 21:15:16] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11489307806626497375
Running compilation step : cd /tmp/ltsmin11489307806626497375;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11489307806626497375;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11489307806626497375;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 21:15:20] [INFO ] Flatten gal took : 237 ms
[2022-06-11 21:15:20] [INFO ] Flatten gal took : 250 ms
[2022-06-11 21:15:20] [INFO ] Time to serialize gal into /tmp/LTL1105298342401695743.gal : 20 ms
[2022-06-11 21:15:20] [INFO ] Time to serialize properties into /tmp/LTL10504456090176408665.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/LTL1105298342401695743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10504456090176408665.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/LTL1105298...267
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(X("((p99<1)||(l44<1))"))))&&(F(X(X(!((!("((p91>=1)&&(l43>=1))"))U("((p20>=1)&&(l13>=1))"))))))))))
Formula 0 simplified : !XX(GFX"((p99<1)||(l44<1))" & FXX!(!"((p91>=1)&&(l43>=1))" U "((p20>=1)&&(l13>=1))"))
Detected timeout of ITS tools.
[2022-06-11 21:15:35] [INFO ] Flatten gal took : 257 ms
[2022-06-11 21:15:35] [INFO ] Applying decomposition
[2022-06-11 21:15:36] [INFO ] Flatten gal took : 229 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/graph2559341321035887238.txt' '-o' '/tmp/graph2559341321035887238.bin' '-w' '/tmp/graph2559341321035887238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2559341321035887238.bin' '-l' '-1' '-v' '-w' '/tmp/graph2559341321035887238.weights' '-q' '0' '-e' '0.001'
[2022-06-11 21:15:36] [INFO ] Decomposing Gal with order
[2022-06-11 21:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 21:15:36] [INFO ] Removed a total of 18365 redundant transitions.
[2022-06-11 21:15:37] [INFO ] Flatten gal took : 393 ms
[2022-06-11 21:15:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1112 labels/synchronizations in 178 ms.
[2022-06-11 21:15:37] [INFO ] Time to serialize gal into /tmp/LTL15840911319478032909.gal : 17 ms
[2022-06-11 21:15:37] [INFO ] Time to serialize properties into /tmp/LTL10713610509411233106.ltl : 2 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/LTL15840911319478032909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10713610509411233106.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/LTL1584091...247
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(X("((i2.i1.u33.p99<1)||(i7.i1.u61.l44<1))"))))&&(F(X(X(!((!("((i7.i0.u30.p91>=1)&&(i7.i1.u61.l43>=1))"))U("((u49.p20>=1)&&...179
Formula 0 simplified : !XX(GFX"((i2.i1.u33.p99<1)||(i7.i1.u61.l44<1))" & FXX!(!"((i7.i0.u30.p91>=1)&&(i7.i1.u61.l43>=1))" U "((u49.p20>=1)&&(u49.l13>=1))")...156
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14181466265126894825
[2022-06-11 21:15:52] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14181466265126894825
Running compilation step : cd /tmp/ltsmin14181466265126894825;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14181466265126894825;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14181466265126894825;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b08-LTLFireability-04 finished in 207051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(!F(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
[2022-06-11 21:15:55] [INFO ] Flatten gal took : 218 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13424742068373563665
[2022-06-11 21:15:55] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2022-06-11 21:15:55] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13424742068373563665
Running compilation step : cd /tmp/ltsmin13424742068373563665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 21:15:56] [INFO ] Applying decomposition
[2022-06-11 21:15:56] [INFO ] Flatten gal took : 334 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/graph961634683191280988.txt' '-o' '/tmp/graph961634683191280988.bin' '-w' '/tmp/graph961634683191280988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph961634683191280988.bin' '-l' '-1' '-v' '-w' '/tmp/graph961634683191280988.weights' '-q' '0' '-e' '0.001'
[2022-06-11 21:15:56] [INFO ] Decomposing Gal with order
[2022-06-11 21:15:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 21:15:57] [INFO ] Removed a total of 18396 redundant transitions.
[2022-06-11 21:15:57] [INFO ] Flatten gal took : 445 ms
[2022-06-11 21:15:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 1099 labels/synchronizations in 184 ms.
[2022-06-11 21:15:57] [INFO ] Time to serialize gal into /tmp/LTLFireability11987350614876406307.gal : 17 ms
[2022-06-11 21:15:57] [INFO ] Time to serialize properties into /tmp/LTLFireability3832497965339960248.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/LTLFireability11987350614876406307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3832497965339960248.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((X(X((G(F(X("((i2.u33.p99<1)||(i6.u60.l44<1))"))))&&(F(X(X(!((!("((i6.u30.p91>=1)&&(i6.u60.l43>=1))"))U("((i3.u49.p20>=1)&&(i3.u49.l...173
Formula 0 simplified : !XX(GFX"((i2.u33.p99<1)||(i6.u60.l44<1))" & FXX!(!"((i6.u30.p91>=1)&&(i6.u60.l43>=1))" U "((i3.u49.p20>=1)&&(i3.u49.l13>=1))"))
Compilation finished in 33166 ms.
Running link step : cd /tmp/ltsmin13424742068373563665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin13424742068373563665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(X((LTLAPp0==true))))&&<>(X(X(!(!(LTLAPp1==true) U (LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13424742068373563665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(X((LTLAPp0==true))))&&<>(X(X(!(!(LTLAPp1==true) U (LTLAPp2==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13424742068373563665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((LTLAPp3==true) U <>(!<>((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 21:40:47] [INFO ] Flatten gal took : 590 ms
[2022-06-11 21:40:47] [INFO ] Time to serialize gal into /tmp/LTLFireability5897448021261599562.gal : 34 ms
[2022-06-11 21:40:47] [INFO ] Time to serialize properties into /tmp/LTLFireability12414267922797524401.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/LTLFireability5897448021261599562.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12414267922797524401.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 3 LTL properties
Checking formula 0 : !((X(X((G(F(X("((p99<1)||(l44<1))"))))&&(F(X(X(!((!("((p91>=1)&&(l43>=1))"))U("((p20>=1)&&(l13>=1))"))))))))))
Formula 0 simplified : !XX(GFX"((p99<1)||(l44<1))" & FXX!(!"((p91>=1)&&(l43>=1))" U "((p20>=1)&&(l13>=1))"))
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13424742068373563665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((LTLAPp3==true) U <>(!<>((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13424742068373563665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp4==true))' '--buchi-type=spotba'

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="Szymanski-PT-b08"
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 Szymanski-PT-b08, 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-165472283101060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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