Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 25 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 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 DLCround-PT-09b-LTLFireability-00
FORMULA_NAME DLCround-PT-09b-LTLFireability-01
FORMULA_NAME DLCround-PT-09b-LTLFireability-02
FORMULA_NAME DLCround-PT-09b-LTLFireability-03
FORMULA_NAME DLCround-PT-09b-LTLFireability-04
FORMULA_NAME DLCround-PT-09b-LTLFireability-05
FORMULA_NAME DLCround-PT-09b-LTLFireability-06
FORMULA_NAME DLCround-PT-09b-LTLFireability-07
FORMULA_NAME DLCround-PT-09b-LTLFireability-08
FORMULA_NAME DLCround-PT-09b-LTLFireability-09
FORMULA_NAME DLCround-PT-09b-LTLFireability-10
FORMULA_NAME DLCround-PT-09b-LTLFireability-11
FORMULA_NAME DLCround-PT-09b-LTLFireability-12
FORMULA_NAME DLCround-PT-09b-LTLFireability-13
FORMULA_NAME DLCround-PT-09b-LTLFireability-14
FORMULA_NAME DLCround-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678310578632

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-09b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 21:23:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 21:23:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:23:01] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2023-03-08 21:23:01] [INFO ] Transformed 3495 places.
[2023-03-08 21:23:01] [INFO ] Transformed 5439 transitions.
[2023-03-08 21:23:01] [INFO ] Found NUPN structural information;
[2023-03-08 21:23:01] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-09b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 3495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Discarding 618 places :
Symmetric choice reduction at 0 with 618 rule applications. Total rules 618 place count 2877 transition count 4821
Iterating global reduction 0 with 618 rules applied. Total rules applied 1236 place count 2877 transition count 4821
Discarding 499 places :
Symmetric choice reduction at 0 with 499 rule applications. Total rules 1735 place count 2378 transition count 4322
Iterating global reduction 0 with 499 rules applied. Total rules applied 2234 place count 2378 transition count 4322
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 2243 place count 2378 transition count 4313
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 2306 place count 2315 transition count 4174
Iterating global reduction 1 with 63 rules applied. Total rules applied 2369 place count 2315 transition count 4174
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 2406 place count 2278 transition count 4137
Iterating global reduction 1 with 37 rules applied. Total rules applied 2443 place count 2278 transition count 4137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 2447 place count 2278 transition count 4133
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2468 place count 2257 transition count 4112
Iterating global reduction 2 with 21 rules applied. Total rules applied 2489 place count 2257 transition count 4112
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2510 place count 2236 transition count 4091
Iterating global reduction 2 with 21 rules applied. Total rules applied 2531 place count 2236 transition count 4091
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2552 place count 2215 transition count 4070
Iterating global reduction 2 with 21 rules applied. Total rules applied 2573 place count 2215 transition count 4070
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2585 place count 2203 transition count 4058
Iterating global reduction 2 with 12 rules applied. Total rules applied 2597 place count 2203 transition count 4058
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2605 place count 2195 transition count 4050
Iterating global reduction 2 with 8 rules applied. Total rules applied 2613 place count 2195 transition count 4050
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2621 place count 2187 transition count 4042
Iterating global reduction 2 with 8 rules applied. Total rules applied 2629 place count 2187 transition count 4042
Applied a total of 2629 rules in 1549 ms. Remains 2187 /3495 variables (removed 1308) and now considering 4042/5439 (removed 1397) transitions.
// Phase 1: matrix 4042 rows 2187 cols
[2023-03-08 21:23:03] [INFO ] Computed 184 place invariants in 37 ms
[2023-03-08 21:23:03] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-08 21:23:03] [INFO ] Invariant cache hit.
[2023-03-08 21:23:05] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
[2023-03-08 21:23:05] [INFO ] Invariant cache hit.
[2023-03-08 21:23:07] [INFO ] Dead Transitions using invariants and state equation in 1753 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2187/3495 places, 4042/5439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5683 ms. Remains : 2187/3495 places, 4042/5439 transitions.
Support contains 54 out of 2187 places after structural reductions.
[2023-03-08 21:23:07] [INFO ] Flatten gal took : 232 ms
[2023-03-08 21:23:07] [INFO ] Flatten gal took : 147 ms
[2023-03-08 21:23:08] [INFO ] Input system was already deterministic with 4042 transitions.
Support contains 53 out of 2187 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 35) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-08 21:23:08] [INFO ] Invariant cache hit.
[2023-03-08 21:23:09] [INFO ] [Real]Absence check using 184 positive place invariants in 124 ms returned sat
[2023-03-08 21:23:09] [INFO ] After 1001ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-08 21:23:10] [INFO ] [Nat]Absence check using 184 positive place invariants in 126 ms returned sat
[2023-03-08 21:23:14] [INFO ] After 2715ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2023-03-08 21:23:17] [INFO ] After 5888ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 1628 ms.
[2023-03-08 21:23:18] [INFO ] After 9209ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 14 different solutions.
Parikh walk visited 15 properties in 593 ms.
Support contains 5 out of 2187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 9 ms
Free SCC test removed 493 places
Drop transitions removed 561 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 575 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 1694 transition count 3136
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 374 rules applied. Total rules applied 706 place count 1363 transition count 3093
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 734 place count 1335 transition count 3093
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 734 place count 1335 transition count 2911
Deduced a syphon composed of 182 places in 11 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1098 place count 1153 transition count 2911
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1171 place count 1080 transition count 2286
Iterating global reduction 3 with 73 rules applied. Total rules applied 1244 place count 1080 transition count 2286
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1248 place count 1080 transition count 2282
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1248 place count 1080 transition count 2280
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1252 place count 1078 transition count 2280
Performed 414 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 414 places in 1 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 2080 place count 664 transition count 1856
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2090 place count 664 transition count 1846
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2114 place count 640 transition count 1546
Iterating global reduction 5 with 24 rules applied. Total rules applied 2138 place count 640 transition count 1546
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2162 place count 640 transition count 1522
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -436
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 2244 place count 599 transition count 1958
Drop transitions removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 2259 place count 599 transition count 1943
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2280 place count 578 transition count 1411
Iterating global reduction 7 with 21 rules applied. Total rules applied 2301 place count 578 transition count 1411
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 2322 place count 578 transition count 1390
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2328 place count 575 transition count 1415
Drop transitions removed 160 transitions
Redundant transition composition rules discarded 160 transitions
Iterating global reduction 8 with 160 rules applied. Total rules applied 2488 place count 575 transition count 1255
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 2498 place count 565 transition count 1124
Iterating global reduction 8 with 10 rules applied. Total rules applied 2508 place count 565 transition count 1124
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 2518 place count 565 transition count 1114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2526 place count 561 transition count 1141
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2531 place count 561 transition count 1136
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 2552 place count 561 transition count 1115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2560 place count 557 transition count 1143
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2566 place count 557 transition count 1137
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 11 with 20 rules applied. Total rules applied 2586 place count 557 transition count 1117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2594 place count 553 transition count 1144
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2600 place count 553 transition count 1138
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 2621 place count 553 transition count 1117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2629 place count 549 transition count 1145
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2635 place count 549 transition count 1139
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 2655 place count 549 transition count 1119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2663 place count 545 transition count 1146
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2669 place count 545 transition count 1140
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 2690 place count 545 transition count 1119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2698 place count 541 transition count 1146
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2704 place count 541 transition count 1140
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 15 with 20 rules applied. Total rules applied 2724 place count 541 transition count 1120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2732 place count 537 transition count 1147
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2738 place count 537 transition count 1141
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 2759 place count 537 transition count 1120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2767 place count 533 transition count 1148
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2773 place count 533 transition count 1142
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 17 with 20 rules applied. Total rules applied 2793 place count 533 transition count 1122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2801 place count 529 transition count 1149
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2807 place count 529 transition count 1143
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2828 place count 529 transition count 1122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2836 place count 525 transition count 1150
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2842 place count 525 transition count 1144
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 19 with 20 rules applied. Total rules applied 2862 place count 525 transition count 1124
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2870 place count 521 transition count 1151
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2876 place count 521 transition count 1145
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2897 place count 521 transition count 1124
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2905 place count 517 transition count 1152
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2911 place count 517 transition count 1146
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 21 with 20 rules applied. Total rules applied 2931 place count 517 transition count 1126
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2939 place count 513 transition count 1153
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2945 place count 513 transition count 1147
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2966 place count 513 transition count 1126
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2974 place count 509 transition count 1154
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2980 place count 509 transition count 1148
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 23 with 20 rules applied. Total rules applied 3000 place count 509 transition count 1128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 3008 place count 505 transition count 1155
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 3014 place count 505 transition count 1149
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 3035 place count 505 transition count 1128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 3043 place count 501 transition count 1156
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 3049 place count 501 transition count 1150
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 25 with 20 rules applied. Total rules applied 3069 place count 501 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 3077 place count 497 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3083 place count 497 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 26 with 21 rules applied. Total rules applied 3104 place count 497 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 3112 place count 493 transition count 1166
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 26 with 8 rules applied. Total rules applied 3120 place count 493 transition count 1158
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 3140 place count 493 transition count 1138
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 3148 place count 489 transition count 1171
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 27 with 7 rules applied. Total rules applied 3155 place count 489 transition count 1164
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 28 with 21 rules applied. Total rules applied 3176 place count 489 transition count 1143
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 3184 place count 485 transition count 1162
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 3188 place count 485 transition count 1158
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 3207 place count 485 transition count 1139
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 3215 place count 481 transition count 1158
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 3219 place count 481 transition count 1154
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 3238 place count 481 transition count 1135
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 3246 place count 477 transition count 1154
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 3250 place count 477 transition count 1150
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 3269 place count 477 transition count 1131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3277 place count 473 transition count 1150
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3281 place count 473 transition count 1146
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3300 place count 473 transition count 1127
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3308 place count 469 transition count 1146
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3312 place count 469 transition count 1142
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 3331 place count 469 transition count 1123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3339 place count 465 transition count 1142
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3343 place count 465 transition count 1138
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3362 place count 465 transition count 1119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3370 place count 461 transition count 1138
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3374 place count 461 transition count 1134
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3393 place count 461 transition count 1115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3401 place count 457 transition count 1134
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3405 place count 457 transition count 1130
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 3424 place count 457 transition count 1111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3432 place count 453 transition count 1130
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3436 place count 453 transition count 1126
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3455 place count 453 transition count 1107
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3463 place count 449 transition count 1126
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3467 place count 449 transition count 1122
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 38 with 19 rules applied. Total rules applied 3486 place count 449 transition count 1103
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3494 place count 445 transition count 1122
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3498 place count 445 transition count 1118
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3517 place count 445 transition count 1099
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3525 place count 441 transition count 1118
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3529 place count 441 transition count 1114
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 40 with 19 rules applied. Total rules applied 3548 place count 441 transition count 1095
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 8 rules applied. Total rules applied 3556 place count 437 transition count 1114
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3560 place count 437 transition count 1110
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 41 with 19 rules applied. Total rules applied 3579 place count 437 transition count 1091
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 8 rules applied. Total rules applied 3587 place count 433 transition count 1110
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3591 place count 433 transition count 1106
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3610 place count 433 transition count 1087
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 42 with 8 rules applied. Total rules applied 3618 place count 429 transition count 1106
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 3622 place count 429 transition count 1102
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 43 with 19 rules applied. Total rules applied 3641 place count 429 transition count 1083
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 43 with 8 rules applied. Total rules applied 3649 place count 425 transition count 1102
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 43 with 4 rules applied. Total rules applied 3653 place count 425 transition count 1098
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 44 with 19 rules applied. Total rules applied 3672 place count 425 transition count 1079
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 44 with 8 rules applied. Total rules applied 3680 place count 421 transition count 1098
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 44 with 4 rules applied. Total rules applied 3684 place count 421 transition count 1094
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 45 with 19 rules applied. Total rules applied 3703 place count 421 transition count 1075
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 45 with 8 rules applied. Total rules applied 3711 place count 417 transition count 1094
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 45 with 4 rules applied. Total rules applied 3715 place count 417 transition count 1090
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 46 with 19 rules applied. Total rules applied 3734 place count 417 transition count 1071
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 46 with 8 rules applied. Total rules applied 3742 place count 413 transition count 1090
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 3746 place count 413 transition count 1086
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 47 with 19 rules applied. Total rules applied 3765 place count 413 transition count 1067
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 8 rules applied. Total rules applied 3773 place count 409 transition count 1086
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 3777 place count 409 transition count 1082
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 48 with 19 rules applied. Total rules applied 3796 place count 409 transition count 1063
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 48 with 8 rules applied. Total rules applied 3804 place count 405 transition count 1098
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 48 with 8 rules applied. Total rules applied 3812 place count 405 transition count 1090
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 49 with 19 rules applied. Total rules applied 3831 place count 405 transition count 1071
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 49 with 8 rules applied. Total rules applied 3839 place count 401 transition count 1106
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 49 with 8 rules applied. Total rules applied 3847 place count 401 transition count 1098
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 50 with 19 rules applied. Total rules applied 3866 place count 401 transition count 1079
Free-agglomeration rule applied 35 times with reduction of 2 identical transitions.
Iterating global reduction 50 with 35 rules applied. Total rules applied 3901 place count 401 transition count 1042
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 368 transitions
Reduce isomorphic transitions removed 368 transitions.
Graph (complete) has 1084 edges and 366 vertex of which 204 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.2 ms
Discarding 162 places :
Also discarding 0 output transitions
Iterating post reduction 50 with 404 rules applied. Total rules applied 4305 place count 204 transition count 674
Drop transitions removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Iterating post reduction 51 with 162 rules applied. Total rules applied 4467 place count 204 transition count 512
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 52 with 62 rules applied. Total rules applied 4529 place count 204 transition count 450
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 52 with 1 rules applied. Total rules applied 4530 place count 203 transition count 449
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 52 with 9 rules applied. Total rules applied 4539 place count 194 transition count 449
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 53 with 108 rules applied. Total rules applied 4647 place count 122 transition count 413
Drop transitions removed 27 transitions
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 112 transitions.
Graph (trivial) has 51 edges and 122 vertex of which 2 / 122 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 53 with 113 rules applied. Total rules applied 4760 place count 121 transition count 301
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 54 with 3 rules applied. Total rules applied 4763 place count 121 transition count 298
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 55 with 129 rules applied. Total rules applied 4892 place count 35 transition count 255
Drop transitions removed 78 transitions
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (trivial) has 12 edges and 35 vertex of which 10 / 35 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 55 with 170 rules applied. Total rules applied 5062 place count 30 transition count 86
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 64 edges and 27 vertex of which 21 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 56 with 36 rules applied. Total rules applied 5098 place count 21 transition count 51
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 57 with 3 rules applied. Total rules applied 5101 place count 21 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 58 with 9 rules applied. Total rules applied 5110 place count 15 transition count 45
Drop transitions removed 6 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 58 with 18 rules applied. Total rules applied 5128 place count 15 transition count 27
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 59 with 5 rules applied. Total rules applied 5133 place count 15 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 59 with 1 rules applied. Total rules applied 5134 place count 15 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 59 with 1 rules applied. Total rules applied 5135 place count 14 transition count 21
Applied a total of 5135 rules in 2261 ms. Remains 14 /2187 variables (removed 2173) and now considering 21/4042 (removed 4021) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2261 ms. Remains : 14/2187 places, 21/4042 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
FORMULA DLCround-PT-09b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 363 stabilizing places and 363 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&G(!p1)) U p2))'
Support contains 4 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2179 transition count 3986
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2179 transition count 3986
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 2177 transition count 3984
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 2177 transition count 3984
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2176 transition count 3983
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2176 transition count 3983
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2175 transition count 3982
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2175 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2174 transition count 3981
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2174 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2173 transition count 3980
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2173 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2172 transition count 3979
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2172 transition count 3979
Applied a total of 30 rules in 635 ms. Remains 2172 /2187 variables (removed 15) and now considering 3979/4042 (removed 63) transitions.
// Phase 1: matrix 3979 rows 2172 cols
[2023-03-08 21:23:24] [INFO ] Computed 184 place invariants in 28 ms
[2023-03-08 21:23:25] [INFO ] Implicit Places using invariants in 655 ms returned []
[2023-03-08 21:23:25] [INFO ] Invariant cache hit.
[2023-03-08 21:23:27] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
[2023-03-08 21:23:27] [INFO ] Invariant cache hit.
[2023-03-08 21:23:29] [INFO ] Dead Transitions using invariants and state equation in 1803 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2172/2187 places, 3979/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5117 ms. Remains : 2172/2187 places, 3979/4042 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) p1), true, (NOT p2), (OR (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s472 1) (EQ s1828 1)), p0:(NEQ s216 1), p2:(EQ s1601 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1871 steps with 0 reset in 23 ms.
FORMULA DLCround-PT-09b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-00 finished in 5949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1&&X(p1))))))'
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2178 transition count 3985
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2178 transition count 3985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2176 transition count 3982
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2172 transition count 3978
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2172 transition count 3978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2171 transition count 3977
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2171 transition count 3977
Applied a total of 33 rules in 695 ms. Remains 2171 /2187 variables (removed 16) and now considering 3977/4042 (removed 65) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2023-03-08 21:23:30] [INFO ] Computed 184 place invariants in 26 ms
[2023-03-08 21:23:30] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-08 21:23:30] [INFO ] Invariant cache hit.
[2023-03-08 21:23:32] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2502 ms to find 0 implicit places.
[2023-03-08 21:23:32] [INFO ] Invariant cache hit.
[2023-03-08 21:23:34] [INFO ] Dead Transitions using invariants and state equation in 1631 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2187 places, 3977/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4832 ms. Remains : 2171/2187 places, 3977/4042 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s850 0) (EQ s1569 0)), p0:(EQ s730 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9405 steps with 0 reset in 66 ms.
FORMULA DLCround-PT-09b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-01 finished in 5055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 2 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2180 transition count 3987
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2180 transition count 3987
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 2180 transition count 3986
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 2178 transition count 3984
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 2177 transition count 3983
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 2177 transition count 3983
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 2176 transition count 3982
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Applied a total of 29 rules in 661 ms. Remains 2173 /2187 variables (removed 14) and now considering 3979/4042 (removed 63) transitions.
// Phase 1: matrix 3979 rows 2173 cols
[2023-03-08 21:23:35] [INFO ] Computed 184 place invariants in 16 ms
[2023-03-08 21:23:35] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-08 21:23:35] [INFO ] Invariant cache hit.
[2023-03-08 21:23:37] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2023-03-08 21:23:37] [INFO ] Invariant cache hit.
[2023-03-08 21:23:39] [INFO ] Dead Transitions using invariants and state equation in 1663 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2173/2187 places, 3979/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4782 ms. Remains : 2173/2187 places, 3979/4042 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1165 0), p1:(EQ s2024 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1350 ms.
Product exploration explored 100000 steps with 50000 reset in 1297 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-09b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-09b-LTLFireability-03 finished in 7752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1||G(p2)) U G(!p0))))'
Support contains 5 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 522 / 2187 are part of one of the 43 SCC in 2 ms
Free SCC test removed 479 places
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 337 place count 1707 transition count 3190
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 379 rules applied. Total rules applied 716 place count 1371 transition count 3147
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 29 rules applied. Total rules applied 745 place count 1343 transition count 3146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 746 place count 1342 transition count 3146
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 185 Pre rules applied. Total rules applied 746 place count 1342 transition count 2961
Deduced a syphon composed of 185 places in 12 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 4 with 370 rules applied. Total rules applied 1116 place count 1157 transition count 2961
Discarding 71 places :
Symmetric choice reduction at 4 with 71 rule applications. Total rules 1187 place count 1086 transition count 2347
Iterating global reduction 4 with 71 rules applied. Total rules applied 1258 place count 1086 transition count 2347
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1261 place count 1086 transition count 2344
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1261 place count 1086 transition count 2342
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1265 place count 1084 transition count 2342
Performed 416 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 416 places in 0 ms
Reduce places removed 416 places and 0 transitions.
Iterating global reduction 5 with 832 rules applied. Total rules applied 2097 place count 668 transition count 1916
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 2108 place count 668 transition count 1905
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 2131 place count 645 transition count 1618
Iterating global reduction 6 with 23 rules applied. Total rules applied 2154 place count 645 transition count 1618
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 2177 place count 645 transition count 1595
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 7 with 2 rules applied. Total rules applied 2179 place count 644 transition count 1594
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -120
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 2205 place count 631 transition count 1714
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2210 place count 631 transition count 1709
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2215 place count 626 transition count 1603
Iterating global reduction 8 with 5 rules applied. Total rules applied 2220 place count 626 transition count 1603
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2224 place count 626 transition count 1599
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2232 place count 622 transition count 1633
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 9 with 40 rules applied. Total rules applied 2272 place count 622 transition count 1593
Discarding 19 places :
Symmetric choice reduction at 9 with 19 rule applications. Total rules 2291 place count 603 transition count 1555
Iterating global reduction 9 with 19 rules applied. Total rules applied 2310 place count 603 transition count 1555
Discarding 19 places :
Symmetric choice reduction at 9 with 19 rule applications. Total rules 2329 place count 584 transition count 1304
Iterating global reduction 9 with 19 rules applied. Total rules applied 2348 place count 584 transition count 1304
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 2367 place count 584 transition count 1285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2368 place count 583 transition count 1284
Applied a total of 2368 rules in 512 ms. Remains 583 /2187 variables (removed 1604) and now considering 1284/4042 (removed 2758) transitions.
[2023-03-08 21:23:42] [INFO ] Flow matrix only has 1254 transitions (discarded 30 similar events)
// Phase 1: matrix 1254 rows 583 cols
[2023-03-08 21:23:42] [INFO ] Computed 184 place invariants in 3 ms
[2023-03-08 21:23:43] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-08 21:23:43] [INFO ] Flow matrix only has 1254 transitions (discarded 30 similar events)
[2023-03-08 21:23:43] [INFO ] Invariant cache hit.
[2023-03-08 21:23:43] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 21:23:43] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-08 21:23:43] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-08 21:23:43] [INFO ] Flow matrix only has 1254 transitions (discarded 30 similar events)
[2023-03-08 21:23:43] [INFO ] Invariant cache hit.
[2023-03-08 21:23:44] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/2187 places, 1284/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1831 ms. Remains : 583/2187 places, 1284/4042 transitions.
Stuttering acceptance computed with spot in 429 ms :[true, true, p0, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2) p1), p0]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 5}, { cond=(OR p1 p2), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=6 dest: 6}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s368 1)), p1:(AND (EQ s67 1) (EQ s531 1)), p2:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-04 finished in 2283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p0&&F(p1)))))'
Support contains 2 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1924 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1693 transition count 3178
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 372 rules applied. Total rules applied 705 place count 1361 transition count 3138
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 732 place count 1335 transition count 3137
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 735 place count 1334 transition count 3135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 736 place count 1333 transition count 3135
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 182 Pre rules applied. Total rules applied 736 place count 1333 transition count 2953
Deduced a syphon composed of 182 places in 11 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 5 with 364 rules applied. Total rules applied 1100 place count 1151 transition count 2953
Discarding 74 places :
Symmetric choice reduction at 5 with 74 rule applications. Total rules 1174 place count 1077 transition count 2315
Iterating global reduction 5 with 74 rules applied. Total rules applied 1248 place count 1077 transition count 2315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1252 place count 1077 transition count 2311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1252 place count 1077 transition count 2309
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1256 place count 1075 transition count 2309
Performed 409 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 409 places in 0 ms
Reduce places removed 409 places and 0 transitions.
Iterating global reduction 6 with 818 rules applied. Total rules applied 2074 place count 666 transition count 1890
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2083 place count 666 transition count 1881
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 2107 place count 642 transition count 1581
Iterating global reduction 7 with 24 rules applied. Total rules applied 2131 place count 642 transition count 1581
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 2155 place count 642 transition count 1557
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 2189 place count 625 transition count 1705
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2193 place count 625 transition count 1701
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2197 place count 621 transition count 1613
Iterating global reduction 9 with 4 rules applied. Total rules applied 2201 place count 621 transition count 1613
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2205 place count 621 transition count 1609
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2213 place count 617 transition count 1646
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 10 with 51 rules applied. Total rules applied 2264 place count 617 transition count 1595
Discarding 18 places :
Symmetric choice reduction at 10 with 18 rule applications. Total rules 2282 place count 599 transition count 1559
Iterating global reduction 10 with 18 rules applied. Total rules applied 2300 place count 599 transition count 1559
Discarding 18 places :
Symmetric choice reduction at 10 with 18 rule applications. Total rules 2318 place count 581 transition count 1315
Iterating global reduction 10 with 18 rules applied. Total rules applied 2336 place count 581 transition count 1315
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 2354 place count 581 transition count 1297
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2355 place count 581 transition count 1297
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2356 place count 581 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2357 place count 580 transition count 1294
Iterating global reduction 11 with 1 rules applied. Total rules applied 2358 place count 580 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2359 place count 579 transition count 1281
Iterating global reduction 11 with 1 rules applied. Total rules applied 2360 place count 579 transition count 1281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2361 place count 579 transition count 1280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2362 place count 578 transition count 1279
Applied a total of 2362 rules in 439 ms. Remains 578 /2187 variables (removed 1609) and now considering 1279/4042 (removed 2763) transitions.
[2023-03-08 21:23:45] [INFO ] Flow matrix only has 1235 transitions (discarded 44 similar events)
// Phase 1: matrix 1235 rows 578 cols
[2023-03-08 21:23:45] [INFO ] Computed 184 place invariants in 3 ms
[2023-03-08 21:23:45] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-08 21:23:45] [INFO ] Flow matrix only has 1235 transitions (discarded 44 similar events)
[2023-03-08 21:23:45] [INFO ] Invariant cache hit.
[2023-03-08 21:23:45] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 21:23:45] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
[2023-03-08 21:23:45] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-08 21:23:45] [INFO ] Flow matrix only has 1235 transitions (discarded 44 similar events)
[2023-03-08 21:23:45] [INFO ] Invariant cache hit.
[2023-03-08 21:23:46] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 578/2187 places, 1279/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1794 ms. Remains : 578/2187 places, 1279/4042 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s76 1), p1:(NEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-05 finished in 1883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1922 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 2 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1693 transition count 3178
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 375 rules applied. Total rules applied 708 place count 1361 transition count 3135
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 736 place count 1333 transition count 3135
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 736 place count 1333 transition count 2953
Deduced a syphon composed of 182 places in 11 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1100 place count 1151 transition count 2953
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1173 place count 1078 transition count 2328
Iterating global reduction 3 with 73 rules applied. Total rules applied 1246 place count 1078 transition count 2328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1250 place count 1078 transition count 2322
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1254 place count 1076 transition count 2322
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2078 place count 664 transition count 1900
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2088 place count 664 transition count 1890
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2112 place count 640 transition count 1590
Iterating global reduction 5 with 24 rules applied. Total rules applied 2136 place count 640 transition count 1590
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2160 place count 640 transition count 1566
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2184 place count 628 transition count 1673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2188 place count 628 transition count 1669
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2192 place count 624 transition count 1585
Iterating global reduction 7 with 4 rules applied. Total rules applied 2196 place count 624 transition count 1585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2200 place count 624 transition count 1581
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2208 place count 620 transition count 1615
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2247 place count 620 transition count 1576
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2266 place count 601 transition count 1538
Iterating global reduction 8 with 19 rules applied. Total rules applied 2285 place count 601 transition count 1538
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2304 place count 582 transition count 1287
Iterating global reduction 8 with 19 rules applied. Total rules applied 2323 place count 582 transition count 1287
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2342 place count 582 transition count 1268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2343 place count 581 transition count 1267
Applied a total of 2343 rules in 536 ms. Remains 581 /2187 variables (removed 1606) and now considering 1267/4042 (removed 2775) transitions.
[2023-03-08 21:23:46] [INFO ] Flow matrix only has 1238 transitions (discarded 29 similar events)
// Phase 1: matrix 1238 rows 581 cols
[2023-03-08 21:23:46] [INFO ] Computed 184 place invariants in 3 ms
[2023-03-08 21:23:47] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-08 21:23:47] [INFO ] Flow matrix only has 1238 transitions (discarded 29 similar events)
[2023-03-08 21:23:47] [INFO ] Invariant cache hit.
[2023-03-08 21:23:47] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-08 21:23:48] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2023-03-08 21:23:48] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-08 21:23:48] [INFO ] Flow matrix only has 1238 transitions (discarded 29 similar events)
[2023-03-08 21:23:48] [INFO ] Invariant cache hit.
[2023-03-08 21:23:48] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2187 places, 1267/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2000 ms. Remains : 581/2187 places, 1267/4042 transitions.
Stuttering acceptance computed with spot in 396 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s154 1), p0:(AND (EQ s32 1) (EQ s367 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 9 ms.
FORMULA DLCround-PT-09b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-06 finished in 2424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1923 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 1693 transition count 3179
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 374 rules applied. Total rules applied 706 place count 1362 transition count 3136
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 734 place count 1334 transition count 3136
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 734 place count 1334 transition count 2954
Deduced a syphon composed of 182 places in 13 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1098 place count 1152 transition count 2954
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 1172 place count 1078 transition count 2316
Iterating global reduction 3 with 74 rules applied. Total rules applied 1246 place count 1078 transition count 2316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1250 place count 1078 transition count 2310
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1254 place count 1076 transition count 2310
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2078 place count 664 transition count 1888
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2088 place count 664 transition count 1878
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2111 place count 641 transition count 1591
Iterating global reduction 5 with 23 rules applied. Total rules applied 2134 place count 641 transition count 1591
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2157 place count 641 transition count 1568
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2181 place count 629 transition count 1675
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2185 place count 629 transition count 1671
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2189 place count 625 transition count 1587
Iterating global reduction 7 with 4 rules applied. Total rules applied 2193 place count 625 transition count 1587
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2197 place count 625 transition count 1583
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2205 place count 621 transition count 1617
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2244 place count 621 transition count 1578
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2263 place count 602 transition count 1540
Iterating global reduction 8 with 19 rules applied. Total rules applied 2282 place count 602 transition count 1540
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2301 place count 583 transition count 1289
Iterating global reduction 8 with 19 rules applied. Total rules applied 2320 place count 583 transition count 1289
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2339 place count 583 transition count 1270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2340 place count 582 transition count 1269
Applied a total of 2340 rules in 356 ms. Remains 582 /2187 variables (removed 1605) and now considering 1269/4042 (removed 2773) transitions.
[2023-03-08 21:23:49] [INFO ] Flow matrix only has 1240 transitions (discarded 29 similar events)
// Phase 1: matrix 1240 rows 582 cols
[2023-03-08 21:23:49] [INFO ] Computed 184 place invariants in 7 ms
[2023-03-08 21:23:49] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-08 21:23:49] [INFO ] Flow matrix only has 1240 transitions (discarded 29 similar events)
[2023-03-08 21:23:49] [INFO ] Invariant cache hit.
[2023-03-08 21:23:49] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-08 21:23:50] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-08 21:23:50] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-08 21:23:50] [INFO ] Flow matrix only has 1240 transitions (discarded 29 similar events)
[2023-03-08 21:23:50] [INFO ] Invariant cache hit.
[2023-03-08 21:23:50] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/2187 places, 1269/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1585 ms. Remains : 582/2187 places, 1269/4042 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s47 1), p0:(AND (EQ s26 1) (EQ s532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-07 finished in 1716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1925 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 1693 transition count 3179
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 374 rules applied. Total rules applied 706 place count 1362 transition count 3136
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 734 place count 1334 transition count 3136
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 734 place count 1334 transition count 2954
Deduced a syphon composed of 182 places in 10 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1098 place count 1152 transition count 2954
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 1172 place count 1078 transition count 2316
Iterating global reduction 3 with 74 rules applied. Total rules applied 1246 place count 1078 transition count 2316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1250 place count 1078 transition count 2310
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1254 place count 1076 transition count 2310
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2078 place count 664 transition count 1888
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2088 place count 664 transition count 1878
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2112 place count 640 transition count 1578
Iterating global reduction 5 with 24 rules applied. Total rules applied 2136 place count 640 transition count 1578
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2160 place count 640 transition count 1554
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2184 place count 628 transition count 1661
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2188 place count 628 transition count 1657
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2192 place count 624 transition count 1573
Iterating global reduction 7 with 4 rules applied. Total rules applied 2196 place count 624 transition count 1573
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2200 place count 624 transition count 1569
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2208 place count 620 transition count 1603
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2247 place count 620 transition count 1564
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2266 place count 601 transition count 1526
Iterating global reduction 8 with 19 rules applied. Total rules applied 2285 place count 601 transition count 1526
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2304 place count 582 transition count 1275
Iterating global reduction 8 with 19 rules applied. Total rules applied 2323 place count 582 transition count 1275
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2342 place count 582 transition count 1256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2343 place count 581 transition count 1255
Applied a total of 2343 rules in 350 ms. Remains 581 /2187 variables (removed 1606) and now considering 1255/4042 (removed 2787) transitions.
[2023-03-08 21:23:50] [INFO ] Flow matrix only has 1226 transitions (discarded 29 similar events)
// Phase 1: matrix 1226 rows 581 cols
[2023-03-08 21:23:50] [INFO ] Computed 184 place invariants in 5 ms
[2023-03-08 21:23:51] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-08 21:23:51] [INFO ] Flow matrix only has 1226 transitions (discarded 29 similar events)
[2023-03-08 21:23:51] [INFO ] Invariant cache hit.
[2023-03-08 21:23:51] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-08 21:23:51] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-08 21:23:51] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-08 21:23:51] [INFO ] Flow matrix only has 1226 transitions (discarded 29 similar events)
[2023-03-08 21:23:51] [INFO ] Invariant cache hit.
[2023-03-08 21:23:52] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2187 places, 1255/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1558 ms. Remains : 581/2187 places, 1255/4042 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-08 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:(EQ s69 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-08 finished in 1637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U (!p2 U p1)))'
Support contains 6 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1693 transition count 3178
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 375 rules applied. Total rules applied 708 place count 1361 transition count 3135
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 736 place count 1333 transition count 3135
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 736 place count 1333 transition count 2953
Deduced a syphon composed of 182 places in 10 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1100 place count 1151 transition count 2953
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 1171 place count 1080 transition count 2354
Iterating global reduction 3 with 71 rules applied. Total rules applied 1242 place count 1080 transition count 2354
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1246 place count 1080 transition count 2350
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1246 place count 1080 transition count 2348
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2348
Performed 410 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 410 places in 0 ms
Reduce places removed 410 places and 0 transitions.
Iterating global reduction 4 with 820 rules applied. Total rules applied 2070 place count 668 transition count 1929
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2079 place count 668 transition count 1920
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2103 place count 644 transition count 1620
Iterating global reduction 5 with 24 rules applied. Total rules applied 2127 place count 644 transition count 1620
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2151 place count 644 transition count 1596
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2175 place count 632 transition count 1703
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2179 place count 632 transition count 1699
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2183 place count 628 transition count 1615
Iterating global reduction 7 with 4 rules applied. Total rules applied 2187 place count 628 transition count 1615
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2191 place count 628 transition count 1611
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2199 place count 624 transition count 1645
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2236 place count 624 transition count 1608
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2252 place count 608 transition count 1576
Iterating global reduction 8 with 16 rules applied. Total rules applied 2268 place count 608 transition count 1576
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2284 place count 592 transition count 1364
Iterating global reduction 8 with 16 rules applied. Total rules applied 2300 place count 592 transition count 1364
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 2316 place count 592 transition count 1348
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2319 place count 592 transition count 1348
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2321 place count 592 transition count 1346
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2323 place count 590 transition count 1342
Iterating global reduction 9 with 2 rules applied. Total rules applied 2325 place count 590 transition count 1342
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2327 place count 588 transition count 1316
Iterating global reduction 9 with 2 rules applied. Total rules applied 2329 place count 588 transition count 1316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2331 place count 588 transition count 1314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2332 place count 587 transition count 1313
Applied a total of 2332 rules in 411 ms. Remains 587 /2187 variables (removed 1600) and now considering 1313/4042 (removed 2729) transitions.
[2023-03-08 21:23:52] [INFO ] Flow matrix only has 1283 transitions (discarded 30 similar events)
// Phase 1: matrix 1283 rows 587 cols
[2023-03-08 21:23:52] [INFO ] Computed 184 place invariants in 3 ms
[2023-03-08 21:23:52] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-08 21:23:52] [INFO ] Flow matrix only has 1283 transitions (discarded 30 similar events)
[2023-03-08 21:23:52] [INFO ] Invariant cache hit.
[2023-03-08 21:23:53] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-08 21:23:53] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2023-03-08 21:23:53] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-08 21:23:53] [INFO ] Flow matrix only has 1283 transitions (discarded 30 similar events)
[2023-03-08 21:23:53] [INFO ] Invariant cache hit.
[2023-03-08 21:23:53] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/2187 places, 1313/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1626 ms. Remains : 587/2187 places, 1313/4042 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s38 1) (EQ s391 1)), p2:(AND (EQ s72 1) (EQ s550 1)), p0:(AND (EQ s29 1) (EQ s358 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 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-09 finished in 1708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(G((!p0||X(p2)))&&(!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2178 transition count 3985
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2178 transition count 3985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2176 transition count 3982
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2172 transition count 3978
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2172 transition count 3978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2171 transition count 3977
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2171 transition count 3977
Applied a total of 33 rules in 662 ms. Remains 2171 /2187 variables (removed 16) and now considering 3977/4042 (removed 65) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2023-03-08 21:23:54] [INFO ] Computed 184 place invariants in 14 ms
[2023-03-08 21:23:55] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-08 21:23:55] [INFO ] Invariant cache hit.
[2023-03-08 21:23:57] [INFO ] Implicit Places using invariants and state equation in 1903 ms returned []
Implicit Place search using SMT with State Equation took 2554 ms to find 0 implicit places.
[2023-03-08 21:23:57] [INFO ] Invariant cache hit.
[2023-03-08 21:23:58] [INFO ] Dead Transitions using invariants and state equation in 1641 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2187 places, 3977/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4864 ms. Remains : 2171/2187 places, 3977/4042 transitions.
Stuttering acceptance computed with spot in 1993 ms :[true, (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(OR (AND (EQ s125 1) (EQ s1323 1)) (NOT (AND (EQ s343 1) (EQ s1202 1)))), p0:(AND (EQ s125 1) (EQ s1323 1)), p1:(AND (NOT (AND (EQ s125 1) (EQ s1323 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 588 ms.
Product exploration explored 100000 steps with 0 reset in 749 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 633 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 21:24:03] [INFO ] Invariant cache hit.
[2023-03-08 21:24:03] [INFO ] [Real]Absence check using 184 positive place invariants in 114 ms returned sat
[2023-03-08 21:24:04] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-08 21:24:04] [INFO ] [Nat]Absence check using 184 positive place invariants in 121 ms returned sat
[2023-03-08 21:24:05] [INFO ] After 1367ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-08 21:24:06] [INFO ] After 1884ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 275 ms.
[2023-03-08 21:24:06] [INFO ] After 2643ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 755 steps, including 0 resets, run visited all 3 properties in 17 ms. (steps per millisecond=44 )
Parikh walk visited 3 properties in 19 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (AND p2 p0)), (F p0), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))]
Knowledge based reduction with 17 factoid took 1588 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1), false]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1), false]
Support contains 4 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 82 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2023-03-08 21:24:08] [INFO ] Invariant cache hit.
[2023-03-08 21:24:09] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-08 21:24:09] [INFO ] Invariant cache hit.
[2023-03-08 21:24:11] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
[2023-03-08 21:24:11] [INFO ] Invariant cache hit.
[2023-03-08 21:24:12] [INFO ] Dead Transitions using invariants and state equation in 1616 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4199 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p0) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:24:13] [INFO ] Invariant cache hit.
[2023-03-08 21:24:13] [INFO ] [Real]Absence check using 184 positive place invariants in 122 ms returned sat
[2023-03-08 21:24:15] [INFO ] After 1554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:24:15] [INFO ] [Nat]Absence check using 184 positive place invariants in 119 ms returned sat
[2023-03-08 21:24:16] [INFO ] After 1181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:24:16] [INFO ] After 1347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-08 21:24:16] [INFO ] After 1790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 693 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=173 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p0)))), (F p0)]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p0) (NOT p2)), false, false, false]
Entered a terminal (fully accepting) state of product in 50751 steps with 0 reset in 292 ms.
FORMULA DLCround-PT-09b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-11 finished in 23888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1923 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 1693 transition count 3177
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 376 rules applied. Total rules applied 710 place count 1360 transition count 3134
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 738 place count 1332 transition count 3134
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 738 place count 1332 transition count 2952
Deduced a syphon composed of 182 places in 11 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1102 place count 1150 transition count 2952
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1175 place count 1077 transition count 2327
Iterating global reduction 3 with 73 rules applied. Total rules applied 1248 place count 1077 transition count 2327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1252 place count 1077 transition count 2323
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1252 place count 1077 transition count 2321
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1256 place count 1075 transition count 2321
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2080 place count 663 transition count 1899
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2090 place count 663 transition count 1889
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2113 place count 640 transition count 1599
Iterating global reduction 5 with 23 rules applied. Total rules applied 2136 place count 640 transition count 1599
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2159 place count 640 transition count 1576
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2183 place count 628 transition count 1683
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2187 place count 628 transition count 1679
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2191 place count 624 transition count 1595
Iterating global reduction 7 with 4 rules applied. Total rules applied 2195 place count 624 transition count 1595
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2199 place count 624 transition count 1591
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2207 place count 620 transition count 1625
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2246 place count 620 transition count 1586
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2265 place count 601 transition count 1548
Iterating global reduction 8 with 19 rules applied. Total rules applied 2284 place count 601 transition count 1548
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2303 place count 582 transition count 1297
Iterating global reduction 8 with 19 rules applied. Total rules applied 2322 place count 582 transition count 1297
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2341 place count 582 transition count 1278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2342 place count 581 transition count 1277
Applied a total of 2342 rules in 350 ms. Remains 581 /2187 variables (removed 1606) and now considering 1277/4042 (removed 2765) transitions.
[2023-03-08 21:24:18] [INFO ] Flow matrix only has 1248 transitions (discarded 29 similar events)
// Phase 1: matrix 1248 rows 581 cols
[2023-03-08 21:24:18] [INFO ] Computed 184 place invariants in 8 ms
[2023-03-08 21:24:18] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-08 21:24:18] [INFO ] Flow matrix only has 1248 transitions (discarded 29 similar events)
[2023-03-08 21:24:18] [INFO ] Invariant cache hit.
[2023-03-08 21:24:18] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-08 21:24:18] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2023-03-08 21:24:18] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-08 21:24:18] [INFO ] Flow matrix only has 1248 transitions (discarded 29 similar events)
[2023-03-08 21:24:18] [INFO ] Invariant cache hit.
[2023-03-08 21:24:19] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2187 places, 1277/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1546 ms. Remains : 581/2187 places, 1277/4042 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s35 1) (EQ s382 1)) (AND (EQ s13 1) (EQ s279 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-12 finished in 1597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)||p0))||G(p2))))'
Support contains 5 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 516 / 2187 are part of one of the 45 SCC in 1 ms
Free SCC test removed 471 places
Ensure Unique test removed 506 transitions
Reduce isomorphic transitions removed 506 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 343 place count 1715 transition count 3193
Reduce places removed 342 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 385 rules applied. Total rules applied 728 place count 1373 transition count 3150
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 756 place count 1345 transition count 3150
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 185 Pre rules applied. Total rules applied 756 place count 1345 transition count 2965
Deduced a syphon composed of 185 places in 11 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 3 with 370 rules applied. Total rules applied 1126 place count 1160 transition count 2965
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1195 place count 1091 transition count 2368
Iterating global reduction 3 with 69 rules applied. Total rules applied 1264 place count 1091 transition count 2368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1268 place count 1091 transition count 2364
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1268 place count 1091 transition count 2362
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1272 place count 1089 transition count 2362
Performed 416 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 416 places in 0 ms
Reduce places removed 416 places and 0 transitions.
Iterating global reduction 4 with 832 rules applied. Total rules applied 2104 place count 673 transition count 1938
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2114 place count 673 transition count 1928
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2137 place count 650 transition count 1641
Iterating global reduction 5 with 23 rules applied. Total rules applied 2160 place count 650 transition count 1641
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2182 place count 650 transition count 1619
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 6 with 2 rules applied. Total rules applied 2184 place count 649 transition count 1618
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2208 place count 637 transition count 1725
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2212 place count 637 transition count 1721
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2216 place count 633 transition count 1637
Iterating global reduction 7 with 4 rules applied. Total rules applied 2220 place count 633 transition count 1637
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2224 place count 633 transition count 1633
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2232 place count 629 transition count 1667
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2271 place count 629 transition count 1628
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2289 place count 611 transition count 1592
Iterating global reduction 8 with 18 rules applied. Total rules applied 2307 place count 611 transition count 1592
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2325 place count 593 transition count 1354
Iterating global reduction 8 with 18 rules applied. Total rules applied 2343 place count 593 transition count 1354
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2361 place count 593 transition count 1336
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2362 place count 592 transition count 1335
Applied a total of 2362 rules in 352 ms. Remains 592 /2187 variables (removed 1595) and now considering 1335/4042 (removed 2707) transitions.
[2023-03-08 21:24:19] [INFO ] Flow matrix only has 1304 transitions (discarded 31 similar events)
// Phase 1: matrix 1304 rows 592 cols
[2023-03-08 21:24:19] [INFO ] Computed 184 place invariants in 6 ms
[2023-03-08 21:24:19] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-08 21:24:19] [INFO ] Flow matrix only has 1304 transitions (discarded 31 similar events)
[2023-03-08 21:24:19] [INFO ] Invariant cache hit.
[2023-03-08 21:24:20] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 21:24:20] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2023-03-08 21:24:20] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-08 21:24:20] [INFO ] Flow matrix only has 1304 transitions (discarded 31 similar events)
[2023-03-08 21:24:20] [INFO ] Invariant cache hit.
[2023-03-08 21:24:21] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 592/2187 places, 1335/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1599 ms. Remains : 592/2187 places, 1335/4042 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s549 0)), p1:(EQ s84 0), p2:(OR (NEQ s29 1) (NEQ s123 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14914 steps with 6 reset in 173 ms.
FORMULA DLCround-PT-09b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-13 finished in 1853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!(!p1 U X(p1))||p0))||X(X(p2))))))'
Support contains 6 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2178 transition count 3985
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2178 transition count 3985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2176 transition count 3982
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2172 transition count 3978
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2172 transition count 3978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2171 transition count 3977
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2171 transition count 3977
Applied a total of 33 rules in 655 ms. Remains 2171 /2187 variables (removed 16) and now considering 3977/4042 (removed 65) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2023-03-08 21:24:21] [INFO ] Computed 184 place invariants in 18 ms
[2023-03-08 21:24:22] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-08 21:24:22] [INFO ] Invariant cache hit.
[2023-03-08 21:24:24] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
[2023-03-08 21:24:24] [INFO ] Invariant cache hit.
[2023-03-08 21:24:26] [INFO ] Dead Transitions using invariants and state equation in 1627 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2187 places, 3977/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4728 ms. Remains : 2171/2187 places, 3977/4042 transitions.
Stuttering acceptance computed with spot in 707 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s84 1) (EQ s1268 1)), p2:(OR (EQ s78 0) (EQ s1311 0)), p0:(OR (EQ s709 0) (EQ s1983 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 650 ms.
Product exploration explored 100000 steps with 0 reset in 806 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 903 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 21:24:29] [INFO ] Invariant cache hit.
[2023-03-08 21:24:30] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 21:24:30] [INFO ] [Nat]Absence check using 184 positive place invariants in 121 ms returned sat
[2023-03-08 21:24:32] [INFO ] After 1746ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-08 21:24:33] [INFO ] After 2916ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 644 ms.
[2023-03-08 21:24:34] [INFO ] After 4360ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 6 different solutions.
Finished Parikh walk after 703 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=175 )
Parikh walk visited 7 properties in 36 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p0 p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 27 factoid took 1917 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 87 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2023-03-08 21:24:37] [INFO ] Invariant cache hit.
[2023-03-08 21:24:38] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-08 21:24:38] [INFO ] Invariant cache hit.
[2023-03-08 21:24:40] [INFO ] Implicit Places using invariants and state equation in 1902 ms returned []
Implicit Place search using SMT with State Equation took 2483 ms to find 0 implicit places.
[2023-03-08 21:24:40] [INFO ] Invariant cache hit.
[2023-03-08 21:24:41] [INFO ] Dead Transitions using invariants and state equation in 1630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4202 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 2239 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 21:24:44] [INFO ] Invariant cache hit.
[2023-03-08 21:24:45] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 21:24:45] [INFO ] [Nat]Absence check using 184 positive place invariants in 120 ms returned sat
[2023-03-08 21:24:47] [INFO ] After 1560ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-08 21:24:48] [INFO ] After 2390ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-03-08 21:24:48] [INFO ] After 3475ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 663 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=165 )
Parikh walk visited 5 properties in 17 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND p2 p0 (NOT p1)))), (F (AND (NOT p2) p0)), (F (AND p2 p0 p1)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p2 p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 26 factoid took 1491 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1334 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 589 ms.
Product exploration explored 100000 steps with 0 reset in 765 ms.
Built C files in :
/tmp/ltsmin2067509477012456884
[2023-03-08 21:24:53] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2067509477012456884
Running compilation step : cd /tmp/ltsmin2067509477012456884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2067509477012456884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2067509477012456884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 80 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2023-03-08 21:24:56] [INFO ] Invariant cache hit.
[2023-03-08 21:24:56] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-08 21:24:56] [INFO ] Invariant cache hit.
[2023-03-08 21:24:58] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2479 ms to find 0 implicit places.
[2023-03-08 21:24:58] [INFO ] Invariant cache hit.
[2023-03-08 21:25:00] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4211 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Built C files in :
/tmp/ltsmin16318213823149428241
[2023-03-08 21:25:00] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16318213823149428241
Running compilation step : cd /tmp/ltsmin16318213823149428241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16318213823149428241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16318213823149428241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 21:25:03] [INFO ] Flatten gal took : 113 ms
[2023-03-08 21:25:03] [INFO ] Flatten gal took : 103 ms
[2023-03-08 21:25:04] [INFO ] Time to serialize gal into /tmp/LTL5348753853551309956.gal : 34 ms
[2023-03-08 21:25:04] [INFO ] Time to serialize properties into /tmp/LTL8887672394418425290.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5348753853551309956.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3935382094992634366.hoa' '-atoms' '/tmp/LTL8887672394418425290.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8887672394418425290.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3935382094992634366.hoa
Detected timeout of ITS tools.
[2023-03-08 21:25:19] [INFO ] Flatten gal took : 101 ms
[2023-03-08 21:25:20] [INFO ] Flatten gal took : 96 ms
[2023-03-08 21:25:20] [INFO ] Time to serialize gal into /tmp/LTL17324229513501333291.gal : 22 ms
[2023-03-08 21:25:20] [INFO ] Time to serialize properties into /tmp/LTL13100131522625497396.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17324229513501333291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13100131522625497396.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((G(((!((!("((p167==1)&&(p1988==1))"))U(X("((p167==1)&&(p1988==1))"))))||("(p1202==0)"))||("(p3181==0)")))||(X(X("((p141==0)||(p...172
Formula 0 simplified : G(F(!"(p1202==0)" & !"(p3181==0)" & (!"((p167==1)&&(p1988==1))" U X"((p167==1)&&(p1988==1))")) & F!"((p141==0)||(p2061==0))")
Detected timeout of ITS tools.
[2023-03-08 21:25:35] [INFO ] Flatten gal took : 81 ms
[2023-03-08 21:25:35] [INFO ] Applying decomposition
[2023-03-08 21:25:35] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6064681982601881706.txt' '-o' '/tmp/graph6064681982601881706.bin' '-w' '/tmp/graph6064681982601881706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6064681982601881706.bin' '-l' '-1' '-v' '-w' '/tmp/graph6064681982601881706.weights' '-q' '0' '-e' '0.001'
[2023-03-08 21:25:35] [INFO ] Decomposing Gal with order
[2023-03-08 21:25:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 21:25:36] [INFO ] Removed a total of 3793 redundant transitions.
[2023-03-08 21:25:36] [INFO ] Flatten gal took : 256 ms
[2023-03-08 21:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 78 ms.
[2023-03-08 21:25:36] [INFO ] Time to serialize gal into /tmp/LTL1144004260690311535.gal : 32 ms
[2023-03-08 21:25:36] [INFO ] Time to serialize properties into /tmp/LTL4273134193492977262.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1144004260690311535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4273134193492977262.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((G(((!((!("((i2.i0.i0.u26.p167==1)&&(i8.u521.p1988==1))"))U(X("((i2.i0.i0.u26.p167==1)&&(i8.u521.p1988==1))"))))||("(i13.u299.p...259
Formula 0 simplified : G(F(!"(i13.u299.p1202==0)" & !"(i13.u741.p3181==0)" & (!"((i2.i0.i0.u26.p167==1)&&(i8.u521.p1988==1))" U X"((i2.i0.i0.u26.p167==1)&&...235
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15992650043530989809
[2023-03-08 21:25:51] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15992650043530989809
Running compilation step : cd /tmp/ltsmin15992650043530989809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15992650043530989809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15992650043530989809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DLCround-PT-09b-LTLFireability-14 finished in 93372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2178 transition count 3985
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2178 transition count 3985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2176 transition count 3982
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2172 transition count 3978
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2172 transition count 3978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2171 transition count 3977
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2171 transition count 3977
Applied a total of 33 rules in 711 ms. Remains 2171 /2187 variables (removed 16) and now considering 3977/4042 (removed 65) transitions.
[2023-03-08 21:25:55] [INFO ] Invariant cache hit.
[2023-03-08 21:25:55] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-08 21:25:55] [INFO ] Invariant cache hit.
[2023-03-08 21:25:57] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 2526 ms to find 0 implicit places.
[2023-03-08 21:25:57] [INFO ] Invariant cache hit.
[2023-03-08 21:25:59] [INFO ] Dead Transitions using invariants and state equation in 1637 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2187 places, 3977/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4876 ms. Remains : 2171/2187 places, 3977/4042 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s691 1), p0:(OR (EQ s939 0) (EQ s2133 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12 reset in 598 ms.
Product exploration explored 100000 steps with 9 reset in 726 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 396 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 8205 steps, including 2 resets, run visited all 3 properties in 104 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 349 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 81 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2023-03-08 21:26:02] [INFO ] Invariant cache hit.
[2023-03-08 21:26:02] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-08 21:26:02] [INFO ] Invariant cache hit.
[2023-03-08 21:26:04] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2507 ms to find 0 implicit places.
[2023-03-08 21:26:04] [INFO ] Invariant cache hit.
[2023-03-08 21:26:06] [INFO ] Dead Transitions using invariants and state equation in 1643 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4233 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:26:07] [INFO ] Invariant cache hit.
[2023-03-08 21:26:07] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:26:07] [INFO ] [Nat]Absence check using 184 positive place invariants in 122 ms returned sat
[2023-03-08 21:26:08] [INFO ] After 1205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:08] [INFO ] After 1370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-08 21:26:09] [INFO ] After 1832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 354 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=118 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 235 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9 reset in 538 ms.
Product exploration explored 100000 steps with 13 reset in 655 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1909 edges and 2171 vertex of which 524 / 2171 are part of one of the 43 SCC in 1 ms
Free SCC test removed 481 places
Ensure Unique test removed 519 transitions
Reduce isomorphic transitions removed 519 transitions.
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 1690 transition count 3458
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 28 rules applied. Total rules applied 362 place count 1690 transition count 3444
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 362 place count 1690 transition count 3448
Deduced a syphon composed of 355 places in 13 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 370 place count 1690 transition count 3448
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 522 place count 1538 transition count 2804
Deduced a syphon composed of 269 places in 10 ms
Iterating global reduction 2 with 152 rules applied. Total rules applied 674 place count 1538 transition count 2804
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 678 place count 1538 transition count 2800
Performed 584 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 853 places in 1 ms
Iterating global reduction 3 with 584 rules applied. Total rules applied 1262 place count 1538 transition count 2810
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1272 place count 1538 transition count 2800
Renaming transitions due to excessive name length > 1024 char.
Discarding 425 places :
Symmetric choice reduction at 4 with 425 rule applications. Total rules 1697 place count 1113 transition count 2087
Deduced a syphon composed of 453 places in 1 ms
Iterating global reduction 4 with 425 rules applied. Total rules applied 2122 place count 1113 transition count 2087
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2146 place count 1113 transition count 2063
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2156 place count 1103 transition count 2053
Deduced a syphon composed of 443 places in 1 ms
Iterating global reduction 5 with 10 rules applied. Total rules applied 2166 place count 1103 transition count 2053
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -208
Deduced a syphon composed of 474 places in 1 ms
Iterating global reduction 5 with 31 rules applied. Total rules applied 2197 place count 1103 transition count 2261
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2215 place count 1103 transition count 2243
Discarding 45 places :
Symmetric choice reduction at 6 with 45 rule applications. Total rules 2260 place count 1058 transition count 2071
Deduced a syphon composed of 433 places in 0 ms
Iterating global reduction 6 with 45 rules applied. Total rules applied 2305 place count 1058 transition count 2071
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2313 place count 1058 transition count 2063
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2321 place count 1050 transition count 2047
Deduced a syphon composed of 425 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2329 place count 1050 transition count 2047
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 429 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2333 place count 1050 transition count 2087
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2337 place count 1046 transition count 2079
Deduced a syphon composed of 425 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2341 place count 1046 transition count 2079
Deduced a syphon composed of 425 places in 0 ms
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 7 with 36 rules applied. Total rules applied 2377 place count 1046 transition count 2043
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2395 place count 1028 transition count 2007
Deduced a syphon composed of 425 places in 1 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2413 place count 1028 transition count 2007
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2431 place count 1010 transition count 1771
Deduced a syphon composed of 425 places in 0 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2449 place count 1010 transition count 1771
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 2476 place count 1010 transition count 1744
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2494 place count 992 transition count 1717
Deduced a syphon composed of 407 places in 0 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 2512 place count 992 transition count 1717
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 408 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 2513 place count 992 transition count 1729
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2514 place count 991 transition count 1727
Deduced a syphon composed of 407 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 2515 place count 991 transition count 1727
Deduced a syphon composed of 407 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2518 place count 991 transition count 1724
Deduced a syphon composed of 407 places in 0 ms
Applied a total of 2518 rules in 1386 ms. Remains 991 /2171 variables (removed 1180) and now considering 1724/3977 (removed 2253) transitions.
[2023-03-08 21:26:12] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-08 21:26:12] [INFO ] Flow matrix only has 1692 transitions (discarded 32 similar events)
// Phase 1: matrix 1692 rows 991 cols
[2023-03-08 21:26:12] [INFO ] Computed 184 place invariants in 53 ms
[2023-03-08 21:26:13] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 991/2171 places, 1724/3977 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2167 ms. Remains : 991/2171 places, 1724/3977 transitions.
Built C files in :
/tmp/ltsmin17799323991053413277
[2023-03-08 21:26:13] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17799323991053413277
Running compilation step : cd /tmp/ltsmin17799323991053413277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17799323991053413277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17799323991053413277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 60 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2023-03-08 21:26:16] [INFO ] Computed 184 place invariants in 16 ms
[2023-03-08 21:26:17] [INFO ] Implicit Places using invariants in 640 ms returned []
[2023-03-08 21:26:17] [INFO ] Invariant cache hit.
[2023-03-08 21:26:19] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 2644 ms to find 0 implicit places.
[2023-03-08 21:26:19] [INFO ] Invariant cache hit.
[2023-03-08 21:26:20] [INFO ] Dead Transitions using invariants and state equation in 1618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4323 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Built C files in :
/tmp/ltsmin1493036536474905480
[2023-03-08 21:26:22] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1493036536474905480
Running compilation step : cd /tmp/ltsmin1493036536474905480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1493036536474905480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1493036536474905480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 21:26:25] [INFO ] Flatten gal took : 74 ms
[2023-03-08 21:26:25] [INFO ] Flatten gal took : 74 ms
[2023-03-08 21:26:25] [INFO ] Time to serialize gal into /tmp/LTL13403886331615104941.gal : 20 ms
[2023-03-08 21:26:25] [INFO ] Time to serialize properties into /tmp/LTL17231736618565704839.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13403886331615104941.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11471696814785729470.hoa' '-atoms' '/tmp/LTL17231736618565704839.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17231736618565704839.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11471696814785729470.hoa
Detected timeout of ITS tools.
[2023-03-08 21:26:40] [INFO ] Flatten gal took : 69 ms
[2023-03-08 21:26:40] [INFO ] Flatten gal took : 75 ms
[2023-03-08 21:26:40] [INFO ] Time to serialize gal into /tmp/LTL10941444594762004067.gal : 14 ms
[2023-03-08 21:26:40] [INFO ] Time to serialize properties into /tmp/LTL11779005535515286153.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10941444594762004067.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11779005535515286153.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("((p1556==0)||(p3431==0))"))||(X(F("(p1177==1)")))))
Formula 0 simplified : F!"((p1556==0)||(p3431==0))" & XG!"(p1177==1)"
Detected timeout of ITS tools.
[2023-03-08 21:26:56] [INFO ] Flatten gal took : 67 ms
[2023-03-08 21:26:56] [INFO ] Applying decomposition
[2023-03-08 21:26:56] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3539306085122114566.txt' '-o' '/tmp/graph3539306085122114566.bin' '-w' '/tmp/graph3539306085122114566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3539306085122114566.bin' '-l' '-1' '-v' '-w' '/tmp/graph3539306085122114566.weights' '-q' '0' '-e' '0.001'
[2023-03-08 21:26:56] [INFO ] Decomposing Gal with order
[2023-03-08 21:26:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 21:26:56] [INFO ] Removed a total of 3815 redundant transitions.
[2023-03-08 21:26:56] [INFO ] Flatten gal took : 130 ms
[2023-03-08 21:26:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 50 ms.
[2023-03-08 21:26:56] [INFO ] Time to serialize gal into /tmp/LTL11405399071078264822.gal : 20 ms
[2023-03-08 21:26:57] [INFO ] Time to serialize properties into /tmp/LTL7751766524602776698.ltl : 407 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11405399071078264822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7751766524602776698.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((i16.i1.i4.u389.p1556==0)||(i16.i1.i15.u796.p3431==0))"))||(X(F("(i11.i0.i2.u285.p1177==1)")))))
Formula 0 simplified : F!"((i16.i1.i4.u389.p1556==0)||(i16.i1.i15.u796.p3431==0))" & XG!"(i11.i0.i2.u285.p1177==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18142119844048157305
[2023-03-08 21:27:12] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18142119844048157305
Running compilation step : cd /tmp/ltsmin18142119844048157305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18142119844048157305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18142119844048157305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DLCround-PT-09b-LTLFireability-15 finished in 80672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!(!p1 U X(p1))||p0))||X(X(p2))))))'
Found a Lengthening insensitive property : DLCround-PT-09b-LTLFireability-14
Stuttering acceptance computed with spot in 117 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1693 transition count 3178
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 375 rules applied. Total rules applied 708 place count 1361 transition count 3135
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 736 place count 1333 transition count 3135
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 736 place count 1333 transition count 2953
Deduced a syphon composed of 182 places in 11 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1100 place count 1151 transition count 2953
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1173 place count 1078 transition count 2328
Iterating global reduction 3 with 73 rules applied. Total rules applied 1246 place count 1078 transition count 2328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1250 place count 1078 transition count 2322
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1254 place count 1076 transition count 2322
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2078 place count 664 transition count 1900
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2088 place count 664 transition count 1890
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2111 place count 641 transition count 1600
Iterating global reduction 5 with 23 rules applied. Total rules applied 2134 place count 641 transition count 1600
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2157 place count 641 transition count 1577
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2181 place count 629 transition count 1691
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2184 place count 629 transition count 1688
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2187 place count 626 transition count 1624
Iterating global reduction 7 with 3 rules applied. Total rules applied 2190 place count 626 transition count 1624
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2193 place count 626 transition count 1621
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2199 place count 623 transition count 1646
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2203 place count 623 transition count 1642
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2204 place count 622 transition count 1641
Applied a total of 2204 rules in 313 ms. Remains 622 /2187 variables (removed 1565) and now considering 1641/4042 (removed 2401) transitions.
[2023-03-08 21:27:15] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
// Phase 1: matrix 1593 rows 622 cols
[2023-03-08 21:27:15] [INFO ] Computed 184 place invariants in 3 ms
[2023-03-08 21:27:16] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-08 21:27:16] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:16] [INFO ] Invariant cache hit.
[2023-03-08 21:27:16] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-08 21:27:16] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2023-03-08 21:27:16] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:16] [INFO ] Invariant cache hit.
[2023-03-08 21:27:17] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 622/2187 places, 1641/4042 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1734 ms. Remains : 622/2187 places, 1641/4042 transitions.
Running random walk in product with property : DLCround-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s170 1)), p2:(OR (EQ s7 0) (EQ s192 0)), p0:(OR (EQ s83 0) (EQ s528 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 964 ms.
Product exploration explored 100000 steps with 0 reset in 1159 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1397 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 21:27:21] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:21] [INFO ] Invariant cache hit.
[2023-03-08 21:27:21] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 21:27:21] [INFO ] [Nat]Absence check using 184 positive place invariants in 25 ms returned sat
[2023-03-08 21:27:22] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-08 21:27:22] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-08 21:27:22] [INFO ] After 82ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-08 21:27:22] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-08 21:27:22] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 622 transition count 1594
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -322
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 105 place count 593 transition count 1916
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 108 place count 593 transition count 1913
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 574 transition count 1417
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 574 transition count 1417
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 165 place count 574 transition count 1398
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 3 with 145 rules applied. Total rules applied 310 place count 574 transition count 1253
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 320 place count 564 transition count 1122
Iterating global reduction 3 with 10 rules applied. Total rules applied 330 place count 564 transition count 1122
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 340 place count 564 transition count 1112
Free-agglomeration rule applied 363 times with reduction of 194 identical transitions.
Iterating global reduction 4 with 363 rules applied. Total rules applied 703 place count 564 transition count 555
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 386 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 387 transitions.
Graph (complete) has 344 edges and 192 vertex of which 45 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.1 ms
Discarding 147 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Iterating post reduction 4 with 760 rules applied. Total rules applied 1463 place count 45 transition count 100
Drop transitions removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1480 place count 45 transition count 83
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1504 place count 21 transition count 38
Iterating global reduction 6 with 24 rules applied. Total rules applied 1528 place count 21 transition count 38
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 6 with 2 rules applied. Total rules applied 1530 place count 20 transition count 37
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1535 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1536 place count 19 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 1537 place count 19 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1538 place count 19 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1539 place count 18 transition count 28
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 5 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 9 rules applied. Total rules applied 1548 place count 12 transition count 24
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1555 place count 12 transition count 17
Applied a total of 1555 rules in 136 ms. Remains 12 /622 variables (removed 610) and now considering 17/1641 (removed 1624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 12/622 places, 17/1641 transitions.
Finished random walk after 88 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=88 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p0 p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 27 factoid took 1207 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Applied a total of 0 rules in 14 ms. Remains 622 /622 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2023-03-08 21:27:24] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:24] [INFO ] Invariant cache hit.
[2023-03-08 21:27:24] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-08 21:27:24] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:24] [INFO ] Invariant cache hit.
[2023-03-08 21:27:24] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-08 21:27:25] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2023-03-08 21:27:25] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:25] [INFO ] Invariant cache hit.
[2023-03-08 21:27:25] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1473 ms. Remains : 622/622 places, 1641/1641 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1079 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 21:27:27] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:27] [INFO ] Invariant cache hit.
[2023-03-08 21:27:27] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 21:27:27] [INFO ] [Nat]Absence check using 184 positive place invariants in 24 ms returned sat
[2023-03-08 21:27:27] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-08 21:27:27] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-08 21:27:27] [INFO ] After 80ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-08 21:27:27] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-08 21:27:28] [INFO ] After 800ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 622 transition count 1594
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -322
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 105 place count 593 transition count 1916
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 108 place count 593 transition count 1913
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 574 transition count 1417
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 574 transition count 1417
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 165 place count 574 transition count 1398
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 3 with 145 rules applied. Total rules applied 310 place count 574 transition count 1253
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 320 place count 564 transition count 1122
Iterating global reduction 3 with 10 rules applied. Total rules applied 330 place count 564 transition count 1122
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 340 place count 564 transition count 1112
Free-agglomeration rule applied 363 times with reduction of 194 identical transitions.
Iterating global reduction 4 with 363 rules applied. Total rules applied 703 place count 564 transition count 555
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 386 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 387 transitions.
Graph (complete) has 344 edges and 192 vertex of which 45 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.0 ms
Discarding 147 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Iterating post reduction 4 with 760 rules applied. Total rules applied 1463 place count 45 transition count 100
Drop transitions removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1480 place count 45 transition count 83
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1504 place count 21 transition count 38
Iterating global reduction 6 with 24 rules applied. Total rules applied 1528 place count 21 transition count 38
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 6 with 2 rules applied. Total rules applied 1530 place count 20 transition count 37
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1535 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1536 place count 19 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 1537 place count 19 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1538 place count 19 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1539 place count 18 transition count 28
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 5 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 9 rules applied. Total rules applied 1548 place count 12 transition count 24
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1555 place count 12 transition count 17
Applied a total of 1555 rules in 126 ms. Remains 12 /622 variables (removed 610) and now considering 17/1641 (removed 1624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 12/622 places, 17/1641 transitions.
Finished random walk after 161 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=80 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND p2 p0 (NOT p1)))), (F (AND (NOT p2) p0)), (F (AND p2 p0 p1)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p2 p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 26 factoid took 1441 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1043 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 948 ms.
Product exploration explored 100000 steps with 0 reset in 1064 ms.
Built C files in :
/tmp/ltsmin4317394893263530871
[2023-03-08 21:27:33] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4317394893263530871
Running compilation step : cd /tmp/ltsmin4317394893263530871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4317394893263530871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4317394893263530871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Applied a total of 0 rules in 6 ms. Remains 622 /622 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2023-03-08 21:27:36] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:36] [INFO ] Invariant cache hit.
[2023-03-08 21:27:36] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-08 21:27:36] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:36] [INFO ] Invariant cache hit.
[2023-03-08 21:27:36] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-08 21:27:36] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2023-03-08 21:27:36] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-08 21:27:36] [INFO ] Invariant cache hit.
[2023-03-08 21:27:37] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1452 ms. Remains : 622/622 places, 1641/1641 transitions.
Built C files in :
/tmp/ltsmin11305445079690206415
[2023-03-08 21:27:37] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11305445079690206415
Running compilation step : cd /tmp/ltsmin11305445079690206415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11305445079690206415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11305445079690206415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 21:27:40] [INFO ] Flatten gal took : 74 ms
[2023-03-08 21:27:40] [INFO ] Flatten gal took : 85 ms
[2023-03-08 21:27:40] [INFO ] Time to serialize gal into /tmp/LTL1897073349229526760.gal : 6 ms
[2023-03-08 21:27:40] [INFO ] Time to serialize properties into /tmp/LTL10455211148695484070.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1897073349229526760.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1488333940186690660.hoa' '-atoms' '/tmp/LTL10455211148695484070.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10455211148695484070.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1488333940186690660.hoa
Detected timeout of ITS tools.
[2023-03-08 21:27:55] [INFO ] Flatten gal took : 72 ms
[2023-03-08 21:27:55] [INFO ] Flatten gal took : 76 ms
[2023-03-08 21:27:56] [INFO ] Time to serialize gal into /tmp/LTL11144708265836494854.gal : 7 ms
[2023-03-08 21:27:56] [INFO ] Time to serialize properties into /tmp/LTL11062072613776460059.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11144708265836494854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11062072613776460059.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((G(((!((!("((p167==1)&&(p1988==1))"))U(X("((p167==1)&&(p1988==1))"))))||("(p1202==0)"))||("(p3181==0)")))||(X(X("((p141==0)||(p...172
Formula 0 simplified : G(F(!"(p1202==0)" & !"(p3181==0)" & (!"((p167==1)&&(p1988==1))" U X"((p167==1)&&(p1988==1))")) & F!"((p141==0)||(p2061==0))")
Detected timeout of ITS tools.
[2023-03-08 21:28:11] [INFO ] Flatten gal took : 77 ms
[2023-03-08 21:28:11] [INFO ] Applying decomposition
[2023-03-08 21:28:11] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14335695947198121351.txt' '-o' '/tmp/graph14335695947198121351.bin' '-w' '/tmp/graph14335695947198121351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14335695947198121351.bin' '-l' '-1' '-v' '-w' '/tmp/graph14335695947198121351.weights' '-q' '0' '-e' '0.001'
[2023-03-08 21:28:11] [INFO ] Decomposing Gal with order
[2023-03-08 21:28:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 21:28:11] [INFO ] Removed a total of 4401 redundant transitions.
[2023-03-08 21:28:11] [INFO ] Flatten gal took : 82 ms
[2023-03-08 21:28:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 75 ms.
[2023-03-08 21:28:11] [INFO ] Time to serialize gal into /tmp/LTL13806626649538020827.gal : 7 ms
[2023-03-08 21:28:11] [INFO ] Time to serialize properties into /tmp/LTL14507765242014116632.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13806626649538020827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14507765242014116632.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G((G(((!((!("((i1.u2.p167==1)&&(i1.u64.p1988==1))"))U(X("((i1.u2.p167==1)&&(i1.u64.p1988==1))"))))||("(i10.u30.p1202==0)"))||("(i...228
Formula 0 simplified : G(F(!"(i10.u30.p1202==0)" & !"(i10.u183.p3181==0)" & (!"((i1.u2.p167==1)&&(i1.u64.p1988==1))" U X"((i1.u2.p167==1)&&(i1.u64.p1988==1...204
Reverse transition relation is NOT exact ! Due to transitions t1889_t1000_t1003_t1337_t1007, i1.t1382, i4.t128, i4.t125, i4.t121, i4.u6.t126, i4.u7.t123, i...821
Computing Next relation with stutter on 3.14573e+07 deadlock states
7 unique states visited
3 strongly connected components in search stack
16 transitions explored
7 items max in DFS search stack
430 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.3936,286984,1,0,844442,316,9744,1.12273e+06,271,874,130601
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property DLCround-PT-09b-LTLFireability-14 finished in 62896 ms.
FORMULA DLCround-PT-09b-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : DLCround-PT-09b-LTLFireability-15
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1922 edges and 2187 vertex of which 531 / 2187 are part of one of the 43 SCC in 2 ms
Free SCC test removed 488 places
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 335 place count 1698 transition count 3181
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 377 rules applied. Total rules applied 712 place count 1364 transition count 3138
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 740 place count 1336 transition count 3138
Performed 183 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 183 Pre rules applied. Total rules applied 740 place count 1336 transition count 2955
Deduced a syphon composed of 183 places in 11 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 1106 place count 1153 transition count 2955
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 1178 place count 1081 transition count 2343
Iterating global reduction 3 with 72 rules applied. Total rules applied 1250 place count 1081 transition count 2343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1254 place count 1081 transition count 2339
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1254 place count 1081 transition count 2337
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1258 place count 1079 transition count 2337
Performed 413 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 413 places in 0 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 4 with 826 rules applied. Total rules applied 2084 place count 666 transition count 1914
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2094 place count 666 transition count 1904
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2119 place count 641 transition count 1591
Iterating global reduction 5 with 25 rules applied. Total rules applied 2144 place count 641 transition count 1591
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2168 place count 641 transition count 1567
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 2194 place count 628 transition count 1686
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2198 place count 628 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2202 place count 624 transition count 1598
Iterating global reduction 7 with 4 rules applied. Total rules applied 2206 place count 624 transition count 1598
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2210 place count 624 transition count 1594
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2218 place count 620 transition count 1628
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2222 place count 620 transition count 1624
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2223 place count 619 transition count 1623
Applied a total of 2223 rules in 262 ms. Remains 619 /2187 variables (removed 1568) and now considering 1623/4042 (removed 2419) transitions.
[2023-03-08 21:28:18] [INFO ] Flow matrix only has 1574 transitions (discarded 49 similar events)
// Phase 1: matrix 1574 rows 619 cols
[2023-03-08 21:28:18] [INFO ] Computed 184 place invariants in 8 ms
[2023-03-08 21:28:18] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-08 21:28:18] [INFO ] Flow matrix only has 1574 transitions (discarded 49 similar events)
[2023-03-08 21:28:18] [INFO ] Invariant cache hit.
[2023-03-08 21:28:19] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-08 21:28:19] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2023-03-08 21:28:19] [INFO ] Flow matrix only has 1574 transitions (discarded 49 similar events)
[2023-03-08 21:28:19] [INFO ] Invariant cache hit.
[2023-03-08 21:28:20] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 619/2187 places, 1623/4042 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1784 ms. Remains : 619/2187 places, 1623/4042 transitions.
Running random walk in product with property : DLCround-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s77 1), p0:(OR (EQ s106 0) (EQ s600 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1231 steps with 1 reset in 16 ms.
Treatment of property DLCround-PT-09b-LTLFireability-15 finished in 2050 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-08 21:28:20] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17492945176892571501
[2023-03-08 21:28:20] [INFO ] Too many transitions (4042) to apply POR reductions. Disabling POR matrices.
[2023-03-08 21:28:20] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17492945176892571501
Running compilation step : cd /tmp/ltsmin17492945176892571501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-08 21:28:20] [INFO ] Applying decomposition
[2023-03-08 21:28:20] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10194665142404371563.txt' '-o' '/tmp/graph10194665142404371563.bin' '-w' '/tmp/graph10194665142404371563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10194665142404371563.bin' '-l' '-1' '-v' '-w' '/tmp/graph10194665142404371563.weights' '-q' '0' '-e' '0.001'
[2023-03-08 21:28:20] [INFO ] Decomposing Gal with order
[2023-03-08 21:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 21:28:21] [INFO ] Removed a total of 3928 redundant transitions.
[2023-03-08 21:28:21] [INFO ] Flatten gal took : 145 ms
[2023-03-08 21:28:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 66 ms.
[2023-03-08 21:28:21] [INFO ] Time to serialize gal into /tmp/LTLFireability6160531882540887351.gal : 20 ms
[2023-03-08 21:28:21] [INFO ] Time to serialize properties into /tmp/LTLFireability17871218774211368879.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6160531882540887351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17871218774211368879.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("((i18.u397.p1556==0)||(i18.u812.p3431==0))"))||(X(F("(i12.u294.p1177==1)")))))
Formula 0 simplified : F!"((i18.u397.p1556==0)||(i18.u812.p3431==0))" & XG!"(i12.u294.p1177==1)"
Compilation finished in 10300 ms.
Running link step : cd /tmp/ltsmin17492945176892571501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin17492945176892571501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp3==true))||X(<>((LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-08 21:50:08] [INFO ] Applying decomposition
[2023-03-08 21:50:09] [INFO ] Flatten gal took : 185 ms
[2023-03-08 21:50:09] [INFO ] Decomposing Gal with order
[2023-03-08 21:50:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 21:50:16] [INFO ] Removed a total of 3368 redundant transitions.
[2023-03-08 21:50:16] [INFO ] Flatten gal took : 391 ms
[2023-03-08 21:50:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 29340 labels/synchronizations in 6855 ms.
[2023-03-08 21:50:25] [INFO ] Time to serialize gal into /tmp/LTLFireability10343224622837441321.gal : 77 ms
[2023-03-08 21:50:25] [INFO ] Time to serialize properties into /tmp/LTLFireability15265579259900662003.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10343224622837441321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15265579259900662003.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((G("((i0.u27.p1556==0)||(i1.i0.i0.i0.i0.i0.i0.u360.p3431==0))"))||(X(F("(i0.i0.i0.i0.u24.p1177==1)")))))
Formula 0 simplified : F!"((i0.u27.p1556==0)||(i1.i0.i0.i0.i0.i0.i0.u360.p3431==0))" & XG!"(i0.i0.i0.i0.u24.p1177==1)"
Detected timeout of ITS tools.
[2023-03-08 22:12:14] [INFO ] Flatten gal took : 244 ms
[2023-03-08 22:12:22] [INFO ] Input system was already deterministic with 4042 transitions.
[2023-03-08 22:12:22] [INFO ] Transformed 2187 places.
[2023-03-08 22:12:22] [INFO ] Transformed 4042 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-08 22:12:24] [INFO ] Time to serialize gal into /tmp/LTLFireability7188762675366184711.gal : 68 ms
[2023-03-08 22:12:24] [INFO ] Time to serialize properties into /tmp/LTLFireability17985231202598987228.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7188762675366184711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17985231202598987228.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((p1556==0)||(p3431==0))"))||(X(F("(p1177==1)")))))
Formula 0 simplified : F!"((p1556==0)||(p3431==0))" & XG!"(p1177==1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8119656 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15626436 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DLCround-PT-09b"
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-5348"
echo " Executing tool itstools"
echo " Input is DLCround-PT-09b, 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 r101-tall-167814475800724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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