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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.9K Jun 7 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 7 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Jun 7 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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-b04-LTLFireability-00
FORMULA_NAME Szymanski-PT-b04-LTLFireability-01
FORMULA_NAME Szymanski-PT-b04-LTLFireability-02
FORMULA_NAME Szymanski-PT-b04-LTLFireability-03
FORMULA_NAME Szymanski-PT-b04-LTLFireability-04
FORMULA_NAME Szymanski-PT-b04-LTLFireability-05
FORMULA_NAME Szymanski-PT-b04-LTLFireability-06
FORMULA_NAME Szymanski-PT-b04-LTLFireability-07
FORMULA_NAME Szymanski-PT-b04-LTLFireability-08
FORMULA_NAME Szymanski-PT-b04-LTLFireability-09
FORMULA_NAME Szymanski-PT-b04-LTLFireability-10
FORMULA_NAME Szymanski-PT-b04-LTLFireability-11
FORMULA_NAME Szymanski-PT-b04-LTLFireability-12
FORMULA_NAME Szymanski-PT-b04-LTLFireability-13
FORMULA_NAME Szymanski-PT-b04-LTLFireability-14
FORMULA_NAME Szymanski-PT-b04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654974009783

Running Version 202205111006
[2022-06-11 19:00:10] [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 19:00:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 19:00:11] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2022-06-11 19:00:11] [INFO ] Transformed 568 places.
[2022-06-11 19:00:11] [INFO ] Transformed 8320 transitions.
[2022-06-11 19:00:11] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 503 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 260 places in 20 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 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 140 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:00:11] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:00:11] [INFO ] Computed 1 place invariants in 57 ms
[2022-06-11 19:00:12] [INFO ] Implicit Places using invariants in 558 ms returned []
[2022-06-11 19:00:12] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:00:12] [INFO ] Computed 1 place invariants in 25 ms
[2022-06-11 19:00:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:00:15] [INFO ] Implicit Places using invariants and state equation in 3469 ms returned []
Implicit Place search using SMT with State Equation took 4059 ms to find 0 implicit places.
[2022-06-11 19:00:15] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:00:15] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:00:18] [INFO ] Dead Transitions using invariants and state equation in 2228 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 54 out of 306 places after structural reductions.
[2022-06-11 19:00:18] [INFO ] Flatten gal took : 457 ms
[2022-06-11 19:00:19] [INFO ] Flatten gal took : 326 ms
[2022-06-11 19:00:19] [INFO ] Input system was already deterministic with 8064 transitions.
Support contains 51 out of 306 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 33) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) 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 27) 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 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 :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 :2
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 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 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) 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 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 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
Running SMT prover for 22 properties.
[2022-06-11 19:00:20] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:00:20] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:00:20] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:00:27] [INFO ] After 7106ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:21
[2022-06-11 19:00:27] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:00:52] [INFO ] After 24731ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2022-06-11 19:00:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:00:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 19:00:52] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:21
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 512 ms.
Support contains 38 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 306 transition count 8009
Applied a total of 55 rules in 455 ms. Remains 306 /306 variables (removed 0) and now considering 8009/8064 (removed 55) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8009/8064 transitions.
Incomplete random walk after 10002 steps, including 3 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 21) 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 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 108339 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{11=1}
Probabilistic random walk after 108339 steps, saw 41597 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :1
Running SMT prover for 19 properties.
[2022-06-11 19:00:57] [INFO ] Flow matrix only has 2678 transitions (discarded 5331 similar events)
// Phase 1: matrix 2678 rows 306 cols
[2022-06-11 19:00:57] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:01:07] [INFO ] After 10331ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:17
[2022-06-11 19:01:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:01:18] [INFO ] After 10512ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:19
[2022-06-11 19:01:18] [INFO ] After 21142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-06-11 19:01:18] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:01:43] [INFO ] After 24763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-06-11 19:01:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 19:01:43] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 297 ms.
Support contains 35 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8009/8009 transitions.
Applied a total of 0 rules in 261 ms. Remains 306 /306 variables (removed 0) and now considering 8009/8009 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8009/8009 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2022-06-11 19:01:44] [INFO ] Flow matrix only has 2678 transitions (discarded 5331 similar events)
// Phase 1: matrix 2678 rows 306 cols
[2022-06-11 19:01:44] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:01:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:01:52] [INFO ] After 8162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-06-11 19:01:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:02:03] [INFO ] After 11174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-06-11 19:02:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:02:17] [INFO ] After 13633ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-06-11 19:02:17] [INFO ] After 13634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-11 19:02:17] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 227 ms.
Support contains 29 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8009/8009 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8007
Applied a total of 2 rules in 338 ms. Remains 306 /306 variables (removed 0) and now considering 8007/8009 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8007/8009 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' '!(X(G((X(((p1 U p2) U (G(p3) U p2)))&&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 181 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:02:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:02:18] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:02:18] [INFO ] Implicit Places using invariants in 464 ms returned []
[2022-06-11 19:02:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:02:18] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:02:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:02:26] [INFO ] Implicit Places using invariants and state equation in 7956 ms returned []
Implicit Place search using SMT with State Equation took 8423 ms to find 0 implicit places.
[2022-06-11 19:02:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:02:26] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:02:29] [INFO ] Dead Transitions using invariants and state equation in 2107 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 437 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p3), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s263 1)), p2:(AND (GEQ s10 1) (GEQ s263 1)), p3:(AND (GEQ s70 1) (GEQ s301 1)), p1:(AND (GEQ s22 1) (GEQ s299 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-00 finished in 11243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U 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 856 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:02:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:02:30] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:02:30] [INFO ] Implicit Places using invariants in 444 ms returned []
[2022-06-11 19:02:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:02:30] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:02:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:02:37] [INFO ] Implicit Places using invariants and state equation in 6397 ms returned []
Implicit Place search using SMT with State Equation took 6845 ms to find 0 implicit places.
[2022-06-11 19:02:38] [INFO ] Redundant transitions in 958 ms returned []
[2022-06-11 19:02:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:02:38] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:02:40] [INFO ] Dead Transitions using invariants and state equation in 2111 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 68 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s87 1) (GEQ s262 1)), p0:(AND (GEQ s72 1) (GEQ s257 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 364 steps with 0 reset in 16 ms.
FORMULA Szymanski-PT-b04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-01 finished in 10900 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.
Applied a total of 0 rules in 215 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:02:40] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:02:40] [INFO ] Computed 1 place invariants in 28 ms
[2022-06-11 19:02:41] [INFO ] Implicit Places using invariants in 454 ms returned []
[2022-06-11 19:02:41] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:02:41] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:02:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:02:47] [INFO ] Implicit Places using invariants and state equation in 6340 ms returned []
Implicit Place search using SMT with State Equation took 6797 ms to find 0 implicit places.
[2022-06-11 19:02:48] [INFO ] Redundant transitions in 716 ms returned []
[2022-06-11 19:02:48] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:02:48] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:02:50] [INFO ] Dead Transitions using invariants and state equation in 2256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-02 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 s72 1) (GEQ s286 1)), p1:(AND (GEQ s26 1) (GEQ s274 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 442 steps with 3 reset in 19 ms.
FORMULA Szymanski-PT-b04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-02 finished in 10108 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||X(X(G(p1)))||F(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.
Applied a total of 0 rules in 33 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:02:50] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:02:50] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:02:50] [INFO ] Implicit Places using invariants in 430 ms returned []
[2022-06-11 19:02:51] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:02:51] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:02:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:02:56] [INFO ] Implicit Places using invariants and state equation in 5712 ms returned []
Implicit Place search using SMT with State Equation took 6144 ms to find 0 implicit places.
[2022-06-11 19:02:56] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:02:56] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:02:58] [INFO ] Dead Transitions using invariants and state equation in 2069 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s51 1) (GEQ s286 1)), p1:(AND (GEQ s117 1) (GEQ s303 1)), p0:(AND (GEQ s111 1) (GEQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 584 ms.
Stack based approach found an accepted trace after 106 steps with 0 reset with depth 107 and stack size 107 in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-04 finished in 9053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(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 254 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:02:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:02:59] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:03:00] [INFO ] Implicit Places using invariants in 453 ms returned []
[2022-06-11 19:03:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:03:00] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:03:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:03:07] [INFO ] Implicit Places using invariants and state equation in 6871 ms returned []
Implicit Place search using SMT with State Equation took 7326 ms to find 0 implicit places.
[2022-06-11 19:03:08] [INFO ] Redundant transitions in 920 ms returned []
[2022-06-11 19:03:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:03:08] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:03:10] [INFO ] Dead Transitions using invariants and state equation in 2079 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 :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s48 1) (LT s294 1) (AND (GEQ s121 1) (GEQ s297 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 1 reset in 467 ms.
Product exploration explored 100000 steps with 1 reset in 479 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6818 steps, including 2 resets, run visited all 1 properties in 20 ms. (steps per millisecond=340 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 4 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 220 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:03:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:03:11] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:03:12] [INFO ] Implicit Places using invariants in 475 ms returned []
[2022-06-11 19:03:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:03:12] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:03:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:03:19] [INFO ] Implicit Places using invariants and state equation in 7335 ms returned []
Implicit Place search using SMT with State Equation took 7818 ms to find 0 implicit places.
[2022-06-11 19:03:20] [INFO ] Redundant transitions in 646 ms returned []
[2022-06-11 19:03:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:03:20] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:03:22] [INFO ] Dead Transitions using invariants and state equation in 2113 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1288 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=214 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 537 ms.
Product exploration explored 100000 steps with 2 reset in 463 ms.
Built C files in :
/tmp/ltsmin4516939575892633105
[2022-06-11 19:03:24] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:03:24] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4516939575892633105
Running compilation step : cd /tmp/ltsmin4516939575892633105;'/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/ltsmin4516939575892633105;'/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/ltsmin4516939575892633105;'/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 4 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 318 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:03:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:03:27] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:03:28] [INFO ] Implicit Places using invariants in 601 ms returned []
[2022-06-11 19:03:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:03:28] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:03:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:03:38] [INFO ] Implicit Places using invariants and state equation in 10566 ms returned []
Implicit Place search using SMT with State Equation took 11205 ms to find 0 implicit places.
[2022-06-11 19:03:39] [INFO ] Redundant transitions in 687 ms returned []
[2022-06-11 19:03:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:03:39] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:03:43] [INFO ] Dead Transitions using invariants and state equation in 3831 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin11275060107275952392
[2022-06-11 19:03:43] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:03:43] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11275060107275952392
Running compilation step : cd /tmp/ltsmin11275060107275952392;'/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/ltsmin11275060107275952392;'/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/ltsmin11275060107275952392;'/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 19:03:48] [INFO ] Flatten gal took : 564 ms
[2022-06-11 19:03:48] [INFO ] Flatten gal took : 734 ms
[2022-06-11 19:03:48] [INFO ] Time to serialize gal into /tmp/LTL10930597663416757437.gal : 133 ms
[2022-06-11 19:03:48] [INFO ] Time to serialize properties into /tmp/LTL8527882972767263172.ltl : 15 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/LTL10930597663416757437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8527882972767263172.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/LTL1093059...267
Read 1 LTL properties
Checking formula 0 : !((G(F(X(F("(((p48<1)||(l40<1))||((p121>=1)&&(l43>=1)))"))))))
Formula 0 simplified : !GFXF"(((p48<1)||(l40<1))||((p121>=1)&&(l43>=1)))"
Detected timeout of ITS tools.
[2022-06-11 19:04:04] [INFO ] Flatten gal took : 255 ms
[2022-06-11 19:04:04] [INFO ] Applying decomposition
[2022-06-11 19:04:04] [INFO ] Flatten gal took : 271 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/graph1940974278916744380.txt' '-o' '/tmp/graph1940974278916744380.bin' '-w' '/tmp/graph1940974278916744380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1940974278916744380.bin' '-l' '-1' '-v' '-w' '/tmp/graph1940974278916744380.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:04:05] [INFO ] Decomposing Gal with order
[2022-06-11 19:04:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:04:05] [INFO ] Removed a total of 18143 redundant transitions.
[2022-06-11 19:04:06] [INFO ] Flatten gal took : 793 ms
[2022-06-11 19:04:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1256 labels/synchronizations in 354 ms.
[2022-06-11 19:04:06] [INFO ] Time to serialize gal into /tmp/LTL11642409358672299650.gal : 32 ms
[2022-06-11 19:04:06] [INFO ] Time to serialize properties into /tmp/LTL9497314012318782659.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/LTL11642409358672299650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9497314012318782659.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/LTL1164240...246
Read 1 LTL properties
Checking formula 0 : !((G(F(X(F("(((i6.u52.p48<1)||(i8.i2.u60.l40<1))||((i8.i2.u41.p121>=1)&&(i8.i2.u61.l43>=1)))"))))))
Formula 0 simplified : !GFXF"(((i6.u52.p48<1)||(i8.i2.u60.l40<1))||((i8.i2.u41.p121>=1)&&(i8.i2.u61.l43>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4167700683564534755
[2022-06-11 19:04:21] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4167700683564534755
Running compilation step : cd /tmp/ltsmin4167700683564534755;'/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/ltsmin4167700683564534755;'/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/ltsmin4167700683564534755;'/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-b04-LTLFireability-05 finished in 85176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(X(p0))||F(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 282 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:04:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:25] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 19:04:25] [INFO ] Implicit Places using invariants in 650 ms returned []
[2022-06-11 19:04:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:25] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:04:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:04:33] [INFO ] Implicit Places using invariants and state equation in 7793 ms returned []
Implicit Place search using SMT with State Equation took 8446 ms to find 0 implicit places.
[2022-06-11 19:04:34] [INFO ] Redundant transitions in 671 ms returned []
[2022-06-11 19:04:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:34] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:04:37] [INFO ] Dead Transitions using invariants and state equation in 3025 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 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s7 1) (LT s298 1)), p0:(AND (GEQ s115 1) (GEQ s256 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 4 reset in 602 ms.
Product exploration explored 100000 steps with 0 reset in 555 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 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 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 4 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 122601 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122601 steps, saw 51700 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 19:04:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:41] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:04:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:04:43] [INFO ] After 1665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:04:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:04:47] [INFO ] After 3962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:04:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:04:53] [INFO ] After 6113ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:04:57] [INFO ] After 9532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9347 ms.
[2022-06-11 19:05:06] [INFO ] After 22916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 4 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 230 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 10003 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 156394 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156394 steps, saw 57191 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 19:05:09] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:05:09] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:05:09] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:05:11] [INFO ] After 1834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:05:11] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:05:13] [INFO ] After 2147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:05:13] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:05:32] [INFO ] After 18092ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:05:32] [INFO ] After 20331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 4 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 197 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 272 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 19:05:32] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:05:32] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:05:32] [INFO ] Implicit Places using invariants in 408 ms returned []
[2022-06-11 19:05:32] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:05:32] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-11 19:05:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:05:39] [INFO ] Implicit Places using invariants and state equation in 6303 ms returned []
Implicit Place search using SMT with State Equation took 6723 ms to find 0 implicit places.
[2022-06-11 19:05:39] [INFO ] Redundant transitions in 625 ms returned []
[2022-06-11 19:05:39] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:05:39] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:05:42] [INFO ] Dead Transitions using invariants and state equation in 2138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 4944 edges and 305 vertex of which 37 / 305 are part of one of the 2 SCC in 6 ms
Free SCC test removed 35 places
Drop transitions removed 4072 transitions
Ensure Unique test removed 1372 transitions
Reduce isomorphic transitions removed 5444 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1950
Applied a total of 417 rules in 279 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1950 rows 270 cols
[2022-06-11 19:05:42] [INFO ] Computed 1 place invariants in 8 ms
[2022-06-11 19:05:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 39 ms returned sat
[2022-06-11 19:05:43] [INFO ] After 647ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-11 19:05:43] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:05:43] [INFO ] After 133ms SMT Verify possible using 504 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:05:43] [INFO ] After 1079ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:05:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-11 19:05:44] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:05:44] [INFO ] After 491ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:05:50] [INFO ] After 6410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9706 ms.
[2022-06-11 19:06:00] [INFO ] After 16816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:00] [INFO ] Flatten gal took : 91 ms
[2022-06-11 19:06:00] [INFO ] Flatten gal took : 69 ms
[2022-06-11 19:06:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5361428045772813159.gal : 21 ms
[2022-06-11 19:06:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14699762544432606394.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11097663871555191752;'/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/ReachabilityCardinality5361428045772813159.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14699762544432606394.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...320
Loading property file /tmp/ReachabilityCardinality14699762544432606394.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 255
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :255 after 13540
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13540 after 14350
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14350 after 16643
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :16643 after 28895
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :28895 after 32390
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :32390 after 37330
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :37330 after 44858
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :44858 after 57668
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :57668 after 146903
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 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,251767,11.5387,269468,2,5431,18,364195,6,0,3032,340801,0
Total reachable state count : 251767

Verifying 2 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,11.6287,269468,2,271,18,364195,7,0,3036,340801,0
Reachability property apf1 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
apf1,1,11.7684,269468,2,271,18,364195,8,0,3041,340801,0
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 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 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 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 246 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:06:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:06:12] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:06:13] [INFO ] Implicit Places using invariants in 475 ms returned []
[2022-06-11 19:06:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:06:13] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:06:13] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:06:20] [INFO ] Implicit Places using invariants and state equation in 7177 ms returned []
Implicit Place search using SMT with State Equation took 7662 ms to find 0 implicit places.
[2022-06-11 19:06:21] [INFO ] Redundant transitions in 653 ms returned []
[2022-06-11 19:06:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:06:21] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:06:23] [INFO ] Dead Transitions using invariants and state equation in 2164 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 p1 (NOT p0)), (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 99 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 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 148178 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148178 steps, saw 63411 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 19:06:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:06:26] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:06:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:06:28] [INFO ] After 1747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:06:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:06:32] [INFO ] After 3819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:06:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:06:38] [INFO ] After 5861ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:06:41] [INFO ] After 9292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9382 ms.
[2022-06-11 19:06:51] [INFO ] After 22577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 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 202 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 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 168987 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168987 steps, saw 59040 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 19:06:54] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:06:54] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:06:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:06:56] [INFO ] After 1986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:06:56] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:06:58] [INFO ] After 2098ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:06:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:07:16] [INFO ] After 18107ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:07:16] [INFO ] After 20282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 4 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 219 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 183 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 19:07:17] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:07:17] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:07:17] [INFO ] Implicit Places using invariants in 424 ms returned []
[2022-06-11 19:07:17] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:07:17] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:07:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:07:24] [INFO ] Implicit Places using invariants and state equation in 6997 ms returned []
Implicit Place search using SMT with State Equation took 7441 ms to find 0 implicit places.
[2022-06-11 19:07:25] [INFO ] Redundant transitions in 642 ms returned []
[2022-06-11 19:07:25] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:07:25] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:07:27] [INFO ] Dead Transitions using invariants and state equation in 2088 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 4944 edges and 305 vertex of which 37 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 35 places
Drop transitions removed 4072 transitions
Ensure Unique test removed 1372 transitions
Reduce isomorphic transitions removed 5444 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1950
Applied a total of 417 rules in 122 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1950 rows 270 cols
[2022-06-11 19:07:27] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-11 19:07:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:07:28] [INFO ] After 561ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-11 19:07:28] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:07:28] [INFO ] After 120ms SMT Verify possible using 504 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:07:28] [INFO ] After 801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:07:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:07:29] [INFO ] After 635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:07:29] [INFO ] After 476ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:07:35] [INFO ] After 6224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9700 ms.
[2022-06-11 19:07:44] [INFO ] After 16619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:07:45] [INFO ] Flatten gal took : 62 ms
[2022-06-11 19:07:45] [INFO ] Flatten gal took : 60 ms
[2022-06-11 19:07:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5871455498765625278.gal : 7 ms
[2022-06-11 19:07:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2431345477485313630.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5547050690697476448;'/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/ReachabilityCardinality5871455498765625278.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2431345477485313630.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...319
Loading property file /tmp/ReachabilityCardinality2431345477485313630.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 255
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :255 after 13540
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13540 after 14350
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14350 after 16643
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :16643 after 28895
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :28895 after 32390
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :32390 after 37330
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :37330 after 44858
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :44858 after 57668
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :57668 after 146903
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Detected timeout of ITS tools.
Knowledge obtained : [(AND p1 (NOT p0)), (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 101 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 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 422 ms.
Product exploration explored 100000 steps with 3 reset in 431 ms.
Built C files in :
/tmp/ltsmin13388884738414533
[2022-06-11 19:08:01] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:08:01] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13388884738414533
Running compilation step : cd /tmp/ltsmin13388884738414533;'/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/ltsmin13388884738414533;'/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/ltsmin13388884738414533;'/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 4 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 194 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:08:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:08:04] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:08:05] [INFO ] Implicit Places using invariants in 505 ms returned []
[2022-06-11 19:08:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:08:05] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:08:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:08:12] [INFO ] Implicit Places using invariants and state equation in 7481 ms returned []
Implicit Place search using SMT with State Equation took 7988 ms to find 0 implicit places.
[2022-06-11 19:08:13] [INFO ] Redundant transitions in 669 ms returned []
[2022-06-11 19:08:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:08:13] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:08:15] [INFO ] Dead Transitions using invariants and state equation in 2062 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin4574165237609426033
[2022-06-11 19:08:15] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:08:15] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4574165237609426033
Running compilation step : cd /tmp/ltsmin4574165237609426033;'/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/ltsmin4574165237609426033;'/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/ltsmin4574165237609426033;'/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 19:08:18] [INFO ] Flatten gal took : 244 ms
[2022-06-11 19:08:19] [INFO ] Flatten gal took : 221 ms
[2022-06-11 19:08:19] [INFO ] Time to serialize gal into /tmp/LTL14990973844521021980.gal : 19 ms
[2022-06-11 19:08:19] [INFO ] Time to serialize properties into /tmp/LTL11150637909705700117.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/LTL14990973844521021980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11150637909705700117.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/LTL1499097...268
Read 1 LTL properties
Checking formula 0 : !((G(F(X((F(X("((p115>=1)&&(l0>=1))")))||(F("((s7<1)||(l44<1))")))))))
Formula 0 simplified : !GFX(FX"((p115>=1)&&(l0>=1))" | F"((s7<1)||(l44<1))")
Detected timeout of ITS tools.
[2022-06-11 19:08:34] [INFO ] Flatten gal took : 271 ms
[2022-06-11 19:08:34] [INFO ] Applying decomposition
[2022-06-11 19:08:34] [INFO ] Flatten gal took : 273 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/graph1807816556471574345.txt' '-o' '/tmp/graph1807816556471574345.bin' '-w' '/tmp/graph1807816556471574345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1807816556471574345.bin' '-l' '-1' '-v' '-w' '/tmp/graph1807816556471574345.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:08:35] [INFO ] Decomposing Gal with order
[2022-06-11 19:08:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:08:35] [INFO ] Removed a total of 18142 redundant transitions.
[2022-06-11 19:08:36] [INFO ] Flatten gal took : 594 ms
[2022-06-11 19:08:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 1090 labels/synchronizations in 207 ms.
[2022-06-11 19:08:36] [INFO ] Time to serialize gal into /tmp/LTL17192967734144299130.gal : 21 ms
[2022-06-11 19:08:36] [INFO ] Time to serialize properties into /tmp/LTL14755551300760250614.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/LTL17192967734144299130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14755551300760250614.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/LTL1719296...247
Read 1 LTL properties
Checking formula 0 : !((G(F(X((F(X("((i7.u39.p115>=1)&&(i0.i0.u44.l0>=1))")))||(F("((i5.u1.s7<1)||(i6.u60.l44<1))")))))))
Formula 0 simplified : !GFX(FX"((i7.u39.p115>=1)&&(i0.i0.u44.l0>=1))" | F"((i5.u1.s7<1)||(i6.u60.l44<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1989875817612814032
[2022-06-11 19:08:51] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1989875817612814032
Running compilation step : cd /tmp/ltsmin1989875817612814032;'/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/ltsmin1989875817612814032;'/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/ltsmin1989875817612814032;'/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-b04-LTLFireability-06 finished in 269901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(G((!G(p0) U p1))) U X((p2 U X(p3))))))'
Support contains 8 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 37 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:08:54] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:08:54] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:08:55] [INFO ] Implicit Places using invariants in 500 ms returned []
[2022-06-11 19:08:55] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:08:55] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:08:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:09:00] [INFO ] Implicit Places using invariants and state equation in 5290 ms returned []
Implicit Place search using SMT with State Equation took 5791 ms to find 0 implicit places.
[2022-06-11 19:09:00] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:09:00] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:09:02] [INFO ] Dead Transitions using invariants and state equation in 2092 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 455 ms :[p3, p3, (AND p1 p3), (AND p1 p3), p3, false, false, (AND p1 p3), (AND (NOT p0) p1 p3)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=2 dest: 7}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={2} source=2 dest: 8}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(OR (AND (NOT p0) p3) (AND p1 p3)), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 3}, { cond=p3, acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={0, 1} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 2} source=6 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1, 2} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={2} source=6 dest: 8}, { cond=(AND p0 p1 (NOT p3)), acceptance={1, 2} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=7 dest: 2}, { cond=(AND p1 p3), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0, 2} source=7 dest: 7}, { cond=(AND p1 p3), acceptance={0, 1, 2} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p3), acceptance={2} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={0, 1} source=8 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1 p3), acceptance={1} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0, 2} source=8 dest: 7}, { cond=(AND (NOT p0) p1 p3), acceptance={0, 1, 2} source=8 dest: 7}, { cond=(AND p0 (NOT p1) p3), acceptance={2} source=8 dest: 8}, { cond=(AND p0 p1 p3), acceptance={1, 2} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s104 1) (GEQ s302 1)), p1:(AND (GEQ s122 1) (GEQ s260 1)), p2:(AND (GEQ s112 1) (GEQ s278 1)), p3:(AND (GEQ s96 1) (GEQ s305 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22186 reset in 931 ms.
Product exploration explored 100000 steps with 22220 reset in 905 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 p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (OR (NOT p0) p1)), (X (X (NOT (OR (AND (NOT p0) p3) (AND p1 p3))))), true, (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1298 ms. Reduced automaton from 9 states, 43 edges and 4 AP to 12 states, 51 edges and 4 AP.
Stuttering acceptance computed with spot in 557 ms :[(AND p1 p3), (AND p1 p3), (AND p1 p3), false, (AND p1 p3), (AND (NOT p0) p1 p3), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
[2022-06-11 19:09:07] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:09:07] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:09:07] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:09:08] [INFO ] After 1182ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2022-06-11 19:09:08] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:09:18] [INFO ] After 9433ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :6
[2022-06-11 19:09:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:09:33] [INFO ] After 15404ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :7 sat :5
[2022-06-11 19:09:33] [INFO ] After 15409ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :5
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-11 19:09:33] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :5
Fused 13 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 306 transition count 7936
Applied a total of 128 rules in 198 ms. Remains 306 /306 variables (removed 0) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/8064 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 134360 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{0=1}
Probabilistic random walk after 134360 steps, saw 50843 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :1
Running SMT prover for 5 properties.
[2022-06-11 19:09:37] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:09:37] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-11 19:09:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:09:39] [INFO ] After 2151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 19:09:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:09:45] [INFO ] After 5656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 19:09:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:10:02] [INFO ] After 17644ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 19:10:04] [INFO ] After 19263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-11 19:10:04] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 130 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 187 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 138364 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138364 steps, saw 53189 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 5 properties.
[2022-06-11 19:10:08] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:10:08] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 19:10:08] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:10:10] [INFO ] After 2138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 19:10:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 19:10:16] [INFO ] After 5633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 19:10:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:10:33] [INFO ] After 17740ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 19:10:35] [INFO ] After 19268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 19:10:35] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 140 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 190 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 255 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:10:35] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:10:36] [INFO ] Computed 3 place invariants in 18 ms
[2022-06-11 19:10:36] [INFO ] Implicit Places using invariants in 522 ms returned []
[2022-06-11 19:10:36] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:10:36] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 19:10:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:10:44] [INFO ] Implicit Places using invariants and state equation in 7995 ms returned []
Implicit Place search using SMT with State Equation took 8528 ms to find 0 implicit places.
[2022-06-11 19:10:45] [INFO ] Redundant transitions in 652 ms returned []
[2022-06-11 19:10:45] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:10:45] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 19:10:47] [INFO ] Dead Transitions using invariants and state equation in 2333 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (OR (NOT p0) p1)), (X (X (NOT (OR (AND (NOT p0) p3) (AND p1 p3))))), true, (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p3) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p3) p1 p2))), (G (NOT (AND p3 p1))), (G (NOT (AND p0 p3 (NOT p1)))), (G (NOT (AND p0 p3 p1))), (G (NOT (AND (NOT p0) p3 p1))), (G (NOT (AND p0 (NOT p3) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (AND (NOT p0) p3 (NOT p1))), (F (AND (NOT p3) p1)), (F (AND (NOT p0) (NOT p3) p1))]
Knowledge based reduction with 19 factoid took 1568 ms. Reduced automaton from 12 states, 51 edges and 4 AP to 9 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 396 ms :[(AND p1 p3), (AND p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 391 ms :[(AND p1 p3), (AND p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Support contains 8 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 43 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:10:49] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:10:49] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:10:50] [INFO ] Implicit Places using invariants in 422 ms returned []
[2022-06-11 19:10:50] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:10:50] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:10:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:10:56] [INFO ] Implicit Places using invariants and state equation in 5907 ms returned []
Implicit Place search using SMT with State Equation took 6362 ms to find 0 implicit places.
[2022-06-11 19:10:56] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:10:56] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:10:58] [INFO ] Dead Transitions using invariants and state equation in 2180 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
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 p0) (NOT p1) (NOT p3) (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT p0)), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1442 ms. Reduced automaton from 9 states, 30 edges and 4 AP to 9 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 367 ms :[(AND p1 p3), (AND p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 13) 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 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-06-11 19:11:00] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:11:00] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:11:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:11:01] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-11 19:11:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:11:06] [INFO ] After 5423ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2022-06-11 19:11:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:11:21] [INFO ] After 14393ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2022-06-11 19:11:26] [INFO ] After 19481ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-11 19:11:26] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 227 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 306 transition count 7936
Applied a total of 128 rules in 243 ms. Remains 306 /306 variables (removed 0) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/8064 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 124478 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 124478 steps, saw 47259 distinct states, run finished after 3014 ms. (steps per millisecond=41 ) properties seen :2
Running SMT prover for 4 properties.
[2022-06-11 19:11:30] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:11:30] [INFO ] Computed 3 place invariants in 13 ms
[2022-06-11 19:11:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:11:32] [INFO ] After 2370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 19:11:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:11:35] [INFO ] After 2727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 19:11:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:11:39] [INFO ] After 4693ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 19:11:43] [INFO ] After 7862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12285 ms.
[2022-06-11 19:11:55] [INFO ] After 22958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 83 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 187 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) 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 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 136569 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136569 steps, saw 51965 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 19:11:58] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:11:58] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 19:11:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:12:01] [INFO ] After 2366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 19:12:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:12:04] [INFO ] After 2652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 19:12:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:12:08] [INFO ] After 4623ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 19:12:11] [INFO ] After 7824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12960 ms.
[2022-06-11 19:12:24] [INFO ] After 23521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 45 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 196 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 193 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:12:25] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:12:25] [INFO ] Computed 3 place invariants in 20 ms
[2022-06-11 19:12:25] [INFO ] Implicit Places using invariants in 515 ms returned []
[2022-06-11 19:12:25] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:12:25] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-11 19:12:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:12:33] [INFO ] Implicit Places using invariants and state equation in 7832 ms returned []
Implicit Place search using SMT with State Equation took 8353 ms to find 0 implicit places.
[2022-06-11 19:12:34] [INFO ] Redundant transitions in 648 ms returned []
[2022-06-11 19:12:34] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:12:34] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 19:12:36] [INFO ] Dead Transitions using invariants and state equation in 2261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Graph (trivial) has 4432 edges and 306 vertex of which 24 / 306 are part of one of the 4 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions removed 2568 transitions
Ensure Unique test removed 2792 transitions
Reduce isomorphic transitions removed 5360 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 286 transition count 2575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 285 transition count 2575
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 285 transition count 2572
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 9 place count 282 transition count 2572
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 15 place count 279 transition count 2569
Drop transitions removed 418 transitions
Redundant transition composition rules discarded 418 transitions
Iterating global reduction 2 with 418 rules applied. Total rules applied 433 place count 279 transition count 2151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 433 place count 279 transition count 2150
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 435 place count 278 transition count 2150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 278 transition count 2150
Applied a total of 436 rules in 208 ms. Remains 278 /306 variables (removed 28) and now considering 2150/7936 (removed 5786) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2150 rows 278 cols
[2022-06-11 19:12:36] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-11 19:12:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:12:37] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 19:12:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:12:39] [INFO ] After 1894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 19:12:39] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-11 19:12:43] [INFO ] After 3783ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 19:12:54] [INFO ] After 14487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2546 ms.
[2022-06-11 19:12:56] [INFO ] After 19028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT p0)), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (G (NOT (AND p1 p3))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (F (AND (NOT p1) p3)), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 25 factoid took 1689 ms. Reduced automaton from 9 states, 30 edges and 4 AP to 9 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 366 ms :[(OR (AND p1 p3) (AND p0 p1)), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 354 ms :[(OR (AND p1 p3) (AND p0 p1)), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 340 ms :[(OR (AND p1 p3) (AND p0 p1)), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Product exploration explored 100000 steps with 19998 reset in 693 ms.
Product exploration explored 100000 steps with 20007 reset in 781 ms.
Built C files in :
/tmp/ltsmin9020639269620801198
[2022-06-11 19:13:01] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9020639269620801198
Running compilation step : cd /tmp/ltsmin9020639269620801198;'/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/ltsmin9020639269620801198;'/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/ltsmin9020639269620801198;'/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 8 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 32 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:13:04] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:13:04] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:13:04] [INFO ] Implicit Places using invariants in 622 ms returned []
[2022-06-11 19:13:04] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:13:04] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:13:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:13:14] [INFO ] Implicit Places using invariants and state equation in 9646 ms returned []
Implicit Place search using SMT with State Equation took 10289 ms to find 0 implicit places.
[2022-06-11 19:13:14] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:13:14] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:13:18] [INFO ] Dead Transitions using invariants and state equation in 4315 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin6803367522148010863
[2022-06-11 19:13:18] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6803367522148010863
Running compilation step : cd /tmp/ltsmin6803367522148010863;'/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/ltsmin6803367522148010863;'/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/ltsmin6803367522148010863;'/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 19:13:22] [INFO ] Flatten gal took : 462 ms
[2022-06-11 19:13:23] [INFO ] Flatten gal took : 458 ms
[2022-06-11 19:13:23] [INFO ] Time to serialize gal into /tmp/LTL7197538660272121248.gal : 37 ms
[2022-06-11 19:13:23] [INFO ] Time to serialize properties into /tmp/LTL12937089835026268224.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/LTL7197538660272121248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12937089835026268224.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/LTL7197538...267
Read 1 LTL properties
Checking formula 0 : !((F(!((F(G((!(G("((p104>=1)&&(l48>=1))")))U("((p122>=1)&&(l4>=1))"))))U(X(("((p112>=1)&&(l22>=1))")U(X("((p96>=1)&&(l51>=1))"))))))))
Formula 0 simplified : !F!(FG(!G"((p104>=1)&&(l48>=1))" U "((p122>=1)&&(l4>=1))") U X("((p112>=1)&&(l22>=1))" U X"((p96>=1)&&(l51>=1))"))
Detected timeout of ITS tools.
[2022-06-11 19:13:38] [INFO ] Flatten gal took : 261 ms
[2022-06-11 19:13:38] [INFO ] Applying decomposition
[2022-06-11 19:13:38] [INFO ] Flatten gal took : 259 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/graph11069179625397006100.txt' '-o' '/tmp/graph11069179625397006100.bin' '-w' '/tmp/graph11069179625397006100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11069179625397006100.bin' '-l' '-1' '-v' '-w' '/tmp/graph11069179625397006100.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:13:39] [INFO ] Decomposing Gal with order
[2022-06-11 19:13:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:13:39] [INFO ] Removed a total of 18619 redundant transitions.
[2022-06-11 19:13:39] [INFO ] Flatten gal took : 440 ms
[2022-06-11 19:13:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1061 labels/synchronizations in 215 ms.
[2022-06-11 19:13:39] [INFO ] Time to serialize gal into /tmp/LTL2254416088687037553.gal : 25 ms
[2022-06-11 19:13:39] [INFO ] Time to serialize properties into /tmp/LTL531904772546500987.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/LTL2254416088687037553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL531904772546500987.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/LTL2254416...244
Read 1 LTL properties
Checking formula 0 : !((F(!((F(G((!(G("((i4.u49.p104>=1)&&(i8.u63.l48>=1))")))U("((i4.u40.p122>=1)&&(i3.i1.u46.l4>=1))"))))U(X(("((i5.u52.p112>=1)&&(i2.i1....220
Formula 0 simplified : !F!(FG(!G"((i4.u49.p104>=1)&&(i8.u63.l48>=1))" U "((i4.u40.p122>=1)&&(i3.i1.u46.l4>=1))") U X("((i5.u52.p112>=1)&&(i2.i1.u54.l22>=1)...202
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2368076821064220805
[2022-06-11 19:13:55] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2368076821064220805
Running compilation step : cd /tmp/ltsmin2368076821064220805;'/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/ltsmin2368076821064220805;'/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/ltsmin2368076821064220805;'/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-b04-LTLFireability-07 finished in 303373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((!(((p1 U p2)||p3) U p1)||p0)))&&F(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 89 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:13:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:13:58] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:13:58] [INFO ] Implicit Places using invariants in 719 ms returned []
[2022-06-11 19:13:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:13:58] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:13:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:14:09] [INFO ] Implicit Places using invariants and state equation in 10503 ms returned []
Implicit Place search using SMT with State Equation took 11252 ms to find 0 implicit places.
[2022-06-11 19:14:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:14:09] [INFO ] Computed 1 place invariants in 25 ms
[2022-06-11 19:14:27] [INFO ] Dead Transitions using invariants and state equation in 18088 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 198 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p2), true, (AND p0 p1)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p0) (NOT p1)) (AND (NOT p0) p3 (NOT p1))), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p0 (NOT p1)) (AND p0 p3 (NOT p1))), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s57 1) (GEQ s300 1)), p0:(OR (LT s79 1) (LT s282 1)), p1:(AND (GEQ s17 1) (GEQ s258 1)), p3:(AND (GEQ s79 1) (GEQ s282 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]]
Product exploration explored 100000 steps with 2 reset in 476 ms.
Product exploration explored 100000 steps with 0 reset in 456 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 (NOT p2) p0 (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND (NOT p0) p3 (NOT p1))))), (X (OR p0 (NOT p1))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND p2 p0 (NOT p1)) (AND p0 p3 (NOT p1)))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND (NOT p0) p3 (NOT p1)))))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 530 ms. Reduced automaton from 5 states, 9 edges and 4 AP to 5 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p2), true, (AND p0 p1)]
Incomplete random walk after 10003 steps, including 3 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-11 19:14:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:14:29] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:14:29] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:14:30] [INFO ] After 726ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2022-06-11 19:14:30] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:14:36] [INFO ] After 5926ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2022-06-11 19:14:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:14:55] [INFO ] After 19006ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-06-11 19:14:55] [INFO ] After 19008ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 19:14:55] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 50 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 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 305 transition count 7874
Applied a total of 62 rules in 202 ms. Remains 305 /305 variables (removed 0) and now considering 7874/7936 (removed 62) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7874/7936 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 158552 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158552 steps, saw 57516 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-11 19:14:59] [INFO ] Flow matrix only has 2670 transitions (discarded 5204 similar events)
// Phase 1: matrix 2670 rows 305 cols
[2022-06-11 19:14:59] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:14:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:15:00] [INFO ] After 1799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 19:15:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:15:12] [INFO ] After 11751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 19:15:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:15:25] [INFO ] After 13166ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:15:25] [INFO ] After 13166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 19:15:25] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7874/7874 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7874/7874 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7874/7874 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7874/7874 transitions.
Applied a total of 0 rules in 227 ms. Remains 305 /305 variables (removed 0) and now considering 7874/7874 (removed 0) transitions.
[2022-06-11 19:15:26] [INFO ] Flow matrix only has 2670 transitions (discarded 5204 similar events)
// Phase 1: matrix 2670 rows 305 cols
[2022-06-11 19:15:26] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:15:26] [INFO ] Implicit Places using invariants in 413 ms returned []
[2022-06-11 19:15:26] [INFO ] Flow matrix only has 2670 transitions (discarded 5204 similar events)
// Phase 1: matrix 2670 rows 305 cols
[2022-06-11 19:15:26] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:15:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:15:34] [INFO ] Implicit Places using invariants and state equation in 8156 ms returned []
Implicit Place search using SMT with State Equation took 8584 ms to find 0 implicit places.
[2022-06-11 19:15:35] [INFO ] Redundant transitions in 664 ms returned []
[2022-06-11 19:15:35] [INFO ] Flow matrix only has 2670 transitions (discarded 5204 similar events)
// Phase 1: matrix 2670 rows 305 cols
[2022-06-11 19:15:35] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:15:37] [INFO ] Dead Transitions using invariants and state equation in 2115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7874/7874 transitions.
Graph (trivial) has 4592 edges and 305 vertex of which 26 / 305 are part of one of the 5 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions removed 2632 transitions
Ensure Unique test removed 2603 transitions
Reduce isomorphic transitions removed 5235 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 284 transition count 2638
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 283 transition count 2636
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 281 transition count 2635
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 281 transition count 2632
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 278 transition count 2632
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 277 transition count 2631
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 3 with 417 rules applied. Total rules applied 433 place count 277 transition count 2214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 433 place count 277 transition count 2213
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 435 place count 276 transition count 2213
Applied a total of 435 rules in 202 ms. Remains 276 /305 variables (removed 29) and now considering 2213/7874 (removed 5661) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2213 rows 276 cols
[2022-06-11 19:15:38] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:15:38] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:15:38] [INFO ] After 938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 19:15:39] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:15:41] [INFO ] After 2314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 19:15:41] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-11 19:15:54] [INFO ] After 12670ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:16:01] [INFO ] After 19925ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3932 ms.
[2022-06-11 19:16:05] [INFO ] After 26253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND (NOT p0) p3 (NOT p1))))), (X (OR p0 (NOT p1))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND p2 p0 (NOT p1)) (AND p0 p3 (NOT p1)))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND (NOT p0) p3 (NOT p1)))))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p2))), (G (OR p0 (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 14 factoid took 621 ms. Reduced automaton from 5 states, 9 edges and 4 AP to 5 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1 p2) (AND (NOT p0) p1 p3)), (NOT p2), true, p1]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1 p2) (AND (NOT p0) p1 p3)), (NOT p2), true, p1]
[2022-06-11 19:16:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:16:06] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:16:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 19:16:08] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2022-06-11 19:16:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 19:16:10] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:16:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 19:16:11] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2022-06-11 19:16:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:16:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 2498 ms returned sat
[2022-06-11 19:16:14] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 539 ms.
[2022-06-11 19:16:14] [INFO ] Added : 0 causal constraints over 0 iterations in 725 ms. Result :sat
Could not prove EG (NOT 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 33 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:16:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:16:14] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:16:15] [INFO ] Implicit Places using invariants in 444 ms returned []
[2022-06-11 19:16:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:16:15] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:16:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:16:22] [INFO ] Implicit Places using invariants and state equation in 7278 ms returned []
Implicit Place search using SMT with State Equation took 7722 ms to find 0 implicit places.
[2022-06-11 19:16:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:16:22] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:16:24] [INFO ] Dead Transitions using invariants and state equation in 2035 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 (NOT p2) p0 (NOT p3) (NOT p1)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3)))), (X (NOT p2)), true, (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3))))), (X (X (NOT p1))), (X (X (NOT (OR (AND p2 p0 (NOT p1)) (AND p0 (NOT p1) p3))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 5 states, 8 edges and 4 AP to 5 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), (NOT p2), true, p1]
Incomplete random walk after 10003 steps, including 3 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 131206 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131206 steps, saw 54446 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 19:16:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:16:28] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:16:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:16:38] [INFO ] After 9694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 19:16:38] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:16:49] [INFO ] After 11367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 19:16:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:17:03] [INFO ] After 13552ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:17:03] [INFO ] After 13554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-11 19:17:03] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 305 transition count 7874
Applied a total of 62 rules in 215 ms. Remains 305 /305 variables (removed 0) and now considering 7874/7936 (removed 62) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7874/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 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 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 139897 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139897 steps, saw 54621 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 19:17:06] [INFO ] Flow matrix only has 2670 transitions (discarded 5204 similar events)
// Phase 1: matrix 2670 rows 305 cols
[2022-06-11 19:17:06] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:17:06] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:17:14] [INFO ] After 8221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 19:17:15] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:17:25] [INFO ] After 10685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 19:17:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:17:40] [INFO ] After 14224ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 19:17:40] [INFO ] After 14225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-11 19:17:40] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7874/7874 transitions.
Applied a total of 0 rules in 209 ms. Remains 305 /305 variables (removed 0) and now considering 7874/7874 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7874/7874 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7874/7874 transitions.
Applied a total of 0 rules in 197 ms. Remains 305 /305 variables (removed 0) and now considering 7874/7874 (removed 0) transitions.
[2022-06-11 19:17:40] [INFO ] Flow matrix only has 2670 transitions (discarded 5204 similar events)
// Phase 1: matrix 2670 rows 305 cols
[2022-06-11 19:17:40] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:17:40] [INFO ] Implicit Places using invariants in 448 ms returned []
[2022-06-11 19:17:40] [INFO ] Flow matrix only has 2670 transitions (discarded 5204 similar events)
// Phase 1: matrix 2670 rows 305 cols
[2022-06-11 19:17:40] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:17:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:17:48] [INFO ] Implicit Places using invariants and state equation in 7655 ms returned []
Implicit Place search using SMT with State Equation took 8105 ms to find 0 implicit places.
[2022-06-11 19:17:49] [INFO ] Redundant transitions in 688 ms returned []
[2022-06-11 19:17:49] [INFO ] Flow matrix only has 2670 transitions (discarded 5204 similar events)
// Phase 1: matrix 2670 rows 305 cols
[2022-06-11 19:17:49] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:17:51] [INFO ] Dead Transitions using invariants and state equation in 1993 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7874/7874 transitions.
Graph (trivial) has 4592 edges and 305 vertex of which 26 / 305 are part of one of the 5 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions removed 2632 transitions
Ensure Unique test removed 2603 transitions
Reduce isomorphic transitions removed 5235 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 284 transition count 2638
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 283 transition count 2636
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 281 transition count 2635
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 281 transition count 2632
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 278 transition count 2632
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 277 transition count 2631
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 3 with 417 rules applied. Total rules applied 433 place count 277 transition count 2214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 433 place count 277 transition count 2213
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 435 place count 276 transition count 2213
Applied a total of 435 rules in 157 ms. Remains 276 /305 variables (removed 29) and now considering 2213/7874 (removed 5661) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2213 rows 276 cols
[2022-06-11 19:17:51] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:17:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:17:53] [INFO ] After 1851ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 19:17:53] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:17:56] [INFO ] After 3055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 19:17:56] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-11 19:18:09] [INFO ] After 12892ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 19:18:19] [INFO ] After 23094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4395 ms.
[2022-06-11 19:18:23] [INFO ] After 30630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) p0 (NOT p3) (NOT p1)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3)))), (X (NOT p2)), true, (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3))))), (X (X (NOT p1))), (X (X (NOT (OR (AND p2 p0 (NOT p1)) (AND p0 (NOT p1) p3))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 332 ms. Reduced automaton from 5 states, 8 edges and 4 AP to 5 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), (NOT p2), true, p1]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), (NOT p2), true, p1]
[2022-06-11 19:18:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:18:24] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:18:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 19:18:27] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2022-06-11 19:18:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 19:18:29] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 19:18:29] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2022-06-11 19:18:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:18:32] [INFO ] [Nat]Added 147 Read/Feed constraints in 2413 ms returned sat
[2022-06-11 19:18:32] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 506 ms.
[2022-06-11 19:18:32] [INFO ] Added : 0 causal constraints over 0 iterations in 682 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), (NOT p2), true, p1]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-08 finished in 275064 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(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 65 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:18:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:18:33] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:18:33] [INFO ] Implicit Places using invariants in 457 ms returned []
[2022-06-11 19:18:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:18:33] [INFO ] Computed 1 place invariants in 26 ms
[2022-06-11 19:18:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:18:40] [INFO ] Implicit Places using invariants and state equation in 7309 ms returned []
Implicit Place search using SMT with State Equation took 7767 ms to find 0 implicit places.
[2022-06-11 19:18:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:18:40] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:18:42] [INFO ] Dead Transitions using invariants and state equation in 1926 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 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-09 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:(AND (GEQ s109 1) (GEQ s304 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 81 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-09 finished in 9900 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(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 60 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:18:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:18:43] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:18:43] [INFO ] Implicit Places using invariants in 430 ms returned []
[2022-06-11 19:18:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:18:43] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:18:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:18:51] [INFO ] Implicit Places using invariants and state equation in 7570 ms returned []
Implicit Place search using SMT with State Equation took 8016 ms to find 0 implicit places.
[2022-06-11 19:18:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:18:51] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:18:53] [INFO ] Dead Transitions using invariants and state equation in 2100 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 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-11 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s43 1) (LT s262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 544 ms.
Product exploration explored 100000 steps with 0 reset in 527 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 : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 178229 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178229 steps, saw 67932 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:18:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:18:57] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 19:18:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:19:03] [INFO ] After 5314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:19:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:19:06] [INFO ] After 3211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:19:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:19:10] [INFO ] After 4045ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:19:12] [INFO ] After 6307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 599 ms.
[2022-06-11 19:19:13] [INFO ] After 10189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 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 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 211 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 198981 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198981 steps, saw 64994 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:19:16] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:19:16] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 19:19:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:19:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:19:19] [INFO ] After 2821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:19:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:19:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:19:20] [INFO ] After 1459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:19:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:19:23] [INFO ] After 2226ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:19:23] [INFO ] After 2522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 642 ms.
[2022-06-11 19:19:24] [INFO ] After 4703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 221 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 19:19:24] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:19:24] [INFO ] Computed 2 place invariants in 20 ms
[2022-06-11 19:19:24] [INFO ] Implicit Places using invariants in 463 ms returned []
[2022-06-11 19:19:24] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:19:25] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 19:19:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:19:33] [INFO ] Implicit Places using invariants and state equation in 8641 ms returned []
Implicit Place search using SMT with State Equation took 9119 ms to find 0 implicit places.
[2022-06-11 19:19:34] [INFO ] Redundant transitions in 678 ms returned []
[2022-06-11 19:19:34] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:19:34] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-11 19:19:36] [INFO ] Dead Transitions using invariants and state equation in 2118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 122 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1947 rows 269 cols
[2022-06-11 19:19:36] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-11 19:19:36] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-11 19:19:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:19:37] [INFO ] After 926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:19:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:19:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:19:38] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:19:38] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:19:39] [INFO ] After 1166ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:19:42] [INFO ] After 4288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1124 ms.
[2022-06-11 19:19:43] [INFO ] After 6263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:19:43] [INFO ] Flatten gal took : 59 ms
[2022-06-11 19:19:43] [INFO ] Flatten gal took : 59 ms
[2022-06-11 19:19:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16955719971697502043.gal : 5 ms
[2022-06-11 19:19:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10242025369248403302.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15794516203969514139;'/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/ReachabilityCardinality16955719971697502043.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10242025369248403302.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/ReachabilityCardinality10242025369248403302.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 260
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :260 after 13860
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13860 after 14360
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,16643,0.497435,19028,2,825,11,12270,6,0,3023,8997,0
Total reachable state count : 16643

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,64,0.499039,19028,2,301,11,12270,7,0,3027,8997,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 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 35 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:19:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:19:44] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:19:45] [INFO ] Implicit Places using invariants in 454 ms returned []
[2022-06-11 19:19:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:19:45] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:19:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:19:52] [INFO ] Implicit Places using invariants and state equation in 7385 ms returned []
Implicit Place search using SMT with State Equation took 7842 ms to find 0 implicit places.
[2022-06-11 19:19:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:19:52] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:19:54] [INFO ] Dead Transitions using invariants and state equation in 2059 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 189571 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189571 steps, saw 69437 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:19:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:19:58] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:19:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:20:03] [INFO ] After 5349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:20:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:20:06] [INFO ] After 3265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:20:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:20:10] [INFO ] After 4042ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:20:13] [INFO ] After 6340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 623 ms.
[2022-06-11 19:20:13] [INFO ] After 10302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 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 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) 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 207603 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207603 steps, saw 66194 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:20:16] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:20:16] [INFO ] Computed 2 place invariants in 20 ms
[2022-06-11 19:20:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:20:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:20:19] [INFO ] After 2847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:20:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:20:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:20:21] [INFO ] After 1435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:20:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:20:23] [INFO ] After 2211ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:20:23] [INFO ] After 2499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 623 ms.
[2022-06-11 19:20:24] [INFO ] After 4628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 204 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 19:20:24] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:20:24] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 19:20:25] [INFO ] Implicit Places using invariants in 462 ms returned []
[2022-06-11 19:20:25] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:20:25] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 19:20:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:20:33] [INFO ] Implicit Places using invariants and state equation in 8297 ms returned []
Implicit Place search using SMT with State Equation took 8784 ms to find 0 implicit places.
[2022-06-11 19:20:34] [INFO ] Redundant transitions in 656 ms returned []
[2022-06-11 19:20:34] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:20:34] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-11 19:20:36] [INFO ] Dead Transitions using invariants and state equation in 2158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 135 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1947 rows 269 cols
[2022-06-11 19:20:36] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-11 19:20:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:20:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:20:37] [INFO ] After 972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:20:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:20:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:20:38] [INFO ] After 747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:20:38] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:20:39] [INFO ] After 1147ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:20:42] [INFO ] After 4192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1118 ms.
[2022-06-11 19:20:43] [INFO ] After 6137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:20:43] [INFO ] Flatten gal took : 59 ms
[2022-06-11 19:20:43] [INFO ] Flatten gal took : 57 ms
[2022-06-11 19:20:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13087480923554535596.gal : 5 ms
[2022-06-11 19:20:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11715106183000127639.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10850953661640344966;'/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/ReachabilityCardinality13087480923554535596.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11715106183000127639.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/ReachabilityCardinality11715106183000127639.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 260
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :260 after 13860
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13860 after 14360
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,16643,0.517751,19288,2,825,11,12270,6,0,3023,8997,0
Total reachable state count : 16643

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,64,0.519432,19288,2,301,11,12270,7,0,3027,8997,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 480 ms.
Product exploration explored 100000 steps with 0 reset in 394 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (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 220 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:20:46] [INFO ] Redundant transitions in 652 ms returned []
[2022-06-11 19:20:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:20:46] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:20:48] [INFO ] Dead Transitions using invariants and state equation in 2100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Product exploration explored 100000 steps with 0 reset in 386 ms.
Product exploration explored 100000 steps with 1 reset in 389 ms.
Built C files in :
/tmp/ltsmin4173092506515309942
[2022-06-11 19:20:49] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4173092506515309942
Running compilation step : cd /tmp/ltsmin4173092506515309942;'/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/ltsmin4173092506515309942;'/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/ltsmin4173092506515309942;'/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 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 19:20:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:20:52] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:20:53] [INFO ] Implicit Places using invariants in 435 ms returned []
[2022-06-11 19:20:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:20:53] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:20:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:21:00] [INFO ] Implicit Places using invariants and state equation in 7004 ms returned []
Implicit Place search using SMT with State Equation took 7441 ms to find 0 implicit places.
[2022-06-11 19:21:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:21:00] [INFO ] Computed 1 place invariants in 24 ms
[2022-06-11 19:21:02] [INFO ] Dead Transitions using invariants and state equation in 2046 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin141408588359020733
[2022-06-11 19:21:02] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin141408588359020733
Running compilation step : cd /tmp/ltsmin141408588359020733;'/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/ltsmin141408588359020733;'/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/ltsmin141408588359020733;'/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 19:21:05] [INFO ] Flatten gal took : 221 ms
[2022-06-11 19:21:06] [INFO ] Flatten gal took : 257 ms
[2022-06-11 19:21:06] [INFO ] Time to serialize gal into /tmp/LTL5107808050884040270.gal : 16 ms
[2022-06-11 19:21:06] [INFO ] Time to serialize properties into /tmp/LTL13271296719501791452.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/LTL5107808050884040270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13271296719501791452.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/LTL5107808...267
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p43<1)||(l6<1))")))))
Formula 0 simplified : !XXG"((p43<1)||(l6<1))"
Detected timeout of ITS tools.
[2022-06-11 19:21:21] [INFO ] Flatten gal took : 223 ms
[2022-06-11 19:21:21] [INFO ] Applying decomposition
[2022-06-11 19:21:21] [INFO ] Flatten gal took : 230 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/graph14212957306341790980.txt' '-o' '/tmp/graph14212957306341790980.bin' '-w' '/tmp/graph14212957306341790980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14212957306341790980.bin' '-l' '-1' '-v' '-w' '/tmp/graph14212957306341790980.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:21:22] [INFO ] Decomposing Gal with order
[2022-06-11 19:21:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:21:22] [INFO ] Removed a total of 18365 redundant transitions.
[2022-06-11 19:21:22] [INFO ] Flatten gal took : 514 ms
[2022-06-11 19:21:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 986 labels/synchronizations in 179 ms.
[2022-06-11 19:21:22] [INFO ] Time to serialize gal into /tmp/LTL7757172798163193141.gal : 16 ms
[2022-06-11 19:21:22] [INFO ] Time to serialize properties into /tmp/LTL3400394989138396761.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/LTL7757172798163193141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3400394989138396761.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/LTL7757172...245
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i4.u14.p43<1)||(i3.i1.u47.l6<1))")))))
Formula 0 simplified : !XXG"((i4.u14.p43<1)||(i3.i1.u47.l6<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15127913350823495213
[2022-06-11 19:21:38] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15127913350823495213
Running compilation step : cd /tmp/ltsmin15127913350823495213;'/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/ltsmin15127913350823495213;'/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/ltsmin15127913350823495213;'/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-b04-LTLFireability-11 finished in 178053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(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 57 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:21:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:21:41] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:21:41] [INFO ] Implicit Places using invariants in 575 ms returned []
[2022-06-11 19:21:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:21:41] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:21:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:21:48] [INFO ] Implicit Places using invariants and state equation in 7133 ms returned []
Implicit Place search using SMT with State Equation took 7716 ms to find 0 implicit places.
[2022-06-11 19:21:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:21:48] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 19:21:50] [INFO ] Dead Transitions using invariants and state equation in 2110 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 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s41 1) (GEQ s260 1)), p0:(AND (GEQ s121 1) (GEQ s297 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 745 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA Szymanski-PT-b04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-12 finished in 10800 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))&&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 238 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:21:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:21:52] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:21:52] [INFO ] Implicit Places using invariants in 437 ms returned []
[2022-06-11 19:21:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:21:52] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:21:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:21:59] [INFO ] Implicit Places using invariants and state equation in 7080 ms returned []
Implicit Place search using SMT with State Equation took 7537 ms to find 0 implicit places.
[2022-06-11 19:22:00] [INFO ] Redundant transitions in 699 ms returned []
[2022-06-11 19:22:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:00] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:22:02] [INFO ] Dead Transitions using invariants and state equation in 2198 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 95 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s113 1) (LT s262 1)), p0:(AND (GEQ s104 1) (GEQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 672 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-13 finished in 11492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0 U (!p1||G(!p0)))&&!p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 238 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:22:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:03] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:22:04] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-06-11 19:22:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:04] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:22:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:22:11] [INFO ] Implicit Places using invariants and state equation in 7075 ms returned []
Implicit Place search using SMT with State Equation took 7524 ms to find 0 implicit places.
[2022-06-11 19:22:11] [INFO ] Redundant transitions in 668 ms returned []
[2022-06-11 19:22:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:11] [INFO ] Computed 1 place invariants in 59 ms
[2022-06-11 19:22:13] [INFO ] Dead Transitions using invariants and state equation in 1971 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 39 ms :[p0]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-14 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 s33 1) (GEQ s263 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 0 reset in 585 ms.
Product exploration explored 100000 steps with 2 reset in 659 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 83 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 45 ms :[p0]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 176942 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176942 steps, saw 67753 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:22:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:18] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:22:18] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:22:27] [INFO ] After 9064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:22:27] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:22:30] [INFO ] After 2904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:22:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:22:38] [INFO ] After 8659ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:22:39] [INFO ] After 9246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1613 ms.
[2022-06-11 19:22:41] [INFO ] After 13831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 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 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Finished Best-First random walk after 3401 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=680 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 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 47 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 197 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:22:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:41] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:22:42] [INFO ] Implicit Places using invariants in 425 ms returned []
[2022-06-11 19:22:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:42] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:22:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:22:49] [INFO ] Implicit Places using invariants and state equation in 6860 ms returned []
Implicit Place search using SMT with State Equation took 7293 ms to find 0 implicit places.
[2022-06-11 19:22:49] [INFO ] Redundant transitions in 638 ms returned []
[2022-06-11 19:22:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:49] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:22:51] [INFO ] Dead Transitions using invariants and state equation in 2187 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 96 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 40 ms :[p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 3532 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=588 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 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 82 ms :[p0]
Stuttering acceptance computed with spot in 26 ms :[p0]
Stuttering acceptance computed with spot in 40 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 537 ms.
Product exploration explored 100000 steps with 0 reset in 502 ms.
Built C files in :
/tmp/ltsmin4134378246913837327
[2022-06-11 19:22:53] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:22:53] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4134378246913837327
Running compilation step : cd /tmp/ltsmin4134378246913837327;'/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/ltsmin4134378246913837327;'/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/ltsmin4134378246913837327;'/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 182 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:22:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:56] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:22:57] [INFO ] Implicit Places using invariants in 429 ms returned []
[2022-06-11 19:22:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:22:57] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:22:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:23:04] [INFO ] Implicit Places using invariants and state equation in 7582 ms returned []
Implicit Place search using SMT with State Equation took 8021 ms to find 0 implicit places.
[2022-06-11 19:23:05] [INFO ] Redundant transitions in 686 ms returned []
[2022-06-11 19:23:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:23:05] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:23:07] [INFO ] Dead Transitions using invariants and state equation in 2111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin18169253059175649040
[2022-06-11 19:23:07] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:23:07] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18169253059175649040
Running compilation step : cd /tmp/ltsmin18169253059175649040;'/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/ltsmin18169253059175649040;'/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/ltsmin18169253059175649040;'/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 19:23:11] [INFO ] Flatten gal took : 263 ms
[2022-06-11 19:23:11] [INFO ] Flatten gal took : 327 ms
[2022-06-11 19:23:11] [INFO ] Time to serialize gal into /tmp/LTL940894725842919821.gal : 17 ms
[2022-06-11 19:23:11] [INFO ] Time to serialize properties into /tmp/LTL5356413531648746604.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/LTL940894725842919821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5356413531648746604.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/LTL9408947...265
Read 1 LTL properties
Checking formula 0 : !((F(G(((!("((p33>=1)&&(l7>=1))"))U((!("((p43>=1)&&(l3>=1))"))||(G(!("((p33>=1)&&(l7>=1))")))))&&("((p33<1)||(l7<1))")))))
Formula 0 simplified : !FG("((p33<1)||(l7<1))" & (!"((p33>=1)&&(l7>=1))" U (!"((p43>=1)&&(l3>=1))" | G!"((p33>=1)&&(l7>=1))")))
Detected timeout of ITS tools.
[2022-06-11 19:23:26] [INFO ] Flatten gal took : 227 ms
[2022-06-11 19:23:26] [INFO ] Applying decomposition
[2022-06-11 19:23:26] [INFO ] Flatten gal took : 237 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/graph11196426230038215618.txt' '-o' '/tmp/graph11196426230038215618.bin' '-w' '/tmp/graph11196426230038215618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11196426230038215618.bin' '-l' '-1' '-v' '-w' '/tmp/graph11196426230038215618.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:23:27] [INFO ] Decomposing Gal with order
[2022-06-11 19:23:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:23:27] [INFO ] Removed a total of 18142 redundant transitions.
[2022-06-11 19:23:27] [INFO ] Flatten gal took : 425 ms
[2022-06-11 19:23:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1176 labels/synchronizations in 214 ms.
[2022-06-11 19:23:28] [INFO ] Time to serialize gal into /tmp/LTL6152487970474540827.gal : 22 ms
[2022-06-11 19:23:28] [INFO ] Time to serialize properties into /tmp/LTL17691294393527303982.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/LTL6152487970474540827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17691294393527303982.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/LTL6152487...246
Read 1 LTL properties
Checking formula 0 : !((F(G(((!("((i4.u11.p33>=1)&&(i3.i1.u47.l7>=1))"))U((!("((i3.i1.u14.p43>=1)&&(i3.i0.u45.l3>=1))"))||(G(!("((i4.u11.p33>=1)&&(i3.i1.u4...214
Formula 0 simplified : !FG("((i4.u11.p33<1)||(i3.i1.u47.l7<1))" & (!"((i4.u11.p33>=1)&&(i3.i1.u47.l7>=1))" U (!"((i3.i1.u14.p43>=1)&&(i3.i0.u45.l3>=1))" | ...198
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11058492532455655234
[2022-06-11 19:23:43] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11058492532455655234
Running compilation step : cd /tmp/ltsmin11058492532455655234;'/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/ltsmin11058492532455655234;'/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/ltsmin11058492532455655234;'/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-b04-LTLFireability-14 finished in 103040 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||F(p1))))'
Support contains 6 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 19:23:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:23:46] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:23:47] [INFO ] Implicit Places using invariants in 456 ms returned []
[2022-06-11 19:23:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:23:47] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:23:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:23:54] [INFO ] Implicit Places using invariants and state equation in 7473 ms returned []
Implicit Place search using SMT with State Equation took 7932 ms to find 0 implicit places.
[2022-06-11 19:23:55] [INFO ] Redundant transitions in 658 ms returned []
[2022-06-11 19:23:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:23:55] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:23:57] [INFO ] Dead Transitions using invariants and state equation in 1948 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-15 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 (AND (OR (LT s115 1) (LT s261 1)) (OR (LT s50 1) (LT s304 1))) (AND (GEQ s115 1) (GEQ s261 1))), p1:(OR (LT s47 1) (LT s274 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 1 reset in 580 ms.
Product exploration explored 100000 steps with 1 reset in 597 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 110 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 180811 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180811 steps, saw 68306 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:24:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:24:01] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 19:24:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:24:02] [INFO ] After 695ms 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 1 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 128 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Szymanski-PT-b04-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b04-LTLFireability-15 finished in 16212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(X(p0))||F(p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(G((!G(p0) U p1))) U X((p2 U X(p3))))))'
Found a CL insensitive property : Szymanski-PT-b04-LTLFireability-07
Stuttering acceptance computed with spot in 422 ms :[p3, p3, (AND p1 p3), (AND p1 p3), p3, false, false, (AND p1 p3), (AND (NOT p0) p1 p3)]
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 78 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:24:05] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:24:05] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:24:05] [INFO ] Implicit Places using invariants in 453 ms returned []
[2022-06-11 19:24:05] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:24:05] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:24:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:24:11] [INFO ] Implicit Places using invariants and state equation in 5511 ms returned []
Implicit Place search using SMT with State Equation took 5966 ms to find 0 implicit places.
[2022-06-11 19:24:11] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:24:11] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:24:13] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=2 dest: 7}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={2} source=2 dest: 8}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(OR (AND (NOT p0) p3) (AND p1 p3)), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 3}, { cond=p3, acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={0, 1} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 2} source=6 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1, 2} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={2} source=6 dest: 8}, { cond=(AND p0 p1 (NOT p3)), acceptance={1, 2} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=7 dest: 2}, { cond=(AND p1 p3), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0, 2} source=7 dest: 7}, { cond=(AND p1 p3), acceptance={0, 1, 2} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p3), acceptance={2} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={0, 1} source=8 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1 p3), acceptance={1} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0, 2} source=8 dest: 7}, { cond=(AND (NOT p0) p1 p3), acceptance={0, 1, 2} source=8 dest: 7}, { cond=(AND p0 (NOT p1) p3), acceptance={2} source=8 dest: 8}, { cond=(AND p0 p1 p3), acceptance={1, 2} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s104 1) (GEQ s302 1)), p1:(AND (GEQ s122 1) (GEQ s260 1)), p2:(AND (GEQ s112 1) (GEQ s278 1)), p3:(AND (GEQ s96 1) (GEQ s305 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22272 reset in 853 ms.
Product exploration explored 100000 steps with 22292 reset in 803 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 p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (OR (NOT p0) p1)), (X (X (NOT (OR (AND (NOT p0) p3) (AND p1 p3))))), true, (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1224 ms. Reduced automaton from 9 states, 43 edges and 4 AP to 12 states, 51 edges and 4 AP.
Stuttering acceptance computed with spot in 560 ms :[(AND p1 p3), (AND p1 p3), (AND p1 p3), false, (AND p1 p3), (AND (NOT p0) p1 p3), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 18) 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 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 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 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) 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 18) 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 18) 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 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 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 8 ms. (steps per millisecond=125 ) 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 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 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 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 114930 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{0=1, 2=1, 12=1}
Probabilistic random walk after 114930 steps, saw 44725 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :3
Running SMT prover for 15 properties.
[2022-06-11 19:24:20] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:24:20] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:24:20] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:24:21] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2022-06-11 19:24:21] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:24:41] [INFO ] After 20242ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :8
[2022-06-11 19:24:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:24:46] [INFO ] After 4600ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :7 sat :7
[2022-06-11 19:24:46] [INFO ] After 4601ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :7
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 19:24:46] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :7
Fused 15 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 306 transition count 7936
Applied a total of 128 rules in 211 ms. Remains 306 /306 variables (removed 0) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-11 19:24:46] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:24:46] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 19:24:46] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:24:49] [INFO ] After 2145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 19:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 19:24:54] [INFO ] After 5726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 19:24:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:25:12] [INFO ] After 17951ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 19:25:14] [INFO ] After 19192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 19:25:14] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 131 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 203 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 128873 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128873 steps, saw 49748 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 5 properties.
[2022-06-11 19:25:17] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:25:17] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-11 19:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 19:25:19] [INFO ] After 2188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 19:25:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:25:25] [INFO ] After 5894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 19:25:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:25:44] [INFO ] After 18116ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 19:25:45] [INFO ] After 19015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-11 19:25:45] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 146 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 193 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 188 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:25:45] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:25:45] [INFO ] Computed 3 place invariants in 18 ms
[2022-06-11 19:25:46] [INFO ] Implicit Places using invariants in 499 ms returned []
[2022-06-11 19:25:46] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:25:46] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-11 19:25:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:25:53] [INFO ] Implicit Places using invariants and state equation in 7101 ms returned []
Implicit Place search using SMT with State Equation took 7623 ms to find 0 implicit places.
[2022-06-11 19:25:53] [INFO ] Redundant transitions in 672 ms returned []
[2022-06-11 19:25:53] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:25:53] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-11 19:25:56] [INFO ] Dead Transitions using invariants and state equation in 2339 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Graph (trivial) has 4432 edges and 306 vertex of which 24 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 2568 transitions
Ensure Unique test removed 2792 transitions
Reduce isomorphic transitions removed 5360 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 286 transition count 2575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 285 transition count 2575
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 285 transition count 2572
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 9 place count 282 transition count 2572
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 15 place count 279 transition count 2569
Drop transitions removed 418 transitions
Redundant transition composition rules discarded 418 transitions
Iterating global reduction 2 with 418 rules applied. Total rules applied 433 place count 279 transition count 2151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 433 place count 279 transition count 2150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 435 place count 278 transition count 2150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 278 transition count 2150
Applied a total of 436 rules in 184 ms. Remains 278 /306 variables (removed 28) and now considering 2150/7936 (removed 5786) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 2150 rows 278 cols
[2022-06-11 19:25:56] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-11 19:25:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:25:56] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 19:25:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:25:59] [INFO ] After 2909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 19:25:59] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-11 19:26:03] [INFO ] After 4344ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-11 19:26:12] [INFO ] After 12635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 13392 ms.
[2022-06-11 19:26:25] [INFO ] After 29034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (OR (NOT p0) p1)), (X (X (NOT (OR (AND (NOT p0) p3) (AND p1 p3))))), true, (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p3) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p3) p1 p2))), (G (NOT (AND p3 p1))), (G (NOT (AND p0 p3 (NOT p1)))), (G (NOT (AND p0 p3 p1))), (G (NOT (AND (NOT p0) p3 p1))), (G (NOT (AND p0 (NOT p3) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (AND (NOT p0) p3 (NOT p1))), (F (AND (NOT p3) p1)), (F (AND (NOT p0) (NOT p3) p1))]
Knowledge based reduction with 19 factoid took 1452 ms. Reduced automaton from 12 states, 51 edges and 4 AP to 9 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 908 ms :[(AND p1 p3), (AND p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 418 ms :[(AND p1 p3), (AND p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Support contains 8 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 29 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:26:28] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:26:28] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:26:28] [INFO ] Implicit Places using invariants in 426 ms returned []
[2022-06-11 19:26:28] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:26:28] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:26:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:26:34] [INFO ] Implicit Places using invariants and state equation in 5772 ms returned []
Implicit Place search using SMT with State Equation took 6244 ms to find 0 implicit places.
[2022-06-11 19:26:34] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:26:34] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:26:36] [INFO ] Dead Transitions using invariants and state equation in 2228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
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 p0) (NOT p1) (NOT p3) (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT p0)), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1910 ms. Reduced automaton from 9 states, 30 edges and 4 AP to 9 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 350 ms :[(AND p1 p3), (AND p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 120048 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{0=1, 2=1, 5=1, 10=1, 12=1}
Probabilistic random walk after 120048 steps, saw 46499 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :5
Running SMT prover for 8 properties.
[2022-06-11 19:26:43] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:26:43] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:26:43] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:26:43] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-11 19:26:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:27:00] [INFO ] After 17193ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2022-06-11 19:27:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:27:08] [INFO ] After 7684ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2022-06-11 19:27:08] [INFO ] After 7686ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 19:27:08] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 306 transition count 7936
Applied a total of 128 rules in 211 ms. Remains 306 /306 variables (removed 0) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/8064 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 131928 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131928 steps, saw 50243 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 6 properties.
[2022-06-11 19:27:11] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:27:11] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-11 19:27:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 19:27:12] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 19:27:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:27:21] [INFO ] After 9481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-11 19:27:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:27:37] [INFO ] After 15425ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 19:27:37] [INFO ] After 15426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 19:27:37] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 136 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 205 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 186 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:27:37] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:27:37] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-11 19:27:38] [INFO ] Implicit Places using invariants in 516 ms returned []
[2022-06-11 19:27:38] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:27:38] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-11 19:27:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:27:45] [INFO ] Implicit Places using invariants and state equation in 7798 ms returned []
Implicit Place search using SMT with State Equation took 8317 ms to find 0 implicit places.
[2022-06-11 19:27:46] [INFO ] Redundant transitions in 703 ms returned []
[2022-06-11 19:27:46] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:27:46] [INFO ] Computed 3 place invariants in 20 ms
[2022-06-11 19:27:49] [INFO ] Dead Transitions using invariants and state equation in 2382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Graph (trivial) has 4432 edges and 306 vertex of which 24 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 2568 transitions
Ensure Unique test removed 2792 transitions
Reduce isomorphic transitions removed 5360 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 286 transition count 2575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 285 transition count 2575
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 285 transition count 2572
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 282 transition count 2572
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 15 place count 279 transition count 2569
Drop transitions removed 418 transitions
Redundant transition composition rules discarded 418 transitions
Iterating global reduction 2 with 418 rules applied. Total rules applied 433 place count 279 transition count 2151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 433 place count 279 transition count 2150
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 435 place count 278 transition count 2150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 278 transition count 2150
Applied a total of 436 rules in 201 ms. Remains 278 /306 variables (removed 28) and now considering 2150/7936 (removed 5786) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2150 rows 278 cols
[2022-06-11 19:27:49] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-11 19:27:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:27:49] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 19:27:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:27:51] [INFO ] After 2360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-11 19:27:51] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-11 19:27:55] [INFO ] After 3837ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-11 19:28:04] [INFO ] After 12870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 15439 ms.
[2022-06-11 19:28:20] [INFO ] After 30768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT p0)), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (G (NOT (AND p1 p3))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p3)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (F (AND (NOT p1) p3)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
Knowledge based reduction with 25 factoid took 1706 ms. Reduced automaton from 9 states, 30 edges and 4 AP to 9 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 397 ms :[(OR (AND p1 p3) (AND p0 p1)), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 403 ms :[(OR (AND p1 p3) (AND p0 p1)), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 421 ms :[(OR (AND p1 p3) (AND p0 p1)), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), (OR (AND p1 p3) (AND p0 p1)), (AND (NOT p0) p1 p3), false, false, false, (AND (NOT p0) p1 p3)]
Product exploration explored 100000 steps with 20008 reset in 695 ms.
Product exploration explored 100000 steps with 20089 reset in 675 ms.
Built C files in :
/tmp/ltsmin14262183228269405184
[2022-06-11 19:28:24] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14262183228269405184
Running compilation step : cd /tmp/ltsmin14262183228269405184;'/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/ltsmin14262183228269405184;'/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/ltsmin14262183228269405184;'/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 8 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 33 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:28:27] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:28:27] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:28:28] [INFO ] Implicit Places using invariants in 448 ms returned []
[2022-06-11 19:28:28] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:28:28] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:28:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:28:33] [INFO ] Implicit Places using invariants and state equation in 5025 ms returned []
Implicit Place search using SMT with State Equation took 5489 ms to find 0 implicit places.
[2022-06-11 19:28:33] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:28:33] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:28:37] [INFO ] Dead Transitions using invariants and state equation in 4158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin7180396859169962590
[2022-06-11 19:28:37] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7180396859169962590
Running compilation step : cd /tmp/ltsmin7180396859169962590;'/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/ltsmin7180396859169962590;'/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/ltsmin7180396859169962590;'/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 19:28:40] [INFO ] Flatten gal took : 251 ms
[2022-06-11 19:28:41] [INFO ] Flatten gal took : 259 ms
[2022-06-11 19:28:41] [INFO ] Time to serialize gal into /tmp/LTL8795559733735103399.gal : 37 ms
[2022-06-11 19:28:41] [INFO ] Time to serialize properties into /tmp/LTL8660743766876902240.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/LTL8795559733735103399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8660743766876902240.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/LTL8795559...266
Read 1 LTL properties
Checking formula 0 : !((F(!((F(G((!(G("((p104>=1)&&(l48>=1))")))U("((p122>=1)&&(l4>=1))"))))U(X(("((p112>=1)&&(l22>=1))")U(X("((p96>=1)&&(l51>=1))"))))))))
Formula 0 simplified : !F!(FG(!G"((p104>=1)&&(l48>=1))" U "((p122>=1)&&(l4>=1))") U X("((p112>=1)&&(l22>=1))" U X"((p96>=1)&&(l51>=1))"))
Detected timeout of ITS tools.
[2022-06-11 19:28:56] [INFO ] Flatten gal took : 248 ms
[2022-06-11 19:28:56] [INFO ] Applying decomposition
[2022-06-11 19:28:56] [INFO ] Flatten gal took : 260 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/graph4544776508160484801.txt' '-o' '/tmp/graph4544776508160484801.bin' '-w' '/tmp/graph4544776508160484801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4544776508160484801.bin' '-l' '-1' '-v' '-w' '/tmp/graph4544776508160484801.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:28:57] [INFO ] Decomposing Gal with order
[2022-06-11 19:28:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:28:57] [INFO ] Removed a total of 18619 redundant transitions.
[2022-06-11 19:28:57] [INFO ] Flatten gal took : 484 ms
[2022-06-11 19:28:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1019 labels/synchronizations in 263 ms.
[2022-06-11 19:28:58] [INFO ] Time to serialize gal into /tmp/LTL776166285157237295.gal : 334 ms
[2022-06-11 19:28:58] [INFO ] Time to serialize properties into /tmp/LTL3991307714477254733.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/LTL776166285157237295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3991307714477254733.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/LTL7761662...244
Read 1 LTL properties
Checking formula 0 : !((F(!((F(G((!(G("((i3.u49.p104>=1)&&(i9.u63.l48>=1))")))U("((i8.u40.p122>=1)&&(i2.i1.u46.l4>=1))"))))U(X(("((i5.u52.p112>=1)&&(i6.u54...217
Formula 0 simplified : !F!(FG(!G"((i3.u49.p104>=1)&&(i9.u63.l48>=1))" U "((i8.u40.p122>=1)&&(i2.i1.u46.l4>=1))") U X("((i5.u52.p112>=1)&&(i6.u54.l22>=1))" ...199
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17517771175278018997
[2022-06-11 19:29:13] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17517771175278018997
Running compilation step : cd /tmp/ltsmin17517771175278018997;'/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/ltsmin17517771175278018997;'/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/ltsmin17517771175278018997;'/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-b04-LTLFireability-07 finished in 314008 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a SL insensitive property : Szymanski-PT-b04-LTLFireability-11
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 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 166 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:29:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:29:17] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:29:17] [INFO ] Implicit Places using invariants in 637 ms returned []
[2022-06-11 19:29:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:29:17] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:29:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:29:27] [INFO ] Implicit Places using invariants and state equation in 9506 ms returned []
Implicit Place search using SMT with State Equation took 10151 ms to find 0 implicit places.
[2022-06-11 19:29:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:29:27] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:29:29] [INFO ] Dead Transitions using invariants and state equation in 1909 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-b04-LTLFireability-11 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s43 1) (LT s262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 520 ms.
Product exploration explored 100000 steps with 0 reset in 502 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 : []
Knowledge based reduction with 2 factoid took 313 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10003 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 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187216 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187216 steps, saw 69228 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:29:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:29:33] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:29:33] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:29:39] [INFO ] After 5413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:29:39] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:29:42] [INFO ] After 3427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:29:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:29:46] [INFO ] After 4285ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:29:49] [INFO ] After 6524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 583 ms.
[2022-06-11 19:29:49] [INFO ] After 10604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 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 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 222 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) 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 199928 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199928 steps, saw 65153 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:29:53] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:29:53] [INFO ] Computed 2 place invariants in 19 ms
[2022-06-11 19:29:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:29:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:29:55] [INFO ] After 2723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:29:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:29:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2022-06-11 19:29:57] [INFO ] After 1421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:29:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:29:59] [INFO ] After 2153ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:29:59] [INFO ] After 2443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 604 ms.
[2022-06-11 19:30:00] [INFO ] After 4546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 217 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 194 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 19:30:00] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:30:00] [INFO ] Computed 2 place invariants in 20 ms
[2022-06-11 19:30:01] [INFO ] Implicit Places using invariants in 491 ms returned []
[2022-06-11 19:30:01] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:30:01] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-11 19:30:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:30:08] [INFO ] Implicit Places using invariants and state equation in 7367 ms returned []
Implicit Place search using SMT with State Equation took 7859 ms to find 0 implicit places.
[2022-06-11 19:30:09] [INFO ] Redundant transitions in 652 ms returned []
[2022-06-11 19:30:09] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:30:09] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 19:30:11] [INFO ] Dead Transitions using invariants and state equation in 2101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 124 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1947 rows 269 cols
[2022-06-11 19:30:11] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-11 19:30:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 19:30:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:30:12] [INFO ] After 942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:30:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 19:30:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:30:13] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:30:13] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:30:14] [INFO ] After 1152ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:30:17] [INFO ] After 4217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1111 ms.
[2022-06-11 19:30:18] [INFO ] After 6155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:30:18] [INFO ] Flatten gal took : 61 ms
[2022-06-11 19:30:18] [INFO ] Flatten gal took : 61 ms
[2022-06-11 19:30:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12055619770929607931.gal : 5 ms
[2022-06-11 19:30:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3555850481759225097.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10248889619107398151;'/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/ReachabilityCardinality12055619770929607931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3555850481759225097.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...320
Loading property file /tmp/ReachabilityCardinality3555850481759225097.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 260
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :260 after 13860
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13860 after 14360
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,16643,0.492817,19288,2,825,11,12270,6,0,3023,8997,0
Total reachable state count : 16643

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,64,0.494449,19288,2,301,11,12270,7,0,3027,8997,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 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 33 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:30:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:30:19] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 19:30:20] [INFO ] Implicit Places using invariants in 463 ms returned []
[2022-06-11 19:30:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:30:20] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:30:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:30:26] [INFO ] Implicit Places using invariants and state equation in 6411 ms returned []
Implicit Place search using SMT with State Equation took 6875 ms to find 0 implicit places.
[2022-06-11 19:30:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:30:26] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 19:30:28] [INFO ] Dead Transitions using invariants and state equation in 2078 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 185444 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185444 steps, saw 68924 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:30:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:30:31] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:30:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:30:36] [INFO ] After 5126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:30:37] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:30:40] [INFO ] After 3226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:30:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:30:44] [INFO ] After 3934ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:30:46] [INFO ] After 6155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 588 ms.
[2022-06-11 19:30:47] [INFO ] After 10044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 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 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 231 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 201155 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201155 steps, saw 65306 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:30:50] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:30:50] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 19:30:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 19:30:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:30:53] [INFO ] After 2740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:30:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 19:30:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 19:30:54] [INFO ] After 1369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:30:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:30:56] [INFO ] After 2148ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:30:56] [INFO ] After 2429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 603 ms.
[2022-06-11 19:30:57] [INFO ] After 4473ms 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, 7809/7809 transitions.
Applied a total of 0 rules in 209 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 19:30:57] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:30:57] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-11 19:30:58] [INFO ] Implicit Places using invariants in 455 ms returned []
[2022-06-11 19:30:58] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:30:58] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-11 19:30:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:31:04] [INFO ] Implicit Places using invariants and state equation in 6458 ms returned []
Implicit Place search using SMT with State Equation took 6923 ms to find 0 implicit places.
[2022-06-11 19:31:05] [INFO ] Redundant transitions in 622 ms returned []
[2022-06-11 19:31:05] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:31:05] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-11 19:31:07] [INFO ] Dead Transitions using invariants and state equation in 2105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 136 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1947 rows 269 cols
[2022-06-11 19:31:07] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-11 19:31:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 19:31:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:31:08] [INFO ] After 915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:31:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 19:31:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:31:09] [INFO ] After 746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:31:09] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:31:10] [INFO ] After 1157ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:31:13] [INFO ] After 4171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1098 ms.
[2022-06-11 19:31:14] [INFO ] After 6069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:31:14] [INFO ] Flatten gal took : 58 ms
[2022-06-11 19:31:14] [INFO ] Flatten gal took : 57 ms
[2022-06-11 19:31:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11952422713492942160.gal : 5 ms
[2022-06-11 19:31:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11198132661158836936.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14813353298585433794;'/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/ReachabilityCardinality11952422713492942160.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11198132661158836936.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/ReachabilityCardinality11198132661158836936.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 260
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :260 after 13860
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13860 after 14360
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,16643,0.485916,19288,2,825,11,12270,6,0,3023,8997,0
Total reachable state count : 16643

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,64,0.487617,19288,2,301,11,12270,7,0,3027,8997,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 464 ms.
Entered a terminal (fully accepting) state of product in 721 steps with 3 reset in 6 ms.
Treatment of property Szymanski-PT-b04-LTLFireability-11 finished in 119529 ms.
FORMULA Szymanski-PT-b04-LTLFireability-11 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0 U (!p1||G(!p0)))&&!p0))))'
[2022-06-11 19:31:16] [INFO ] Flatten gal took : 243 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4267562948062188460
[2022-06-11 19:31:16] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:31:16] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4267562948062188460
Running compilation step : cd /tmp/ltsmin4267562948062188460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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 19:31:16] [INFO ] Applying decomposition
[2022-06-11 19:31:17] [INFO ] Flatten gal took : 227 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/graph14100639382989112969.txt' '-o' '/tmp/graph14100639382989112969.bin' '-w' '/tmp/graph14100639382989112969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14100639382989112969.bin' '-l' '-1' '-v' '-w' '/tmp/graph14100639382989112969.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:31:17] [INFO ] Decomposing Gal with order
[2022-06-11 19:31:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:31:18] [INFO ] Removed a total of 18428 redundant transitions.
[2022-06-11 19:31:18] [INFO ] Flatten gal took : 442 ms
[2022-06-11 19:31:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1115 labels/synchronizations in 212 ms.
[2022-06-11 19:31:18] [INFO ] Time to serialize gal into /tmp/LTLFireability3823253672652213910.gal : 24 ms
[2022-06-11 19:31:18] [INFO ] Time to serialize properties into /tmp/LTLFireability14974331106248029376.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/LTLFireability3823253672652213910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14974331106248029376.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 4 LTL properties
Checking formula 0 : !((G(F(X(F("(((i4.u50.p48<1)||(i7.u59.l40<1))||((i7.u40.p121>=1)&&(i7.u60.l43>=1)))"))))))
Formula 0 simplified : !GFXF"(((i4.u50.p48<1)||(i7.u59.l40<1))||((i7.u40.p121>=1)&&(i7.u60.l43>=1)))"
Compilation finished in 33481 ms.
Running link step : cd /tmp/ltsmin4267562948062188460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 116 ms.
Running LTSmin : cd /tmp/ltsmin4267562948062188460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 85688 ms.
FORMULA Szymanski-PT-b04-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4267562948062188460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X((<>(X((LTLAPp1==true)))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 219291 ms.
FORMULA Szymanski-PT-b04-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4267562948062188460;'/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' '<>(!(<>([](() U (LTLAPp4==true)))) U X(((LTLAPp5==true) U X((LTLAPp6==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin4267562948062188460;'/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' '<>(!(<>([](() U (LTLAPp4==true)))) U X(((LTLAPp5==true) U X((LTLAPp6==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4267562948062188460;'/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' '<>([](((!(LTLAPp8==true) U (!(LTLAPp9==true)||[](!(LTLAPp8==true))))&&!(LTLAPp8==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-b04"
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-b04, 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-165472283101044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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