Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.7K Apr 30 06:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 06:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 244K May 10 09:34 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 ShieldRVs-PT-020B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653052726608

Running Version 202205111006
[2022-05-20 13:18:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 13:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 13:18:48] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-05-20 13:18:48] [INFO ] Transformed 803 places.
[2022-05-20 13:18:48] [INFO ] Transformed 903 transitions.
[2022-05-20 13:18:48] [INFO ] Found NUPN structural information;
[2022-05-20 13:18:48] [INFO ] Parsed PT model containing 803 places and 903 transitions in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 67 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 903/903 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 675 transition count 775
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 675 transition count 775
Applied a total of 256 rules in 107 ms. Remains 675 /803 variables (removed 128) and now considering 775/903 (removed 128) transitions.
// Phase 1: matrix 775 rows 675 cols
[2022-05-20 13:18:48] [INFO ] Computed 81 place invariants in 27 ms
[2022-05-20 13:18:48] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 775 rows 675 cols
[2022-05-20 13:18:48] [INFO ] Computed 81 place invariants in 10 ms
[2022-05-20 13:18:49] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
// Phase 1: matrix 775 rows 675 cols
[2022-05-20 13:18:49] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 13:18:49] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/803 places, 775/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/803 places, 775/903 transitions.
Support contains 67 out of 675 places after structural reductions.
[2022-05-20 13:18:49] [INFO ] Flatten gal took : 97 ms
[2022-05-20 13:18:49] [INFO ] Flatten gal took : 52 ms
[2022-05-20 13:18:50] [INFO ] Input system was already deterministic with 775 transitions.
Support contains 64 out of 675 places (down from 67) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 38) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 775 rows 675 cols
[2022-05-20 13:18:50] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:18:51] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2022-05-20 13:18:51] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 13:18:51] [INFO ] [Nat]Absence check using 81 positive place invariants in 153 ms returned sat
[2022-05-20 13:18:51] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 13:18:52] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 7 ms to minimize.
[2022-05-20 13:18:52] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 1 ms to minimize.
[2022-05-20 13:18:52] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2022-05-20 13:18:52] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2022-05-20 13:18:52] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2022-05-20 13:18:53] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2022-05-20 13:18:53] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2022-05-20 13:18:53] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2022-05-20 13:18:53] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2022-05-20 13:18:53] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2022-05-20 13:18:53] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-20 13:18:53] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 0 ms to minimize.
[2022-05-20 13:18:54] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 0 ms to minimize.
[2022-05-20 13:18:54] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-05-20 13:18:54] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2022-05-20 13:18:54] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2022-05-20 13:18:54] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2022-05-20 13:18:54] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 0 ms to minimize.
[2022-05-20 13:18:54] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2022-05-20 13:18:54] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2022-05-20 13:18:54] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 0 ms to minimize.
[2022-05-20 13:18:55] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2022-05-20 13:18:55] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2022-05-20 13:18:55] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2022-05-20 13:18:55] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-05-20 13:18:55] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2022-05-20 13:18:55] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2022-05-20 13:18:55] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-20 13:18:55] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-20 13:18:55] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2022-05-20 13:18:56] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4015 ms
[2022-05-20 13:18:56] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2022-05-20 13:18:56] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2022-05-20 13:18:56] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 0 ms to minimize.
[2022-05-20 13:18:56] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2022-05-20 13:18:56] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 4 ms to minimize.
[2022-05-20 13:18:56] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2022-05-20 13:18:56] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1360 ms
[2022-05-20 13:18:57] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2022-05-20 13:18:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 435 ms
[2022-05-20 13:18:57] [INFO ] After 6393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 146 ms.
[2022-05-20 13:18:58] [INFO ] After 7023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 170 ms.
Support contains 11 out of 675 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 675/675 places, 775/775 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 675 transition count 698
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 598 transition count 698
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 154 place count 598 transition count 598
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 354 place count 498 transition count 598
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 365 place count 487 transition count 587
Iterating global reduction 2 with 11 rules applied. Total rules applied 376 place count 487 transition count 587
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 376 place count 487 transition count 582
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 386 place count 482 transition count 582
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 1 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 2 with 384 rules applied. Total rules applied 770 place count 290 transition count 390
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 809 place count 290 transition count 390
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 810 place count 289 transition count 389
Applied a total of 810 rules in 260 ms. Remains 289 /675 variables (removed 386) and now considering 389/775 (removed 386) transitions.
Finished structural reductions, in 1 iterations. Remains : 289/675 places, 389/775 transitions.
Finished random walk after 648 steps, including 2 resets, run visited all 4 properties in 4 ms. (steps per millisecond=162 )
Computed a total of 167 stabilizing places and 167 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G(p0)||p1))&&p0)))'
Support contains 4 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 674 transition count 696
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 596 transition count 696
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 156 place count 596 transition count 595
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 358 place count 495 transition count 595
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 371 place count 482 transition count 582
Iterating global reduction 2 with 13 rules applied. Total rules applied 384 place count 482 transition count 582
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 384 place count 482 transition count 577
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 394 place count 477 transition count 577
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 774 place count 287 transition count 387
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 776 place count 285 transition count 385
Applied a total of 776 rules in 106 ms. Remains 285 /675 variables (removed 390) and now considering 385/775 (removed 390) transitions.
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:18:59] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:18:59] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:18:59] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:18:59] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2022-05-20 13:18:59] [INFO ] Redundant transitions in 86 ms returned [384]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 384 rows 285 cols
[2022-05-20 13:18:59] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:18:59] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/675 places, 384/775 transitions.
Applied a total of 0 rules in 9 ms. Remains 285 /285 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 285/675 places, 384/775 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-00 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 s187 1), p1:(AND (EQ s45 1) (EQ s63 1) (EQ s73 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 288 steps with 0 reset in 8 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-00 finished in 1212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U F(X(p1)))&&!(p2 U p3)&&X(p0)))'
Support contains 8 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 662 transition count 762
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 662 transition count 762
Applied a total of 26 rules in 26 ms. Remains 662 /675 variables (removed 13) and now considering 762/775 (removed 13) transitions.
// Phase 1: matrix 762 rows 662 cols
[2022-05-20 13:19:00] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 13:19:00] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 762 rows 662 cols
[2022-05-20 13:19:00] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:19:00] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
// Phase 1: matrix 762 rows 662 cols
[2022-05-20 13:19:00] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:19:01] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 662/675 places, 762/775 transitions.
Finished structural reductions, in 1 iterations. Remains : 662/675 places, 762/775 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0) p3), true, p3, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s582 1), p2:(AND (EQ s445 1) (EQ s481 1) (EQ s500 1)), p0:(EQ s661 1), p1:(AND (EQ s288 1) (EQ s292 1) (EQ s300 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-01 finished in 1242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1) U !p0)))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 674 transition count 695
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 595 transition count 695
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 158 place count 595 transition count 595
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 358 place count 495 transition count 595
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 369 place count 484 transition count 584
Iterating global reduction 2 with 11 rules applied. Total rules applied 380 place count 484 transition count 584
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 380 place count 484 transition count 580
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 388 place count 480 transition count 580
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 2 with 388 rules applied. Total rules applied 776 place count 286 transition count 386
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 778 place count 284 transition count 384
Applied a total of 778 rules in 71 ms. Remains 284 /675 variables (removed 391) and now considering 384/775 (removed 391) transitions.
// Phase 1: matrix 384 rows 284 cols
[2022-05-20 13:19:01] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:19:01] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 384 rows 284 cols
[2022-05-20 13:19:01] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:19:01] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2022-05-20 13:19:01] [INFO ] Redundant transitions in 63 ms returned [383]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 383 rows 284 cols
[2022-05-20 13:19:01] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:19:02] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/675 places, 383/775 transitions.
Applied a total of 0 rules in 8 ms. Remains 284 /284 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 284/675 places, 383/775 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p0), (OR (NOT p1) p0), true, true]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s122 1), p0:(EQ s140 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 26932 reset in 458 ms.
Product exploration explored 100000 steps with 27154 reset in 381 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/284 stabilizing places and 2/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 395 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 9 factoid took 400 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 383 rows 284 cols
[2022-05-20 13:19:03] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:19:04] [INFO ] [Real]Absence check using 81 positive place invariants in 15 ms returned sat
[2022-05-20 13:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 13:19:04] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2022-05-20 13:19:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 13:19:04] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2022-05-20 13:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 13:19:04] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2022-05-20 13:19:04] [INFO ] Computed and/alt/rep : 343/1468/343 causal constraints (skipped 38 transitions) in 26 ms.
[2022-05-20 13:19:07] [INFO ] Added : 340 causal constraints over 68 iterations in 2858 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 284 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 383/383 transitions.
Applied a total of 0 rules in 11 ms. Remains 284 /284 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 284 cols
[2022-05-20 13:19:07] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 13:19:07] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 383 rows 284 cols
[2022-05-20 13:19:07] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:19:07] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2022-05-20 13:19:07] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 383 rows 284 cols
[2022-05-20 13:19:07] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:19:08] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 284/284 places, 383/383 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/284 stabilizing places and 2/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
// Phase 1: matrix 383 rows 284 cols
[2022-05-20 13:19:08] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:19:08] [INFO ] [Real]Absence check using 81 positive place invariants in 15 ms returned sat
[2022-05-20 13:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 13:19:08] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-05-20 13:19:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 13:19:09] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2022-05-20 13:19:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 13:19:09] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-20 13:19:09] [INFO ] Computed and/alt/rep : 343/1468/343 causal constraints (skipped 38 transitions) in 30 ms.
[2022-05-20 13:19:11] [INFO ] Added : 340 causal constraints over 68 iterations in 2747 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27089 reset in 335 ms.
Product exploration explored 100000 steps with 27003 reset in 357 ms.
Built C files in :
/tmp/ltsmin15351421981862450782
[2022-05-20 13:19:12] [INFO ] Computing symmetric may disable matrix : 383 transitions.
[2022-05-20 13:19:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:12] [INFO ] Computing symmetric may enable matrix : 383 transitions.
[2022-05-20 13:19:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:12] [INFO ] Computing Do-Not-Accords matrix : 383 transitions.
[2022-05-20 13:19:12] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:12] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15351421981862450782
Running compilation step : cd /tmp/ltsmin15351421981862450782;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 898 ms.
Running link step : cd /tmp/ltsmin15351421981862450782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin15351421981862450782;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16334525622537688697.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 283 transition count 382
Applied a total of 2 rules in 30 ms. Remains 283 /284 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:19:27] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:19:28] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:19:28] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:19:28] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2022-05-20 13:19:28] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:19:28] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:19:28] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/284 places, 382/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/284 places, 382/383 transitions.
Built C files in :
/tmp/ltsmin5463357079144712136
[2022-05-20 13:19:28] [INFO ] Computing symmetric may disable matrix : 382 transitions.
[2022-05-20 13:19:28] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:28] [INFO ] Computing symmetric may enable matrix : 382 transitions.
[2022-05-20 13:19:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:28] [INFO ] Computing Do-Not-Accords matrix : 382 transitions.
[2022-05-20 13:19:28] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:28] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5463357079144712136
Running compilation step : cd /tmp/ltsmin5463357079144712136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 799 ms.
Running link step : cd /tmp/ltsmin5463357079144712136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5463357079144712136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1442723759219398722.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 13:19:43] [INFO ] Flatten gal took : 22 ms
[2022-05-20 13:19:43] [INFO ] Flatten gal took : 22 ms
[2022-05-20 13:19:43] [INFO ] Time to serialize gal into /tmp/LTL7100372870740112128.gal : 6 ms
[2022-05-20 13:19:43] [INFO ] Time to serialize properties into /tmp/LTL7685135704120071215.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7100372870740112128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7685135704120071215.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7100372...266
Read 1 LTL properties
Checking formula 0 : !(((F("(p401==1)"))&&((G("(p356==1)"))U("(p401!=1)"))))
Formula 0 simplified : !(F"(p401==1)" & (G"(p356==1)" U "(p401!=1)"))
Detected timeout of ITS tools.
[2022-05-20 13:19:58] [INFO ] Flatten gal took : 21 ms
[2022-05-20 13:19:58] [INFO ] Applying decomposition
[2022-05-20 13:19:58] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14939401442404583025.txt' '-o' '/tmp/graph14939401442404583025.bin' '-w' '/tmp/graph14939401442404583025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14939401442404583025.bin' '-l' '-1' '-v' '-w' '/tmp/graph14939401442404583025.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:19:59] [INFO ] Decomposing Gal with order
[2022-05-20 13:19:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:19:59] [INFO ] Removed a total of 421 redundant transitions.
[2022-05-20 13:19:59] [INFO ] Flatten gal took : 83 ms
[2022-05-20 13:19:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 424 labels/synchronizations in 14 ms.
[2022-05-20 13:19:59] [INFO ] Time to serialize gal into /tmp/LTL929817722881412992.gal : 5 ms
[2022-05-20 13:19:59] [INFO ] Time to serialize properties into /tmp/LTL11071876172573159479.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL929817722881412992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11071876172573159479.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9298177...245
Read 1 LTL properties
Checking formula 0 : !(((F("(i5.i1.u40.p401==1)"))&&((G("(i5.i0.u35.p356==1)"))U("(i5.i1.u40.p401!=1)"))))
Formula 0 simplified : !(F"(i5.i1.u40.p401==1)" & (G"(i5.i0.u35.p356==1)" U "(i5.i1.u40.p401!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15495599792505384558
[2022-05-20 13:20:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15495599792505384558
Running compilation step : cd /tmp/ltsmin15495599792505384558;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 584 ms.
Running link step : cd /tmp/ltsmin15495599792505384558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15495599792505384558;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&([]((LTLAPp1==true)) U !(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-020B-LTLFireability-02 finished in 87884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 4 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 663 transition count 763
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 663 transition count 763
Applied a total of 24 rules in 28 ms. Remains 663 /675 variables (removed 12) and now considering 763/775 (removed 12) transitions.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:29] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:20:29] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:29] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:20:30] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:30] [INFO ] Computed 81 place invariants in 6 ms
[2022-05-20 13:20:30] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/675 places, 763/775 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/675 places, 763/775 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s132 1), p0:(AND (EQ s171 1) (EQ s182 1) (EQ s201 1) (EQ s132 0))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-03 finished in 1250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)&&G(X((X(p2)&&p1)))))))'
Support contains 8 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 663 transition count 763
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 663 transition count 763
Applied a total of 24 rules in 27 ms. Remains 663 /675 variables (removed 12) and now considering 763/775 (removed 12) transitions.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:30] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:20:30] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:30] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:20:31] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:31] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:31] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/675 places, 763/775 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/675 places, 763/775 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s418 0), p1:(AND (EQ s498 1) (OR (EQ s589 0) (EQ s596 0) (EQ s617 0))), p2:(AND (EQ s32 1) (EQ s36 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-04 finished in 1372 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X((G(X(p0))||G((G(p1)||p2))))))))'
Support contains 5 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 674 transition count 696
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 596 transition count 696
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 156 place count 596 transition count 597
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 354 place count 497 transition count 597
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 366 place count 485 transition count 585
Iterating global reduction 2 with 12 rules applied. Total rules applied 378 place count 485 transition count 585
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 378 place count 485 transition count 580
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 388 place count 480 transition count 580
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 768 place count 290 transition count 390
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 770 place count 288 transition count 388
Applied a total of 770 rules in 69 ms. Remains 288 /675 variables (removed 387) and now considering 388/775 (removed 387) transitions.
// Phase 1: matrix 388 rows 288 cols
[2022-05-20 13:20:32] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:20:32] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 388 rows 288 cols
[2022-05-20 13:20:32] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:32] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2022-05-20 13:20:32] [INFO ] Redundant transitions in 74 ms returned [387]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:20:32] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:20:32] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 288/675 places, 387/775 transitions.
Applied a total of 0 rules in 9 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 288/675 places, 387/775 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s166 0) (EQ s171 0) (EQ s179 0)), p0:(EQ s202 0), p2:(EQ s222 0)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 351 reset in 430 ms.
Product exploration explored 100000 steps with 351 reset in 470 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/288 stabilizing places and 4/387 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 762 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 8) seen :5
Finished Best-First random walk after 2549 steps, including 1 resets, run visited all 3 properties in 9 ms. (steps per millisecond=283 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND p1 p2 p0))), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2 p0)), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 12 factoid took 808 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 6 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:20:35] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 13:20:35] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:20:35] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:36] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2022-05-20 13:20:36] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:20:36] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:20:36] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/288 stabilizing places and 4/387 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
Knowledge based reduction with 12 factoid took 793 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :6
Finished Best-First random walk after 4981 steps, including 2 resets, run visited all 2 properties in 15 ms. (steps per millisecond=332 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (AND (NOT p2) p0 p1)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p2 p0 p1))), (F (AND p2 (NOT p0) p1)), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 12 factoid took 794 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 352 reset in 372 ms.
Product exploration explored 100000 steps with 351 reset in 397 ms.
Built C files in :
/tmp/ltsmin7324206248528478235
[2022-05-20 13:20:39] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2022-05-20 13:20:39] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:20:39] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2022-05-20 13:20:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:20:39] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2022-05-20 13:20:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:20:39] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7324206248528478235
Running compilation step : cd /tmp/ltsmin7324206248528478235;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 816 ms.
Running link step : cd /tmp/ltsmin7324206248528478235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7324206248528478235;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15502723250981981778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 10 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:20:54] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:54] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:20:54] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:20:54] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2022-05-20 13:20:54] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:20:54] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:54] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Built C files in :
/tmp/ltsmin5560061841043870655
[2022-05-20 13:20:54] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2022-05-20 13:20:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:20:54] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2022-05-20 13:20:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:20:54] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2022-05-20 13:20:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:20:54] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5560061841043870655
Running compilation step : cd /tmp/ltsmin5560061841043870655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 813 ms.
Running link step : cd /tmp/ltsmin5560061841043870655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5560061841043870655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9057710316717105921.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 13:21:10] [INFO ] Flatten gal took : 19 ms
[2022-05-20 13:21:10] [INFO ] Flatten gal took : 17 ms
[2022-05-20 13:21:10] [INFO ] Time to serialize gal into /tmp/LTL6908700775510868975.gal : 2 ms
[2022-05-20 13:21:10] [INFO ] Time to serialize properties into /tmp/LTL1667116777573556822.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6908700775510868975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1667116777573556822.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6908700...266
Read 1 LTL properties
Checking formula 0 : !((F(X(X(X((G(X("(p573==0)")))||(G((G("(((p477==0)||(p488==0))||(p511==0))"))||("(p622==0)")))))))))
Formula 0 simplified : !FXXX(GX"(p573==0)" | G("(p622==0)" | G"(((p477==0)||(p488==0))||(p511==0))"))
Detected timeout of ITS tools.
[2022-05-20 13:21:25] [INFO ] Flatten gal took : 18 ms
[2022-05-20 13:21:25] [INFO ] Applying decomposition
[2022-05-20 13:21:25] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13336394141922849748.txt' '-o' '/tmp/graph13336394141922849748.bin' '-w' '/tmp/graph13336394141922849748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13336394141922849748.bin' '-l' '-1' '-v' '-w' '/tmp/graph13336394141922849748.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:21:25] [INFO ] Decomposing Gal with order
[2022-05-20 13:21:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:21:25] [INFO ] Removed a total of 427 redundant transitions.
[2022-05-20 13:21:25] [INFO ] Flatten gal took : 34 ms
[2022-05-20 13:21:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 434 labels/synchronizations in 6 ms.
[2022-05-20 13:21:25] [INFO ] Time to serialize gal into /tmp/LTL8690666313000978712.gal : 4 ms
[2022-05-20 13:21:25] [INFO ] Time to serialize properties into /tmp/LTL5412241319286914798.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8690666313000978712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5412241319286914798.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8690666...245
Read 1 LTL properties
Checking formula 0 : !((F(X(X(X((G(X("(i8.i0.u59.p573==0)")))||(G((G("(((i6.u47.p477==0)||(i6.u50.p488==0))||(i7.i0.u53.p511==0))"))||("(i8.i1.u64.p622==0)...165
Formula 0 simplified : !FXXX(GX"(i8.i0.u59.p573==0)" | G("(i8.i1.u64.p622==0)" | G"(((i6.u47.p477==0)||(i6.u50.p488==0))||(i7.i0.u53.p511==0))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3227675330797570895
[2022-05-20 13:21:40] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3227675330797570895
Running compilation step : cd /tmp/ltsmin3227675330797570895;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 637 ms.
Running link step : cd /tmp/ltsmin3227675330797570895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3227675330797570895;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(X(([](X((LTLAPp0==true)))||[](([]((LTLAPp1==true))||(LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-020B-LTLFireability-05 finished in 83493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F((!(p0 U p1)&&p2))))))'
Support contains 5 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 674 transition count 696
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 157 place count 596 transition count 695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 595 transition count 695
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 158 place count 595 transition count 595
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 358 place count 495 transition count 595
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 370 place count 483 transition count 583
Iterating global reduction 3 with 12 rules applied. Total rules applied 382 place count 483 transition count 583
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 382 place count 483 transition count 579
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 390 place count 479 transition count 579
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 3 with 380 rules applied. Total rules applied 770 place count 289 transition count 389
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 772 place count 287 transition count 387
Applied a total of 772 rules in 87 ms. Remains 287 /675 variables (removed 388) and now considering 387/775 (removed 388) transitions.
// Phase 1: matrix 387 rows 287 cols
[2022-05-20 13:21:55] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:21:55] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 387 rows 287 cols
[2022-05-20 13:21:55] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:21:56] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2022-05-20 13:21:56] [INFO ] Redundant transitions in 60 ms returned [386]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 386 rows 287 cols
[2022-05-20 13:21:56] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:21:56] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 287/675 places, 386/775 transitions.
Applied a total of 0 rules in 7 ms. Remains 287 /287 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 287/675 places, 386/775 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s273 1), p1:(EQ s87 1), p0:(AND (EQ s250 1) (EQ s256 1) (EQ s264 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 294 steps with 1 reset in 1 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-06 finished in 1182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U X(G(p1))))'
Support contains 4 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 663 transition count 763
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 663 transition count 763
Applied a total of 24 rules in 24 ms. Remains 663 /675 variables (removed 12) and now considering 763/775 (removed 12) transitions.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:21:56] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 13:21:56] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:21:56] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:21:57] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:21:57] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:21:57] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/675 places, 763/775 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/675 places, 763/775 transitions.
Stuttering acceptance computed with spot in 113 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s160 1), p1:(AND (EQ s542 1) (EQ s578 1) (EQ s598 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 224 reset in 331 ms.
Product exploration explored 100000 steps with 254 reset in 348 ms.
Computed a total of 159 stabilizing places and 159 stable transitions
Computed a total of 159 stabilizing places and 159 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 280 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:21:58] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 13:21:58] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2022-05-20 13:21:59] [INFO ] After 285ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 13:21:59] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 0 ms to minimize.
[2022-05-20 13:21:59] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2022-05-20 13:21:59] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 0 ms to minimize.
[2022-05-20 13:21:59] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2022-05-20 13:22:00] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 0 ms to minimize.
[2022-05-20 13:22:00] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2022-05-20 13:22:00] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2022-05-20 13:22:00] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 0 ms to minimize.
[2022-05-20 13:22:00] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 3 ms to minimize.
[2022-05-20 13:22:00] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2022-05-20 13:22:01] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 4 ms to minimize.
[2022-05-20 13:22:01] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2022-05-20 13:22:01] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2022-05-20 13:22:01] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2022-05-20 13:22:01] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-20 13:22:01] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2022-05-20 13:22:01] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 1 ms to minimize.
[2022-05-20 13:22:02] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2022-05-20 13:22:02] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 0 ms to minimize.
[2022-05-20 13:22:02] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 0 ms to minimize.
[2022-05-20 13:22:02] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2022-05-20 13:22:02] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3210 ms
[2022-05-20 13:22:02] [INFO ] After 3533ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:22:02] [INFO ] After 3655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:22:02] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2022-05-20 13:22:02] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:22:03] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2022-05-20 13:22:03] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2022-05-20 13:22:03] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
[2022-05-20 13:22:03] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2022-05-20 13:22:03] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2022-05-20 13:22:03] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2022-05-20 13:22:03] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2022-05-20 13:22:04] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2022-05-20 13:22:04] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2022-05-20 13:22:04] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2022-05-20 13:22:04] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2022-05-20 13:22:04] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 0 ms to minimize.
[2022-05-20 13:22:04] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2022-05-20 13:22:04] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2022-05-20 13:22:05] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2022-05-20 13:22:05] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2022-05-20 13:22:05] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2022-05-20 13:22:05] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 0 ms to minimize.
[2022-05-20 13:22:05] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2022-05-20 13:22:05] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2022-05-20 13:22:05] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2022-05-20 13:22:05] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2022-05-20 13:22:06] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2022-05-20 13:22:06] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2022-05-20 13:22:06] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2022-05-20 13:22:06] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2022-05-20 13:22:06] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3502 ms
[2022-05-20 13:22:06] [INFO ] After 3783ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-20 13:22:06] [INFO ] After 3943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 663/663 places, 763/763 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 663 transition count 682
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 582 transition count 682
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 582 transition count 582
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 482 transition count 582
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 0 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 760 place count 283 transition count 383
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 802 place count 283 transition count 383
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 803 place count 282 transition count 382
Applied a total of 803 rules in 51 ms. Remains 282 /663 variables (removed 381) and now considering 382/763 (removed 381) transitions.
Finished structural reductions, in 1 iterations. Remains : 282/663 places, 382/763 transitions.
Finished random walk after 922 steps, including 3 resets, run visited all 1 properties in 5 ms. (steps per millisecond=184 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 373 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 100 ms :[p1, p1, (AND p0 p1)]
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 763/763 transitions.
Applied a total of 0 rules in 20 ms. Remains 663 /663 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:22:07] [INFO ] Computed 81 place invariants in 7 ms
[2022-05-20 13:22:07] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:22:07] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:22:07] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:22:07] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:22:08] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/663 places, 763/763 transitions.
Computed a total of 159 stabilizing places and 159 stable transitions
Computed a total of 159 stabilizing places and 159 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:22:08] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:22:08] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2022-05-20 13:22:08] [INFO ] After 266ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 13:22:09] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 0 ms to minimize.
[2022-05-20 13:22:09] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2022-05-20 13:22:09] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 1 ms to minimize.
[2022-05-20 13:22:09] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2022-05-20 13:22:09] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2022-05-20 13:22:09] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2022-05-20 13:22:10] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2022-05-20 13:22:10] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 0 ms to minimize.
[2022-05-20 13:22:10] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2022-05-20 13:22:10] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 1 ms to minimize.
[2022-05-20 13:22:10] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 0 ms to minimize.
[2022-05-20 13:22:10] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2022-05-20 13:22:10] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 0 ms to minimize.
[2022-05-20 13:22:11] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 0 ms to minimize.
[2022-05-20 13:22:11] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2022-05-20 13:22:11] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2022-05-20 13:22:11] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2022-05-20 13:22:11] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2022-05-20 13:22:11] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-20 13:22:11] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2022-05-20 13:22:11] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2022-05-20 13:22:12] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3062 ms
[2022-05-20 13:22:12] [INFO ] After 3372ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:22:12] [INFO ] After 3474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:22:12] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2022-05-20 13:22:12] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:22:12] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2022-05-20 13:22:12] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2022-05-20 13:22:12] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2022-05-20 13:22:13] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2022-05-20 13:22:13] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 0 ms to minimize.
[2022-05-20 13:22:13] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2022-05-20 13:22:13] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2022-05-20 13:22:13] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 0 ms to minimize.
[2022-05-20 13:22:13] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2022-05-20 13:22:13] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2022-05-20 13:22:13] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2022-05-20 13:22:14] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2022-05-20 13:22:14] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2022-05-20 13:22:14] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2022-05-20 13:22:14] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2022-05-20 13:22:14] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 0 ms to minimize.
[2022-05-20 13:22:14] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 0 ms to minimize.
[2022-05-20 13:22:14] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 0 ms to minimize.
[2022-05-20 13:22:14] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 0 ms to minimize.
[2022-05-20 13:22:15] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2022-05-20 13:22:15] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2022-05-20 13:22:15] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-20 13:22:15] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2022-05-20 13:22:15] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 0 ms to minimize.
[2022-05-20 13:22:15] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2022-05-20 13:22:15] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2022-05-20 13:22:15] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3337 ms
[2022-05-20 13:22:15] [INFO ] After 3614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 13:22:15] [INFO ] After 3761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 663/663 places, 763/763 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 663 transition count 682
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 582 transition count 682
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 582 transition count 582
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 482 transition count 582
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 0 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 760 place count 283 transition count 383
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 802 place count 283 transition count 383
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 803 place count 282 transition count 382
Applied a total of 803 rules in 42 ms. Remains 282 /663 variables (removed 381) and now considering 382/763 (removed 381) transitions.
Finished structural reductions, in 1 iterations. Remains : 282/663 places, 382/763 transitions.
Finished random walk after 949 steps, including 3 resets, run visited all 1 properties in 5 ms. (steps per millisecond=189 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 95 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 117 ms :[p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 206 reset in 324 ms.
Product exploration explored 100000 steps with 238 reset in 334 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 105 ms :[p1, p1, (AND p0 p1)]
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 763/763 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 663 transition count 763
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 78 place count 663 transition count 783
Deduced a syphon composed of 121 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 121 place count 663 transition count 783
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 662 transition count 782
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 662 transition count 782
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 376 places in 1 ms
Iterating global reduction 1 with 256 rules applied. Total rules applied 379 place count 662 transition count 782
Renaming transitions due to excessive name length > 1024 char.
Discarding 136 places :
Symmetric choice reduction at 1 with 136 rule applications. Total rules 515 place count 526 transition count 646
Deduced a syphon composed of 240 places in 0 ms
Iterating global reduction 1 with 136 rules applied. Total rules applied 651 place count 526 transition count 646
Deduced a syphon composed of 240 places in 1 ms
Applied a total of 651 rules in 115 ms. Remains 526 /663 variables (removed 137) and now considering 646/763 (removed 117) transitions.
[2022-05-20 13:22:17] [INFO ] Redundant transitions in 70 ms returned [645]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 645 rows 526 cols
[2022-05-20 13:22:17] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:22:17] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/663 places, 645/763 transitions.
Deduced a syphon composed of 240 places in 1 ms
Applied a total of 0 rules in 16 ms. Remains 526 /526 variables (removed 0) and now considering 645/645 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 526/663 places, 645/763 transitions.
Product exploration explored 100000 steps with 247 reset in 330 ms.
Product exploration explored 100000 steps with 258 reset in 384 ms.
Built C files in :
/tmp/ltsmin10831338721459334754
[2022-05-20 13:22:18] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10831338721459334754
Running compilation step : cd /tmp/ltsmin10831338721459334754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1224 ms.
Running link step : cd /tmp/ltsmin10831338721459334754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10831338721459334754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased953099478220163148.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 763/763 transitions.
Applied a total of 0 rules in 13 ms. Remains 663 /663 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:22:33] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 13:22:33] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:22:33] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:22:34] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:22:34] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:22:34] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/663 places, 763/763 transitions.
Built C files in :
/tmp/ltsmin11621800518511997076
[2022-05-20 13:22:34] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11621800518511997076
Running compilation step : cd /tmp/ltsmin11621800518511997076;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1153 ms.
Running link step : cd /tmp/ltsmin11621800518511997076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11621800518511997076;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16293645641313936538.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 13:22:49] [INFO ] Flatten gal took : 34 ms
[2022-05-20 13:22:49] [INFO ] Flatten gal took : 25 ms
[2022-05-20 13:22:49] [INFO ] Time to serialize gal into /tmp/LTL1508118749917891416.gal : 3 ms
[2022-05-20 13:22:49] [INFO ] Time to serialize properties into /tmp/LTL9718760914063626395.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1508118749917891416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9718760914063626395.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1508118...266
Read 1 LTL properties
Checking formula 0 : !((!((F("(p188==1)"))U(X(G("(((p653==1)&&(p697==1))&&(p722==1))"))))))
Formula 0 simplified : F"(p188==1)" U XG"(((p653==1)&&(p697==1))&&(p722==1))"
Detected timeout of ITS tools.
[2022-05-20 13:23:05] [INFO ] Flatten gal took : 59 ms
[2022-05-20 13:23:05] [INFO ] Applying decomposition
[2022-05-20 13:23:05] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph243470563024226143.txt' '-o' '/tmp/graph243470563024226143.bin' '-w' '/tmp/graph243470563024226143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph243470563024226143.bin' '-l' '-1' '-v' '-w' '/tmp/graph243470563024226143.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:23:05] [INFO ] Decomposing Gal with order
[2022-05-20 13:23:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:23:05] [INFO ] Removed a total of 711 redundant transitions.
[2022-05-20 13:23:05] [INFO ] Flatten gal took : 103 ms
[2022-05-20 13:23:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-20 13:23:05] [INFO ] Time to serialize gal into /tmp/LTL18267771813232781836.gal : 8 ms
[2022-05-20 13:23:05] [INFO ] Time to serialize properties into /tmp/LTL5731460286738852311.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18267771813232781836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5731460286738852311.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1826777...246
Read 1 LTL properties
Checking formula 0 : !((!((F("(i2.u61.p188==1)"))U(X(G("(((i8.i1.i2.u205.p653==1)&&(i9.i0.i0.u218.p697==1))&&(i9.i0.i2.u225.p722==1))"))))))
Formula 0 simplified : F"(i2.u61.p188==1)" U XG"(((i8.i1.i2.u205.p653==1)&&(i9.i0.i0.u218.p697==1))&&(i9.i0.i2.u225.p722==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16696798129414668562
[2022-05-20 13:23:20] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16696798129414668562
Running compilation step : cd /tmp/ltsmin16696798129414668562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1146 ms.
Running link step : cd /tmp/ltsmin16696798129414668562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16696798129414668562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(<>((LTLAPp0==true)) U X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-020B-LTLFireability-07 finished in 98940 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!(F(X((G(p0)&&p1))) U p1))&&p2)))'
Support contains 2 out of 675 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 664 transition count 764
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 664 transition count 764
Applied a total of 22 rules in 31 ms. Remains 664 /675 variables (removed 11) and now considering 764/775 (removed 11) transitions.
// Phase 1: matrix 764 rows 664 cols
[2022-05-20 13:23:35] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 13:23:35] [INFO ] Implicit Places using invariants in 327 ms returned []
// Phase 1: matrix 764 rows 664 cols
[2022-05-20 13:23:35] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:23:36] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
// Phase 1: matrix 764 rows 664 cols
[2022-05-20 13:23:36] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:23:36] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/675 places, 764/775 transitions.
Finished structural reductions, in 1 iterations. Remains : 664/675 places, 764/775 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (OR (NOT p2) p1), p1, (OR (NOT p2) p1)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s516 1), p2:(EQ s163 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 223 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-08 finished in 1379 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 674 transition count 695
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 595 transition count 695
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 158 place count 595 transition count 595
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 358 place count 495 transition count 595
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 370 place count 483 transition count 583
Iterating global reduction 2 with 12 rules applied. Total rules applied 382 place count 483 transition count 583
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 382 place count 483 transition count 579
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 390 place count 479 transition count 579
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 2 with 388 rules applied. Total rules applied 778 place count 285 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 780 place count 283 transition count 383
Applied a total of 780 rules in 67 ms. Remains 283 /675 variables (removed 392) and now considering 383/775 (removed 392) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:23:37] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:23:37] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:23:37] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:23:37] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2022-05-20 13:23:37] [INFO ] Redundant transitions in 66 ms returned [382]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:23:37] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:23:37] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/675 places, 382/775 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 283/675 places, 382/775 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s181 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]]
Product exploration explored 100000 steps with 26997 reset in 325 ms.
Product exploration explored 100000 steps with 27061 reset in 359 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/283 stabilizing places and 2/382 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:23:38] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:23:38] [INFO ] [Real]Absence check using 81 positive place invariants in 14 ms returned sat
[2022-05-20 13:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 13:23:39] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-05-20 13:23:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 13:23:39] [INFO ] [Nat]Absence check using 81 positive place invariants in 16 ms returned sat
[2022-05-20 13:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 13:23:39] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-05-20 13:23:39] [INFO ] Computed and/alt/rep : 341/1460/341 causal constraints (skipped 39 transitions) in 26 ms.
[2022-05-20 13:23:42] [INFO ] Added : 331 causal constraints over 67 iterations in 2968 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 382/382 transitions.
Applied a total of 0 rules in 9 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:23:42] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:23:42] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:23:42] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:23:42] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-05-20 13:23:42] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:23:42] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:23:43] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 382/382 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/283 stabilizing places and 2/382 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:23:43] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:23:43] [INFO ] [Real]Absence check using 81 positive place invariants in 15 ms returned sat
[2022-05-20 13:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 13:23:43] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-05-20 13:23:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 13:23:44] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2022-05-20 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 13:23:44] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-05-20 13:23:44] [INFO ] Computed and/alt/rep : 341/1460/341 causal constraints (skipped 39 transitions) in 25 ms.
[2022-05-20 13:23:47] [INFO ] Added : 331 causal constraints over 67 iterations in 2874 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27088 reset in 326 ms.
Product exploration explored 100000 steps with 26933 reset in 372 ms.
Built C files in :
/tmp/ltsmin16500266307146003889
[2022-05-20 13:23:47] [INFO ] Computing symmetric may disable matrix : 382 transitions.
[2022-05-20 13:23:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:23:47] [INFO ] Computing symmetric may enable matrix : 382 transitions.
[2022-05-20 13:23:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:23:47] [INFO ] Computing Do-Not-Accords matrix : 382 transitions.
[2022-05-20 13:23:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:23:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16500266307146003889
Running compilation step : cd /tmp/ltsmin16500266307146003889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 762 ms.
Running link step : cd /tmp/ltsmin16500266307146003889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16500266307146003889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11058894444213858556.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 382/382 transitions.
Applied a total of 0 rules in 7 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:24:02] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:24:03] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:24:03] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:24:03] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2022-05-20 13:24:03] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:24:03] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:24:03] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/283 places, 382/382 transitions.
Built C files in :
/tmp/ltsmin6471780394002580460
[2022-05-20 13:24:03] [INFO ] Computing symmetric may disable matrix : 382 transitions.
[2022-05-20 13:24:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:24:03] [INFO ] Computing symmetric may enable matrix : 382 transitions.
[2022-05-20 13:24:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:24:03] [INFO ] Computing Do-Not-Accords matrix : 382 transitions.
[2022-05-20 13:24:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:24:03] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6471780394002580460
Running compilation step : cd /tmp/ltsmin6471780394002580460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 789 ms.
Running link step : cd /tmp/ltsmin6471780394002580460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6471780394002580460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10901208021197251662.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 13:24:18] [INFO ] Flatten gal took : 14 ms
[2022-05-20 13:24:18] [INFO ] Flatten gal took : 20 ms
[2022-05-20 13:24:18] [INFO ] Time to serialize gal into /tmp/LTL11845502969680598286.gal : 3 ms
[2022-05-20 13:24:18] [INFO ] Time to serialize properties into /tmp/LTL2629726548713128788.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11845502969680598286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2629726548713128788.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1184550...267
Read 1 LTL properties
Checking formula 0 : !((F("(p518==1)")))
Formula 0 simplified : !F"(p518==1)"
Detected timeout of ITS tools.
[2022-05-20 13:24:33] [INFO ] Flatten gal took : 14 ms
[2022-05-20 13:24:33] [INFO ] Applying decomposition
[2022-05-20 13:24:33] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17285268240527055064.txt' '-o' '/tmp/graph17285268240527055064.bin' '-w' '/tmp/graph17285268240527055064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17285268240527055064.bin' '-l' '-1' '-v' '-w' '/tmp/graph17285268240527055064.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:24:33] [INFO ] Decomposing Gal with order
[2022-05-20 13:24:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:24:33] [INFO ] Removed a total of 421 redundant transitions.
[2022-05-20 13:24:33] [INFO ] Flatten gal took : 26 ms
[2022-05-20 13:24:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 422 labels/synchronizations in 6 ms.
[2022-05-20 13:24:33] [INFO ] Time to serialize gal into /tmp/LTL6379071341071177916.gal : 3 ms
[2022-05-20 13:24:33] [INFO ] Time to serialize properties into /tmp/LTL2567073773080292987.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6379071341071177916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2567073773080292987.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6379071...245
Read 1 LTL properties
Checking formula 0 : !((F("(i6.i0.u51.p518==1)")))
Formula 0 simplified : !F"(i6.i0.u51.p518==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13314789366151723760
[2022-05-20 13:24:48] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13314789366151723760
Running compilation step : cd /tmp/ltsmin13314789366151723760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 567 ms.
Running link step : cd /tmp/ltsmin13314789366151723760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin13314789366151723760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-020B-LTLFireability-09 finished in 87131 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&!p1)))'
Support contains 4 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 663 transition count 763
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 663 transition count 763
Applied a total of 24 rules in 35 ms. Remains 663 /675 variables (removed 12) and now considering 763/775 (removed 12) transitions.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:25:04] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:25:04] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:25:04] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:25:05] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:25:05] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:05] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/675 places, 763/775 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/675 places, 763/775 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), true, true, true]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s547 1), p0:(AND (EQ s449 1) (EQ s452 1) (EQ s459 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-10 finished in 1404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 674 transition count 694
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 594 transition count 694
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 160 place count 594 transition count 594
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 360 place count 494 transition count 594
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 372 place count 482 transition count 582
Iterating global reduction 2 with 12 rules applied. Total rules applied 384 place count 482 transition count 582
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 384 place count 482 transition count 577
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 394 place count 477 transition count 577
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 2 with 386 rules applied. Total rules applied 780 place count 284 transition count 384
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 782 place count 282 transition count 382
Applied a total of 782 rules in 66 ms. Remains 282 /675 variables (removed 393) and now considering 382/775 (removed 393) transitions.
// Phase 1: matrix 382 rows 282 cols
[2022-05-20 13:25:05] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:25:05] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 382 rows 282 cols
[2022-05-20 13:25:05] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:05] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2022-05-20 13:25:06] [INFO ] Redundant transitions in 76 ms returned [381]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 381 rows 282 cols
[2022-05-20 13:25:06] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:25:06] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/675 places, 381/775 transitions.
Applied a total of 0 rules in 4 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 282/675 places, 381/775 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s94 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 272 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-11 finished in 777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(F(p0))&&G(X(F(X(p1))))))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 674 transition count 695
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 595 transition count 695
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 158 place count 595 transition count 596
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 356 place count 496 transition count 596
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 369 place count 483 transition count 583
Iterating global reduction 2 with 13 rules applied. Total rules applied 382 place count 483 transition count 583
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 382 place count 483 transition count 578
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 392 place count 478 transition count 578
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 2 with 386 rules applied. Total rules applied 778 place count 285 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 780 place count 283 transition count 383
Applied a total of 780 rules in 45 ms. Remains 283 /675 variables (removed 392) and now considering 383/775 (removed 392) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:25:06] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:25:06] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:25:06] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:06] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2022-05-20 13:25:06] [INFO ] Redundant transitions in 61 ms returned [382]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:25:06] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:06] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/675 places, 382/775 transitions.
Applied a total of 0 rules in 5 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 283/675 places, 382/775 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s73 1), p1:(EQ s76 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 1237 steps with 11 reset in 5 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-12 finished in 907 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||!(p1 U p2)))&&F(p3)))'
Support contains 8 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 674 transition count 697
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 597 transition count 697
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 154 place count 597 transition count 597
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 354 place count 497 transition count 597
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 366 place count 485 transition count 585
Iterating global reduction 2 with 12 rules applied. Total rules applied 378 place count 485 transition count 585
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 378 place count 485 transition count 580
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 388 place count 480 transition count 580
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Deduced a syphon composed of 189 places in 0 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 2 with 378 rules applied. Total rules applied 766 place count 291 transition count 391
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 768 place count 289 transition count 389
Applied a total of 768 rules in 47 ms. Remains 289 /675 variables (removed 386) and now considering 389/775 (removed 386) transitions.
// Phase 1: matrix 389 rows 289 cols
[2022-05-20 13:25:07] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:07] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 389 rows 289 cols
[2022-05-20 13:25:07] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:25:07] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2022-05-20 13:25:07] [INFO ] Redundant transitions in 63 ms returned [388]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 388 rows 289 cols
[2022-05-20 13:25:07] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:08] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/675 places, 388/775 transitions.
Applied a total of 0 rules in 5 ms. Remains 289 /289 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 289/675 places, 388/775 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p3) (AND (NOT p0) p2)), true, (AND p0 p2), (NOT p0), (AND (NOT p0) p2), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s119 1) (EQ s137 1) (EQ s148 1)), p0:(EQ s17 1), p1:(AND (EQ s40 1) (EQ s46 1) (EQ s54 1)), p3:(EQ s185 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 853 steps with 3 reset in 5 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-13 finished in 1050 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(X(G((X(F(p1))&&p2))))))'
Support contains 4 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 662 transition count 762
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 662 transition count 762
Applied a total of 26 rules in 13 ms. Remains 662 /675 variables (removed 13) and now considering 762/775 (removed 13) transitions.
// Phase 1: matrix 762 rows 662 cols
[2022-05-20 13:25:08] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:25:08] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 762 rows 662 cols
[2022-05-20 13:25:08] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:25:08] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
// Phase 1: matrix 762 rows 662 cols
[2022-05-20 13:25:08] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:09] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 662/675 places, 762/775 transitions.
Finished structural reductions, in 1 iterations. Remains : 662/675 places, 762/775 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s115 1), p2:(EQ s115 0), p1:(AND (EQ s353 1) (EQ s356 1) (EQ s364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-14 finished in 1325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(G(p0)))&&F(G(p0)))))'
Support contains 3 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 674 transition count 695
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 595 transition count 695
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 158 place count 595 transition count 595
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 358 place count 495 transition count 595
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 371 place count 482 transition count 582
Iterating global reduction 2 with 13 rules applied. Total rules applied 384 place count 482 transition count 582
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 384 place count 482 transition count 577
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 394 place count 477 transition count 577
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 2 with 384 rules applied. Total rules applied 778 place count 285 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 780 place count 283 transition count 383
Applied a total of 780 rules in 56 ms. Remains 283 /675 variables (removed 392) and now considering 383/775 (removed 392) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:25:09] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:25:09] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:25:09] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:10] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2022-05-20 13:25:10] [INFO ] Redundant transitions in 63 ms returned [382]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:25:10] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/675 places, 382/775 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 283/675 places, 382/775 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s52 1) (EQ s58 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 284 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-15 finished in 947 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1) U !p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X((G(X(p0))||G((G(p1)||p2))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U X(G(p1))))'
Found a CL insensitive property : ShieldRVs-PT-020B-LTLFireability-07
Stuttering acceptance computed with spot in 139 ms :[p1, p1, (AND p0 p1)]
Support contains 4 out of 675 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 675/675 places, 775/775 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 674 transition count 696
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 596 transition count 696
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 156 place count 596 transition count 596
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 356 place count 496 transition count 596
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 368 place count 484 transition count 584
Iterating global reduction 2 with 12 rules applied. Total rules applied 380 place count 484 transition count 584
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 380 place count 484 transition count 579
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 390 place count 479 transition count 579
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 2 with 384 rules applied. Total rules applied 774 place count 287 transition count 387
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 776 place count 285 transition count 385
Applied a total of 776 rules in 39 ms. Remains 285 /675 variables (removed 390) and now considering 385/775 (removed 390) transitions.
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:25:10] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:11] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:25:11] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:25:11] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:25:11] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:11] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 285/675 places, 385/775 transitions.
Finished structural reductions, in 1 iterations. Remains : 285/675 places, 385/775 transitions.
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s61 1), p1:(AND (EQ s228 1) (EQ s246 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 712 reset in 326 ms.
Product exploration explored 100000 steps with 712 reset in 375 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[p1, p1, (AND p0 p1)]
Finished random walk after 6660 steps, including 23 resets, run visited all 2 properties in 24 ms. (steps per millisecond=277 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 419 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 104 ms :[p1, p1, (AND p0 p1)]
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 385/385 transitions.
Applied a total of 0 rules in 2 ms. Remains 285 /285 variables (removed 0) and now considering 385/385 (removed 0) transitions.
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:25:13] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:13] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:25:13] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:13] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:25:13] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:14] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 285/285 places, 385/385 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 35 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Finished Best-First random walk after 4202 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=600 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 88 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 93 ms :[p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 741 reset in 314 ms.
Product exploration explored 100000 steps with 740 reset in 352 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 101 ms :[p1, p1, (AND p0 p1)]
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 385/385 transitions.
Applied a total of 0 rules in 8 ms. Remains 285 /285 variables (removed 0) and now considering 385/385 (removed 0) transitions.
[2022-05-20 13:25:16] [INFO ] Redundant transitions in 71 ms returned [384]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 384 rows 285 cols
[2022-05-20 13:25:16] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:16] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/285 places, 384/385 transitions.
Applied a total of 0 rules in 4 ms. Remains 285 /285 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 285/285 places, 384/385 transitions.
Product exploration explored 100000 steps with 775 reset in 337 ms.
Product exploration explored 100000 steps with 764 reset in 355 ms.
Built C files in :
/tmp/ltsmin2283648085987305415
[2022-05-20 13:25:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2283648085987305415
Running compilation step : cd /tmp/ltsmin2283648085987305415;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 580 ms.
Running link step : cd /tmp/ltsmin2283648085987305415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin2283648085987305415;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16134132930291805704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 385/385 transitions.
Applied a total of 0 rules in 6 ms. Remains 285 /285 variables (removed 0) and now considering 385/385 (removed 0) transitions.
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:25:32] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:25:32] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:25:32] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:25:32] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:25:32] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:25:32] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 285/285 places, 385/385 transitions.
Built C files in :
/tmp/ltsmin14309943417377258577
[2022-05-20 13:25:32] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14309943417377258577
Running compilation step : cd /tmp/ltsmin14309943417377258577;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 577 ms.
Running link step : cd /tmp/ltsmin14309943417377258577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14309943417377258577;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13034347437876799171.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 13:25:47] [INFO ] Flatten gal took : 13 ms
[2022-05-20 13:25:47] [INFO ] Flatten gal took : 13 ms
[2022-05-20 13:25:47] [INFO ] Time to serialize gal into /tmp/LTL6987244273607499289.gal : 1 ms
[2022-05-20 13:25:47] [INFO ] Time to serialize properties into /tmp/LTL11948179428826734754.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6987244273607499289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11948179428826734754.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6987244...267
Read 1 LTL properties
Checking formula 0 : !((!((F("(p188==1)"))U(X(G("(((p653==1)&&(p697==1))&&(p722==1))"))))))
Formula 0 simplified : F"(p188==1)" U XG"(((p653==1)&&(p697==1))&&(p722==1))"
Detected timeout of ITS tools.
[2022-05-20 13:26:02] [INFO ] Flatten gal took : 12 ms
[2022-05-20 13:26:02] [INFO ] Applying decomposition
[2022-05-20 13:26:02] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8018505387492506816.txt' '-o' '/tmp/graph8018505387492506816.bin' '-w' '/tmp/graph8018505387492506816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8018505387492506816.bin' '-l' '-1' '-v' '-w' '/tmp/graph8018505387492506816.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:26:03] [INFO ] Decomposing Gal with order
[2022-05-20 13:26:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:26:03] [INFO ] Removed a total of 426 redundant transitions.
[2022-05-20 13:26:03] [INFO ] Flatten gal took : 32 ms
[2022-05-20 13:26:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 444 labels/synchronizations in 6 ms.
[2022-05-20 13:26:03] [INFO ] Time to serialize gal into /tmp/LTL12260984483895804630.gal : 2 ms
[2022-05-20 13:26:03] [INFO ] Time to serialize properties into /tmp/LTL16615711943478464055.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12260984483895804630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16615711943478464055.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1226098...247
Read 1 LTL properties
Checking formula 0 : !((!((F("(i2.i1.u17.p188==1)"))U(X(G("(((i9.i0.u65.p653==1)&&(i9.i1.u69.p697==1))&&(i9.i1.u74.p722==1))"))))))
Formula 0 simplified : F"(i2.i1.u17.p188==1)" U XG"(((i9.i0.u65.p653==1)&&(i9.i1.u69.p697==1))&&(i9.i1.u74.p722==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16364888452921950858
[2022-05-20 13:26:18] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16364888452921950858
Running compilation step : cd /tmp/ltsmin16364888452921950858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin16364888452921950858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16364888452921950858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(<>((LTLAPp0==true)) U X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-020B-LTLFireability-07 finished in 82591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2022-05-20 13:26:33] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5070963536284385187
[2022-05-20 13:26:33] [INFO ] Computing symmetric may disable matrix : 775 transitions.
[2022-05-20 13:26:33] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:26:33] [INFO ] Computing symmetric may enable matrix : 775 transitions.
[2022-05-20 13:26:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:26:33] [INFO ] Applying decomposition
[2022-05-20 13:26:33] [INFO ] Flatten gal took : 21 ms
[2022-05-20 13:26:33] [INFO ] Computing Do-Not-Accords matrix : 775 transitions.
[2022-05-20 13:26:33] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:26:33] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5070963536284385187
Running compilation step : cd /tmp/ltsmin5070963536284385187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13725780543962315847.txt' '-o' '/tmp/graph13725780543962315847.bin' '-w' '/tmp/graph13725780543962315847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13725780543962315847.bin' '-l' '-1' '-v' '-w' '/tmp/graph13725780543962315847.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:26:33] [INFO ] Decomposing Gal with order
[2022-05-20 13:26:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:26:33] [INFO ] Removed a total of 711 redundant transitions.
[2022-05-20 13:26:33] [INFO ] Flatten gal took : 57 ms
[2022-05-20 13:26:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 13:26:33] [INFO ] Time to serialize gal into /tmp/LTLFireability3550078171516805182.gal : 5 ms
[2022-05-20 13:26:33] [INFO ] Time to serialize properties into /tmp/LTLFireability353806995168522014.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3550078171516805182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability353806995168522014.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 4 LTL properties
Checking formula 0 : !(((F("(i5.u125.p401==1)"))&&((G("(i4.i1.i1.u113.p356==1)"))U("(i5.u125.p401!=1)"))))
Formula 0 simplified : !(F"(i5.u125.p401==1)" & (G"(i4.i1.i1.u113.p356==1)" U "(i5.u125.p401!=1)"))
Compilation finished in 1994 ms.
Running link step : cd /tmp/ltsmin5070963536284385187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5070963536284385187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true))&&([]((LTLAPp1==true)) U !(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5070963536284385187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true))&&([]((LTLAPp1==true)) U !(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5070963536284385187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(X(([](X((LTLAPp2==true)))||[](([]((LTLAPp3==true))||(LTLAPp4==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 13:49:10] [INFO ] Applying decomposition
[2022-05-20 13:49:10] [INFO ] Flatten gal took : 94 ms
[2022-05-20 13:49:10] [INFO ] Decomposing Gal with order
[2022-05-20 13:49:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:49:11] [INFO ] Removed a total of 417 redundant transitions.
[2022-05-20 13:49:11] [INFO ] Flatten gal took : 182 ms
[2022-05-20 13:49:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 62 ms.
[2022-05-20 13:49:11] [INFO ] Time to serialize gal into /tmp/LTLFireability8475425711195615072.gal : 18 ms
[2022-05-20 13:49:11] [INFO ] Time to serialize properties into /tmp/LTLFireability11606113687600894100.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8475425711195615072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11606113687600894100.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !(((F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u89.p401==1)"))&&((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u82.p356==1)"))U("(i0.i0.i0....199
Formula 0 simplified : !(F"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u89.p401==1)" & (G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u82.p356==1)" U "(i0.i0.i0.i0.i0...192
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5070963536284385187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(X(([](X((LTLAPp2==true)))||[](([]((LTLAPp3==true))||(LTLAPp4==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5070963536284385187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(<>((LTLAPp5==true)) U X([]((LTLAPp6==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: LTL layer: formula: !(<>((LTLAPp5==true)) U X([]((LTLAPp6==true))))
pins2lts-mc-linux64( 2/ 8), 0.024: "!(<>((LTLAPp5==true)) U X([]((LTLAPp6==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.024: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.068: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.170: DFS-FIFO for weak LTL, using special progress label 784
pins2lts-mc-linux64( 0/ 8), 0.170: There are 785 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.170: State length is 676, there are 782 groups
pins2lts-mc-linux64( 0/ 8), 0.170: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.170: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.170: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.170: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.201: ~2 levels ~960 states ~4840 transitions
pins2lts-mc-linux64( 7/ 8), 0.251: ~2 levels ~1920 states ~10976 transitions
pins2lts-mc-linux64( 7/ 8), 0.350: ~2 levels ~3840 states ~24112 transitions
pins2lts-mc-linux64( 7/ 8), 0.577: ~2 levels ~7680 states ~52200 transitions
pins2lts-mc-linux64( 7/ 8), 1.002: ~2 levels ~15360 states ~113912 transitions
pins2lts-mc-linux64( 7/ 8), 1.713: ~2 levels ~30720 states ~247816 transitions
pins2lts-mc-linux64( 7/ 8), 3.156: ~2 levels ~61440 states ~531192 transitions
pins2lts-mc-linux64( 7/ 8), 5.789: ~2 levels ~122880 states ~1137120 transitions
pins2lts-mc-linux64( 0/ 8), 10.723: ~1 levels ~245760 states ~2187304 transitions
pins2lts-mc-linux64( 2/ 8), 19.704: ~1 levels ~491520 states ~4810448 transitions
pins2lts-mc-linux64( 0/ 8), 37.837: ~1 levels ~983040 states ~9783872 transitions
pins2lts-mc-linux64( 0/ 8), 74.879: ~1 levels ~1966080 states ~20591128 transitions
pins2lts-mc-linux64( 0/ 8), 150.916: ~1 levels ~3932160 states ~43562776 transitions
pins2lts-mc-linux64( 0/ 8), 305.015: ~1 levels ~7864320 states ~90284624 transitions
pins2lts-mc-linux64( 1/ 8), 592.883: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 592.963:
pins2lts-mc-linux64( 0/ 8), 592.963: mean standard work distribution: 10.9% (states) 10.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 592.963:
pins2lts-mc-linux64( 0/ 8), 592.963: Explored 13305582 states 170896286 transitions, fanout: 12.844
pins2lts-mc-linux64( 0/ 8), 592.963: Total exploration time 592.770 sec (592.680 sec minimum, 592.729 sec on average)
pins2lts-mc-linux64( 0/ 8), 592.963: States per second: 22446, Transitions per second: 288301
pins2lts-mc-linux64( 0/ 8), 592.963:
pins2lts-mc-linux64( 0/ 8), 592.963: Progress states detected: 32511816
pins2lts-mc-linux64( 0/ 8), 592.963: Redundant explorations: -59.0747
pins2lts-mc-linux64( 0/ 8), 592.963:
pins2lts-mc-linux64( 0/ 8), 592.963: Queue width: 8B, total height: 31114826, memory: 237.39MB
pins2lts-mc-linux64( 0/ 8), 592.963: Tree memory: 504.0MB, 16.3 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 592.963: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 592.963: Stored 957 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 592.963: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 592.963: Est. total memory use: 741.4MB (~1261.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5070963536284385187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(<>((LTLAPp5==true)) U X([]((LTLAPp6==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5070963536284385187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(<>((LTLAPp5==true)) U X([]((LTLAPp6==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 14:11:47] [INFO ] Flatten gal took : 45 ms
[2022-05-20 14:11:47] [INFO ] Input system was already deterministic with 775 transitions.
[2022-05-20 14:11:47] [INFO ] Transformed 675 places.
[2022-05-20 14:11:47] [INFO ] Transformed 775 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 14:11:47] [INFO ] Time to serialize gal into /tmp/LTLFireability6671571284984601144.gal : 6 ms
[2022-05-20 14:11:47] [INFO ] Time to serialize properties into /tmp/LTLFireability10062649689702652583.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6671571284984601144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10062649689702652583.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(p401==1)"))&&((G("(p356==1)"))U("(p401!=1)"))))
Formula 0 simplified : !(F"(p401==1)" & (G"(p356==1)" U "(p401!=1)"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-020B, 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 r222-tall-165286025800812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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