Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788500083.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPs-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788500083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K May 18 16:43 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 ShieldIIPs-PT-040A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716941821384

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 00:17:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 00:17:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:17:04] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-29 00:17:04] [INFO ] Transformed 1003 places.
[2024-05-29 00:17:04] [INFO ] Transformed 963 transitions.
[2024-05-29 00:17:04] [INFO ] Found NUPN structural information;
[2024-05-29 00:17:04] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-040A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 89 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-29 00:17:04] [INFO ] Computed 361 invariants in 31 ms
[2024-05-29 00:17:05] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-29 00:17:05] [INFO ] Invariant cache hit.
[2024-05-29 00:17:06] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 2221 ms to find 0 implicit places.
[2024-05-29 00:17:06] [INFO ] Invariant cache hit.
[2024-05-29 00:17:07] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2947 ms. Remains : 1003/1003 places, 963/963 transitions.
Support contains 57 out of 1003 places after structural reductions.
[2024-05-29 00:17:07] [INFO ] Flatten gal took : 165 ms
[2024-05-29 00:17:08] [INFO ] Flatten gal took : 83 ms
[2024-05-29 00:17:08] [INFO ] Input system was already deterministic with 963 transitions.
Support contains 53 out of 1003 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 27) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-29 00:17:08] [INFO ] Invariant cache hit.
[2024-05-29 00:17:09] [INFO ] [Real]Absence check using 361 positive place invariants in 61 ms returned sat
[2024-05-29 00:17:09] [INFO ] After 858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 00:17:10] [INFO ] [Nat]Absence check using 361 positive place invariants in 62 ms returned sat
[2024-05-29 00:17:10] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 00:17:10] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 6 ms to minimize.
[2024-05-29 00:17:10] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 00:17:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2024-05-29 00:17:10] [INFO ] After 812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-05-29 00:17:11] [INFO ] After 1232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 130 ms.
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 274 times.
Drop transitions removed 274 transitions
Iterating global reduction 0 with 274 rules applied. Total rules applied 278 place count 1001 transition count 961
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 279 place count 1000 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 280 place count 999 transition count 960
Applied a total of 280 rules in 251 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 999/1003 places, 960/963 transitions.
Finished random walk after 3681 steps, including 1 resets, run visited all 2 properties in 83 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:17:11] [INFO ] Invariant cache hit.
[2024-05-29 00:17:12] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-05-29 00:17:12] [INFO ] Invariant cache hit.
[2024-05-29 00:17:13] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1891 ms to find 0 implicit places.
[2024-05-29 00:17:13] [INFO ] Invariant cache hit.
[2024-05-29 00:17:14] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2604 ms. Remains : 1003/1003 places, 963/963 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s358 1) (EQ s372 1)), p1:(AND (EQ s580 1) (EQ s593 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 14788 steps with 10 reset in 165 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-00 finished in 3089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 25 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:17:14] [INFO ] Invariant cache hit.
[2024-05-29 00:17:15] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-29 00:17:15] [INFO ] Invariant cache hit.
[2024-05-29 00:17:16] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
[2024-05-29 00:17:16] [INFO ] Invariant cache hit.
[2024-05-29 00:17:17] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2608 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-01 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: 2}]], initial=1, aps=[p0:(AND (EQ s203 1) (EQ s224 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-01 finished in 2721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1002 transition count 961
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 72 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-05-29 00:17:17] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:17:18] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-29 00:17:18] [INFO ] Invariant cache hit.
[2024-05-29 00:17:19] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
[2024-05-29 00:17:19] [INFO ] Redundant transitions in 246 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-05-29 00:17:19] [INFO ] Computed 360 invariants in 5 ms
[2024-05-29 00:17:20] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/1003 places, 959/963 transitions.
Applied a total of 0 rules in 27 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2780 ms. Remains : 999/1003 places, 959/963 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s610 1) (EQ s614 1) (EQ s625 1))) (NOT (AND (EQ s735 1) (EQ s739 1) (EQ s750 1)))), p0:(OR (EQ s610 0) (EQ s614 0) (EQ s625 0)), p1:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 48 reset in 860 ms.
Product exploration explored 100000 steps with 48 reset in 1007 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 p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 171607 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{1=1}
Probabilistic random walk after 171607 steps, saw 122536 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-29 00:17:25] [INFO ] Invariant cache hit.
[2024-05-29 00:17:26] [INFO ] [Real]Absence check using 360 positive place invariants in 66 ms returned sat
[2024-05-29 00:17:26] [INFO ] After 742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:17:26] [INFO ] [Nat]Absence check using 360 positive place invariants in 62 ms returned sat
[2024-05-29 00:17:27] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:17:27] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:17:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-29 00:17:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2024-05-29 00:17:27] [INFO ] After 688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-29 00:17:27] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 959/959 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 999 transition count 959
Applied a total of 234 rules in 56 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 999/999 places, 959/959 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131843 steps, run visited all 1 properties in 1481 ms. (steps per millisecond=89 )
Probabilistic random walk after 131843 steps, saw 128396 distinct states, run finished after 1481 ms. (steps per millisecond=89 ) properties seen :1
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 30 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-29 00:17:29] [INFO ] Invariant cache hit.
[2024-05-29 00:17:30] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-29 00:17:30] [INFO ] Invariant cache hit.
[2024-05-29 00:17:31] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2024-05-29 00:17:31] [INFO ] Redundant transitions in 112 ms returned []
[2024-05-29 00:17:31] [INFO ] Invariant cache hit.
[2024-05-29 00:17:32] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2574 ms. Remains : 999/999 places, 959/959 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 p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 175128 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{1=1}
Probabilistic random walk after 175128 steps, saw 123198 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-29 00:17:35] [INFO ] Invariant cache hit.
[2024-05-29 00:17:35] [INFO ] [Real]Absence check using 360 positive place invariants in 63 ms returned sat
[2024-05-29 00:17:36] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:17:36] [INFO ] [Nat]Absence check using 360 positive place invariants in 60 ms returned sat
[2024-05-29 00:17:37] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:17:37] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-29 00:17:37] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-29 00:17:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2024-05-29 00:17:37] [INFO ] After 675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-29 00:17:37] [INFO ] After 981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 959/959 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 999 transition count 959
Applied a total of 234 rules in 42 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 999/999 places, 959/959 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131843 steps, run visited all 1 properties in 1325 ms. (steps per millisecond=99 )
Probabilistic random walk after 131843 steps, saw 128396 distinct states, run finished after 1328 ms. (steps per millisecond=99 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 718 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 48 reset in 769 ms.
Product exploration explored 100000 steps with 49 reset in 990 ms.
Built C files in :
/tmp/ltsmin12919460930641556144
[2024-05-29 00:17:41] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-29 00:17:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:17:41] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-29 00:17:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:17:41] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-29 00:17:41] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:17:41] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12919460930641556144
Running compilation step : cd /tmp/ltsmin12919460930641556144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12919460930641556144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12919460930641556144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 23 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-29 00:17:45] [INFO ] Invariant cache hit.
[2024-05-29 00:17:46] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-05-29 00:17:46] [INFO ] Invariant cache hit.
[2024-05-29 00:17:47] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
[2024-05-29 00:17:47] [INFO ] Redundant transitions in 146 ms returned []
[2024-05-29 00:17:47] [INFO ] Invariant cache hit.
[2024-05-29 00:17:48] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2618 ms. Remains : 999/999 places, 959/959 transitions.
Built C files in :
/tmp/ltsmin4944517075580638887
[2024-05-29 00:17:48] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-29 00:17:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:17:48] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-29 00:17:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:17:48] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-29 00:17:48] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:17:48] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4944517075580638887
Running compilation step : cd /tmp/ltsmin4944517075580638887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4944517075580638887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4944517075580638887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 00:17:51] [INFO ] Flatten gal took : 81 ms
[2024-05-29 00:17:51] [INFO ] Flatten gal took : 44 ms
[2024-05-29 00:17:51] [INFO ] Time to serialize gal into /tmp/LTL4112874473729597374.gal : 12 ms
[2024-05-29 00:17:51] [INFO ] Time to serialize properties into /tmp/LTL16795933540465258170.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4112874473729597374.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5168555278982392906.hoa' '-atoms' '/tmp/LTL16795933540465258170.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16795933540465258170.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5168555278982392906.hoa
Detected timeout of ITS tools.
[2024-05-29 00:18:07] [INFO ] Flatten gal took : 41 ms
[2024-05-29 00:18:07] [INFO ] Flatten gal took : 39 ms
[2024-05-29 00:18:07] [INFO ] Time to serialize gal into /tmp/LTL9111125041872918388.gal : 6 ms
[2024-05-29 00:18:07] [INFO ] Time to serialize properties into /tmp/LTL15292674612927356234.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9111125041872918388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15292674612927356234.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p611==0)||(p615==0))")||(("(p626==0)")||((!("(((p736==1)&&(p740==1))&&(p751==1))"))U(("((!(((p611==1)&&(p615==1))&&(p626==1...255
Formula 0 simplified : FG(!"((p611==0)||(p615==0))" & !"(p626==0)" & ("(((p736==1)&&(p740==1))&&(p751==1))" M !"((!(((p611==1)&&(p615==1))&&(p626==1)))&&(!...195
Detected timeout of ITS tools.
[2024-05-29 00:18:22] [INFO ] Flatten gal took : 55 ms
[2024-05-29 00:18:22] [INFO ] Applying decomposition
[2024-05-29 00:18:22] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8500361800771583430.txt' '-o' '/tmp/graph8500361800771583430.bin' '-w' '/tmp/graph8500361800771583430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8500361800771583430.bin' '-l' '-1' '-v' '-w' '/tmp/graph8500361800771583430.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:18:22] [INFO ] Decomposing Gal with order
[2024-05-29 00:18:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:18:22] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-29 00:18:22] [INFO ] Flatten gal took : 108 ms
[2024-05-29 00:18:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 20 ms.
[2024-05-29 00:18:22] [INFO ] Time to serialize gal into /tmp/LTL16371260558222179559.gal : 13 ms
[2024-05-29 00:18:22] [INFO ] Time to serialize properties into /tmp/LTL8062494430173517835.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16371260558222179559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8062494430173517835.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i24.i2.u220.p611==0)||(i24.i2.u222.p615==0))")||(("(i24.i1.u225.p626==0)")||((!("(((i29.i0.u265.p736==1)&&(i29.i0.u267.p740...435
Formula 0 simplified : FG(!"((i24.i2.u220.p611==0)||(i24.i2.u222.p615==0))" & !"(i24.i1.u225.p626==0)" & ("(((i29.i0.u265.p736==1)&&(i29.i0.u267.p740==1))&...339
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3146416909514061223
[2024-05-29 00:18:37] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3146416909514061223
Running compilation step : cd /tmp/ltsmin3146416909514061223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1730 ms.
Running link step : cd /tmp/ltsmin3146416909514061223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3146416909514061223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-02 finished in 95354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&((X(!p0)&&p1)||X(G(!p0))))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-29 00:18:54] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 00:18:55] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-29 00:18:55] [INFO ] Invariant cache hit.
[2024-05-29 00:18:56] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2024-05-29 00:18:56] [INFO ] Invariant cache hit.
[2024-05-29 00:18:56] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2424 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 776 ms :[p0, p0, p0]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}]], initial=0, aps=[p0:(AND (EQ s688 1) (EQ s698 1) (EQ s702 1)), p1:(AND (EQ s386 1) (EQ s390 1) (EQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50 reset in 799 ms.
Product exploration explored 100000 steps with 51 reset in 958 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 81 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[p0, p0, p0]
Finished random walk after 9304 steps, including 4 resets, run visited all 3 properties in 92 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0]
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 15 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:19:00] [INFO ] Invariant cache hit.
[2024-05-29 00:19:00] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-29 00:19:00] [INFO ] Invariant cache hit.
[2024-05-29 00:19:02] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
[2024-05-29 00:19:02] [INFO ] Invariant cache hit.
[2024-05-29 00:19:02] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2431 ms. Remains : 1003/1003 places, 963/963 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 68 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0]
Finished random walk after 3460 steps, including 1 resets, run visited all 3 properties in 46 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 84 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 54 reset in 769 ms.
Product exploration explored 100000 steps with 50 reset in 899 ms.
Built C files in :
/tmp/ltsmin2380431311558248330
[2024-05-29 00:19:07] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2380431311558248330
Running compilation step : cd /tmp/ltsmin2380431311558248330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1691 ms.
Running link step : cd /tmp/ltsmin2380431311558248330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2380431311558248330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13201690793310326961.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:19:22] [INFO ] Invariant cache hit.
[2024-05-29 00:19:23] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-05-29 00:19:23] [INFO ] Invariant cache hit.
[2024-05-29 00:19:24] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1939 ms to find 0 implicit places.
[2024-05-29 00:19:24] [INFO ] Invariant cache hit.
[2024-05-29 00:19:25] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2615 ms. Remains : 1003/1003 places, 963/963 transitions.
Built C files in :
/tmp/ltsmin4618734360098595322
[2024-05-29 00:19:25] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4618734360098595322
Running compilation step : cd /tmp/ltsmin4618734360098595322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2007 ms.
Running link step : cd /tmp/ltsmin4618734360098595322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4618734360098595322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14973113126783615076.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:19:40] [INFO ] Flatten gal took : 48 ms
[2024-05-29 00:19:40] [INFO ] Flatten gal took : 47 ms
[2024-05-29 00:19:40] [INFO ] Time to serialize gal into /tmp/LTL10088363393805373540.gal : 7 ms
[2024-05-29 00:19:40] [INFO ] Time to serialize properties into /tmp/LTL12328406830288747909.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10088363393805373540.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6503864265417865221.hoa' '-atoms' '/tmp/LTL12328406830288747909.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12328406830288747909.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6503864265417865221.hoa
Detected timeout of ITS tools.
[2024-05-29 00:19:55] [INFO ] Flatten gal took : 43 ms
[2024-05-29 00:19:55] [INFO ] Flatten gal took : 45 ms
[2024-05-29 00:19:56] [INFO ] Time to serialize gal into /tmp/LTL3124602581584383170.gal : 312 ms
[2024-05-29 00:19:56] [INFO ] Time to serialize properties into /tmp/LTL18220421800668806804.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3124602581584383170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18220421800668806804.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(((p688==0)||(p698==0))||(p702==0))")&&((X(G("(((p688==0)||(p698==0))||(p702==0))")))||(("((p386==1)&&(p390==1))")&&(("(p401==1...208
Formula 0 simplified : G(!"(((p688==0)||(p698==0))||(p702==0))" | (XF!"(((p688==0)||(p698==0))||(p702==0))" & (!"((p386==1)&&(p390==1))" | !"(p401==1)" | X...196
Detected timeout of ITS tools.
[2024-05-29 00:20:12] [INFO ] Flatten gal took : 53 ms
[2024-05-29 00:20:12] [INFO ] Applying decomposition
[2024-05-29 00:20:12] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9314395555739472803.txt' '-o' '/tmp/graph9314395555739472803.bin' '-w' '/tmp/graph9314395555739472803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9314395555739472803.bin' '-l' '-1' '-v' '-w' '/tmp/graph9314395555739472803.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:20:12] [INFO ] Decomposing Gal with order
[2024-05-29 00:20:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:20:12] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-29 00:20:12] [INFO ] Flatten gal took : 72 ms
[2024-05-29 00:20:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 608 labels/synchronizations in 72 ms.
[2024-05-29 00:20:14] [INFO ] Time to serialize gal into /tmp/LTL15860518193105079057.gal : 1817 ms
[2024-05-29 00:20:14] [INFO ] Time to serialize properties into /tmp/LTL5056129318071566103.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15860518193105079057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5056129318071566103.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0))||(i27.i2.u252.p702==0))")&&((X(G("(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0...352
Formula 0 simplified : G(!"(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0))||(i27.i2.u252.p702==0))" | (XF!"(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0))|...340
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8194128371899932101
[2024-05-29 00:20:29] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8194128371899932101
Running compilation step : cd /tmp/ltsmin8194128371899932101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1652 ms.
Running link step : cd /tmp/ltsmin8194128371899932101;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8194128371899932101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&(X([]((LTLAPp0==true)))||(X((LTLAPp0==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-03 finished in 111628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X((p2&&G(F(p3))))&&p1)))))'
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:20:44] [INFO ] Invariant cache hit.
[2024-05-29 00:20:45] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-05-29 00:20:45] [INFO ] Invariant cache hit.
[2024-05-29 00:20:46] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2024-05-29 00:20:46] [INFO ] Invariant cache hit.
[2024-05-29 00:20:47] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2436 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (EQ s506 1) (EQ s516 1)), p1:(AND (EQ s707 1) (EQ s709 1)), p2:(EQ s225 1), p3:(AND (EQ s707 1) (EQ s709 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]]
Stuttering criterion allowed to conclude after 2184 steps with 0 reset in 23 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-05 finished in 2716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:20:47] [INFO ] Invariant cache hit.
[2024-05-29 00:20:47] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-29 00:20:47] [INFO ] Invariant cache hit.
[2024-05-29 00:20:49] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2024-05-29 00:20:49] [INFO ] Invariant cache hit.
[2024-05-29 00:20:49] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2386 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s465 1), p1:(AND (EQ s863 1) (EQ s871 1) (EQ s875 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 99 reset in 722 ms.
Product exploration explored 100000 steps with 99 reset in 857 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 981 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-29 00:20:51] [INFO ] Invariant cache hit.
[2024-05-29 00:20:52] [INFO ] [Real]Absence check using 361 positive place invariants in 221 ms returned sat
[2024-05-29 00:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:20:54] [INFO ] [Real]Absence check using state equation in 2386 ms returned sat
[2024-05-29 00:20:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:20:55] [INFO ] [Nat]Absence check using 361 positive place invariants in 133 ms returned sat
[2024-05-29 00:20:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:20:57] [INFO ] [Nat]Absence check using state equation in 1852 ms returned sat
[2024-05-29 00:20:57] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 76 ms.
[2024-05-29 00:21:10] [INFO ] Added : 605 causal constraints over 121 iterations in 12385 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1003 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 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1002 transition count 961
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 44 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-05-29 00:21:10] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:21:10] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-29 00:21:10] [INFO ] Invariant cache hit.
[2024-05-29 00:21:11] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1685 ms to find 0 implicit places.
[2024-05-29 00:21:11] [INFO ] Redundant transitions in 102 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-05-29 00:21:11] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:21:12] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/1003 places, 959/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2497 ms. Remains : 999/1003 places, 959/963 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 878 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=97 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-29 00:21:12] [INFO ] Invariant cache hit.
[2024-05-29 00:21:13] [INFO ] [Real]Absence check using 360 positive place invariants in 193 ms returned sat
[2024-05-29 00:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:21:16] [INFO ] [Real]Absence check using state equation in 2564 ms returned sat
[2024-05-29 00:21:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:21:17] [INFO ] [Nat]Absence check using 360 positive place invariants in 144 ms returned sat
[2024-05-29 00:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:21:18] [INFO ] [Nat]Absence check using state equation in 1475 ms returned sat
[2024-05-29 00:21:18] [INFO ] Computed and/alt/rep : 958/2387/958 causal constraints (skipped 0 transitions) in 56 ms.
[2024-05-29 00:21:31] [INFO ] Added : 595 causal constraints over 119 iterations in 12676 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 100 reset in 737 ms.
Product exploration explored 100000 steps with 100 reset in 912 ms.
Built C files in :
/tmp/ltsmin10607419331725588166
[2024-05-29 00:21:33] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-29 00:21:33] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:21:33] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-29 00:21:33] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:21:33] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-29 00:21:33] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:21:33] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10607419331725588166
Running compilation step : cd /tmp/ltsmin10607419331725588166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2806 ms.
Running link step : cd /tmp/ltsmin10607419331725588166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10607419331725588166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11776472838347342894.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 18 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-29 00:21:48] [INFO ] Invariant cache hit.
[2024-05-29 00:21:48] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-29 00:21:48] [INFO ] Invariant cache hit.
[2024-05-29 00:21:49] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
[2024-05-29 00:21:49] [INFO ] Redundant transitions in 105 ms returned []
[2024-05-29 00:21:49] [INFO ] Invariant cache hit.
[2024-05-29 00:21:50] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2414 ms. Remains : 999/999 places, 959/959 transitions.
Built C files in :
/tmp/ltsmin6716595483875536396
[2024-05-29 00:21:50] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-29 00:21:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:21:50] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-29 00:21:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:21:50] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-29 00:21:50] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:21:50] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6716595483875536396
Running compilation step : cd /tmp/ltsmin6716595483875536396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2686 ms.
Running link step : cd /tmp/ltsmin6716595483875536396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6716595483875536396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1768306887003401746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:22:05] [INFO ] Flatten gal took : 39 ms
[2024-05-29 00:22:05] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:22:05] [INFO ] Time to serialize gal into /tmp/LTL3229111768024396037.gal : 5 ms
[2024-05-29 00:22:05] [INFO ] Time to serialize properties into /tmp/LTL9441204725531965584.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3229111768024396037.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12589293493027203807.hoa' '-atoms' '/tmp/LTL9441204725531965584.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9441204725531965584.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12589293493027203807.hoa
Detected timeout of ITS tools.
[2024-05-29 00:22:20] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:22:20] [INFO ] Flatten gal took : 26 ms
[2024-05-29 00:22:20] [INFO ] Time to serialize gal into /tmp/LTL2403522062845921566.gal : 5 ms
[2024-05-29 00:22:20] [INFO ] Time to serialize properties into /tmp/LTL6173361008505153804.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2403522062845921566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6173361008505153804.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(p465==1)"))||(X("(((p863==1)&&(p871==1))&&(p875==1))"))))
Formula 0 simplified : G!"(p465==1)" & X!"(((p863==1)&&(p871==1))&&(p875==1))"
Detected timeout of ITS tools.
[2024-05-29 00:22:35] [INFO ] Flatten gal took : 29 ms
[2024-05-29 00:22:35] [INFO ] Applying decomposition
[2024-05-29 00:22:35] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15380961378041540716.txt' '-o' '/tmp/graph15380961378041540716.bin' '-w' '/tmp/graph15380961378041540716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15380961378041540716.bin' '-l' '-1' '-v' '-w' '/tmp/graph15380961378041540716.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:22:35] [INFO ] Decomposing Gal with order
[2024-05-29 00:22:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:22:35] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-29 00:22:35] [INFO ] Flatten gal took : 49 ms
[2024-05-29 00:22:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 608 labels/synchronizations in 11 ms.
[2024-05-29 00:22:35] [INFO ] Time to serialize gal into /tmp/LTL7155298710286597289.gal : 9 ms
[2024-05-29 00:22:35] [INFO ] Time to serialize properties into /tmp/LTL4225543424880944328.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7155298710286597289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4225543424880944328.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(i18.i0.u168.p465==1)"))||(X("(((i34.i1.u311.p863==1)&&(i34.i1.u314.p871==1))&&(i34.i1.u315.p875==1))"))))
Formula 0 simplified : G!"(i18.i0.u168.p465==1)" & X!"(((i34.i1.u311.p863==1)&&(i34.i1.u314.p871==1))&&(i34.i1.u315.p875==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9577008833025436237
[2024-05-29 00:22:51] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9577008833025436237
Running compilation step : cd /tmp/ltsmin9577008833025436237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1668 ms.
Running link step : cd /tmp/ltsmin9577008833025436237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9577008833025436237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||X((LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 3103 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-040A-LTLFireability-06 finished in 128538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-29 00:22:55] [INFO ] Computed 361 invariants in 7 ms
[2024-05-29 00:22:56] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-05-29 00:22:56] [INFO ] Invariant cache hit.
[2024-05-29 00:22:57] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
[2024-05-29 00:22:57] [INFO ] Invariant cache hit.
[2024-05-29 00:22:58] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2498 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s741 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2907 ms.
Product exploration explored 100000 steps with 50000 reset in 3010 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040A-LTLFireability-07 finished in 8523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1002 transition count 961
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 46 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-05-29 00:23:04] [INFO ] Computed 360 invariants in 3 ms
[2024-05-29 00:23:05] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-29 00:23:05] [INFO ] Invariant cache hit.
[2024-05-29 00:23:06] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
[2024-05-29 00:23:06] [INFO ] Redundant transitions in 106 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-05-29 00:23:06] [INFO ] Computed 360 invariants in 3 ms
[2024-05-29 00:23:06] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/1003 places, 959/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2508 ms. Remains : 999/1003 places, 959/963 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s507 1) (EQ s521 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7168 steps with 5 reset in 54 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-08 finished in 2654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 49 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:23:07] [INFO ] Computed 361 invariants in 3 ms
[2024-05-29 00:23:07] [INFO ] Implicit Places using invariants in 570 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 573 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 644 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-09 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 s155 1) (EQ s168 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 1925 steps with 0 reset in 22 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-09 finished in 719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||X(p2))))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
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 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 42 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
[2024-05-29 00:23:07] [INFO ] Invariant cache hit.
[2024-05-29 00:23:08] [INFO ] Implicit Places using invariants in 643 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 646 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 710 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-10 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=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s56 0) (EQ s67 0)), p1:(AND (EQ s364 1) (EQ s385 1)), p2:(AND (EQ s457 1) (EQ s459 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]]
Product exploration explored 100000 steps with 97 reset in 744 ms.
Product exploration explored 100000 steps with 98 reset in 884 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 1831 steps, including 0 resets, run visited all 2 properties in 35 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 141 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:23:10] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:23:11] [INFO ] [Real]Absence check using 360 positive place invariants in 249 ms returned sat
[2024-05-29 00:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:23:13] [INFO ] [Real]Absence check using state equation in 2157 ms returned sat
[2024-05-29 00:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:23:14] [INFO ] [Nat]Absence check using 360 positive place invariants in 193 ms returned sat
[2024-05-29 00:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:23:17] [INFO ] [Nat]Absence check using state equation in 2326 ms returned sat
[2024-05-29 00:23:17] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 00:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2024-05-29 00:23:17] [INFO ] Computed and/alt/rep : 882/3061/882 causal constraints (skipped 78 transitions) in 58 ms.
[2024-05-29 00:23:29] [INFO ] Added : 565 causal constraints over 113 iterations in 11610 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:23:29] [INFO ] Invariant cache hit.
[2024-05-29 00:23:29] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-29 00:23:29] [INFO ] Invariant cache hit.
[2024-05-29 00:23:30] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2024-05-29 00:23:30] [INFO ] Redundant transitions in 101 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-29 00:23:30] [INFO ] Computed 360 invariants in 3 ms
[2024-05-29 00:23:31] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2507 ms. Remains : 1000/1000 places, 960/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 1837 steps, including 0 resets, run visited all 2 properties in 30 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2024-05-29 00:23:32] [INFO ] Invariant cache hit.
[2024-05-29 00:23:33] [INFO ] [Real]Absence check using 360 positive place invariants in 209 ms returned sat
[2024-05-29 00:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:23:35] [INFO ] [Real]Absence check using state equation in 2123 ms returned sat
[2024-05-29 00:23:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:23:36] [INFO ] [Nat]Absence check using 360 positive place invariants in 196 ms returned sat
[2024-05-29 00:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:23:37] [INFO ] [Nat]Absence check using state equation in 1768 ms returned sat
[2024-05-29 00:23:38] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2024-05-29 00:23:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-29 00:23:38] [INFO ] Computed and/alt/rep : 882/3066/882 causal constraints (skipped 77 transitions) in 57 ms.
[2024-05-29 00:23:50] [INFO ] Added : 755 causal constraints over 151 iterations in 12182 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 98 reset in 700 ms.
Product exploration explored 100000 steps with 98 reset in 859 ms.
Built C files in :
/tmp/ltsmin1782225663993110877
[2024-05-29 00:23:52] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-29 00:23:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:23:52] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-29 00:23:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:23:52] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-29 00:23:52] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:23:52] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1782225663993110877
Running compilation step : cd /tmp/ltsmin1782225663993110877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2688 ms.
Running link step : cd /tmp/ltsmin1782225663993110877;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1782225663993110877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10289492574997196194.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-05-29 00:24:07] [INFO ] Invariant cache hit.
[2024-05-29 00:24:07] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-29 00:24:07] [INFO ] Invariant cache hit.
[2024-05-29 00:24:09] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
[2024-05-29 00:24:09] [INFO ] Redundant transitions in 100 ms returned []
[2024-05-29 00:24:09] [INFO ] Invariant cache hit.
[2024-05-29 00:24:09] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2679 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin506820576947312524
[2024-05-29 00:24:09] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-29 00:24:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:24:09] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-29 00:24:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:24:09] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-29 00:24:09] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:24:09] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin506820576947312524
Running compilation step : cd /tmp/ltsmin506820576947312524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin506820576947312524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin506820576947312524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 00:24:12] [INFO ] Flatten gal took : 46 ms
[2024-05-29 00:24:12] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:24:13] [INFO ] Time to serialize gal into /tmp/LTL2610447631816589616.gal : 4 ms
[2024-05-29 00:24:13] [INFO ] Time to serialize properties into /tmp/LTL10027921483641282574.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2610447631816589616.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17157858185335204998.hoa' '-atoms' '/tmp/LTL10027921483641282574.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10027921483641282574.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17157858185335204998.hoa
Detected timeout of ITS tools.
[2024-05-29 00:24:28] [INFO ] Flatten gal took : 34 ms
[2024-05-29 00:24:28] [INFO ] Flatten gal took : 34 ms
[2024-05-29 00:24:28] [INFO ] Time to serialize gal into /tmp/LTL873252105492266846.gal : 5 ms
[2024-05-29 00:24:28] [INFO ] Time to serialize properties into /tmp/LTL11951977502666177292.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL873252105492266846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11951977502666177292.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((p56==0)||(p67==0))"))&&(F(("((p364==1)&&(p385==1))")||(X("((p457==1)&&(p459==1))")))))))
Formula 0 simplified : F(G!"((p56==0)||(p67==0))" | G(!"((p364==1)&&(p385==1))" & X!"((p457==1)&&(p459==1))"))
Detected timeout of ITS tools.
[2024-05-29 00:24:43] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:24:43] [INFO ] Applying decomposition
[2024-05-29 00:24:43] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph194310312363436945.txt' '-o' '/tmp/graph194310312363436945.bin' '-w' '/tmp/graph194310312363436945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph194310312363436945.bin' '-l' '-1' '-v' '-w' '/tmp/graph194310312363436945.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:24:43] [INFO ] Decomposing Gal with order
[2024-05-29 00:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:24:43] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-29 00:24:43] [INFO ] Flatten gal took : 53 ms
[2024-05-29 00:24:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 608 labels/synchronizations in 36 ms.
[2024-05-29 00:24:43] [INFO ] Time to serialize gal into /tmp/LTL8271157404943601446.gal : 10 ms
[2024-05-29 00:24:43] [INFO ] Time to serialize properties into /tmp/LTL6382194917175048586.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8271157404943601446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6382194917175048586.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("((i2.i1.u20.p56==0)||(i2.i1.u24.p67==0))"))&&(F(("((i14.i1.u132.p364==1)&&(i15.i2.u139.p385==1))")||(X("((i18.i1.u164.p457==1...188
Formula 0 simplified : F(G!"((i2.i1.u20.p56==0)||(i2.i1.u24.p67==0))" | G(!"((i14.i1.u132.p364==1)&&(i15.i2.u139.p385==1))" & X!"((i18.i1.u164.p457==1)&&(i...178
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1534207349285557556
[2024-05-29 00:24:58] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1534207349285557556
Running compilation step : cd /tmp/ltsmin1534207349285557556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1676 ms.
Running link step : cd /tmp/ltsmin1534207349285557556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1534207349285557556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(((LTLAPp1==true)||X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-10 finished in 125871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(!p1)))) U p2))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 41 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:25:13] [INFO ] Computed 361 invariants in 6 ms
[2024-05-29 00:25:14] [INFO ] Implicit Places using invariants in 660 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 663 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 728 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s754 1) (EQ s769 1)), p0:(NEQ s326 1), p1:(AND (EQ s88 1) (EQ s96 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 81 reset in 719 ms.
Product exploration explored 100000 steps with 80 reset in 855 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 113 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Finished random walk after 1697 steps, including 0 resets, run visited all 5 properties in 26 ms. (steps per millisecond=65 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F p2), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 12 factoid took 281 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:25:16] [INFO ] Computed 360 invariants in 3 ms
[2024-05-29 00:25:17] [INFO ] [Real]Absence check using 360 positive place invariants in 237 ms returned sat
[2024-05-29 00:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:25:20] [INFO ] [Real]Absence check using state equation in 2182 ms returned sat
[2024-05-29 00:25:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:25:20] [INFO ] [Nat]Absence check using 360 positive place invariants in 177 ms returned sat
[2024-05-29 00:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:25:22] [INFO ] [Nat]Absence check using state equation in 1714 ms returned sat
[2024-05-29 00:25:22] [INFO ] Computed and/alt/rep : 882/3061/882 causal constraints (skipped 78 transitions) in 54 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 00:25:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:25:35] [INFO ] Invariant cache hit.
[2024-05-29 00:25:35] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-29 00:25:35] [INFO ] Invariant cache hit.
[2024-05-29 00:25:36] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2024-05-29 00:25:37] [INFO ] Redundant transitions in 100 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-29 00:25:37] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:25:37] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2562 ms. Remains : 1000/1000 places, 960/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 110 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Finished random walk after 1837 steps, including 0 resets, run visited all 5 properties in 47 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F p2), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 12 factoid took 273 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
[2024-05-29 00:25:38] [INFO ] Invariant cache hit.
[2024-05-29 00:25:39] [INFO ] [Real]Absence check using 360 positive place invariants in 268 ms returned sat
[2024-05-29 00:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:25:42] [INFO ] [Real]Absence check using state equation in 2690 ms returned sat
[2024-05-29 00:25:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:25:43] [INFO ] [Nat]Absence check using 360 positive place invariants in 152 ms returned sat
[2024-05-29 00:25:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:25:45] [INFO ] [Nat]Absence check using state equation in 2817 ms returned sat
[2024-05-29 00:25:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 00:25:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2024-05-29 00:25:46] [INFO ] Computed and/alt/rep : 882/3066/882 causal constraints (skipped 77 transitions) in 55 ms.
[2024-05-29 00:25:57] [INFO ] Added : 555 causal constraints over 111 iterations in 11263 ms. Result :unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 80 reset in 736 ms.
Product exploration explored 100000 steps with 80 reset in 879 ms.
Built C files in :
/tmp/ltsmin6419091044101941686
[2024-05-29 00:25:59] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-29 00:25:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:25:59] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-29 00:25:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:25:59] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-29 00:25:59] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:25:59] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6419091044101941686
Running compilation step : cd /tmp/ltsmin6419091044101941686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2782 ms.
Running link step : cd /tmp/ltsmin6419091044101941686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin6419091044101941686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17144130052808825198.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-05-29 00:26:14] [INFO ] Invariant cache hit.
[2024-05-29 00:26:14] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-29 00:26:14] [INFO ] Invariant cache hit.
[2024-05-29 00:26:15] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
[2024-05-29 00:26:15] [INFO ] Redundant transitions in 112 ms returned []
[2024-05-29 00:26:15] [INFO ] Invariant cache hit.
[2024-05-29 00:26:16] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2542 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin14522603040701145809
[2024-05-29 00:26:16] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-29 00:26:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:26:16] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-29 00:26:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:26:16] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-29 00:26:16] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:26:16] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14522603040701145809
Running compilation step : cd /tmp/ltsmin14522603040701145809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2798 ms.
Running link step : cd /tmp/ltsmin14522603040701145809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin14522603040701145809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13712921631115030746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:26:31] [INFO ] Flatten gal took : 36 ms
[2024-05-29 00:26:31] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:26:31] [INFO ] Time to serialize gal into /tmp/LTL5565788950399270950.gal : 4 ms
[2024-05-29 00:26:31] [INFO ] Time to serialize properties into /tmp/LTL3430782599220286314.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5565788950399270950.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14501310816045088757.hoa' '-atoms' '/tmp/LTL3430782599220286314.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3430782599220286314.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14501310816045088757.hoa
Detected timeout of ITS tools.
[2024-05-29 00:26:46] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:26:46] [INFO ] Flatten gal took : 38 ms
[2024-05-29 00:26:46] [INFO ] Time to serialize gal into /tmp/LTL6120266752092598405.gal : 5 ms
[2024-05-29 00:26:46] [INFO ] Time to serialize properties into /tmp/LTL3251469421957959172.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6120266752092598405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3251469421957959172.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G((F("(p326==0)"))&&(F(G(!("(((p88==1)&&(p96==1))&&(p102==1))"))))))U("((p754==1)&&(p769==1))")))
Formula 0 simplified : F(G!"(p326==0)" | GF"(((p88==1)&&(p96==1))&&(p102==1))") R !"((p754==1)&&(p769==1))"
Detected timeout of ITS tools.
[2024-05-29 00:27:01] [INFO ] Flatten gal took : 42 ms
[2024-05-29 00:27:01] [INFO ] Applying decomposition
[2024-05-29 00:27:01] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1283089279565723127.txt' '-o' '/tmp/graph1283089279565723127.bin' '-w' '/tmp/graph1283089279565723127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1283089279565723127.bin' '-l' '-1' '-v' '-w' '/tmp/graph1283089279565723127.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:27:02] [INFO ] Decomposing Gal with order
[2024-05-29 00:27:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:27:02] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-29 00:27:02] [INFO ] Flatten gal took : 78 ms
[2024-05-29 00:27:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 624 labels/synchronizations in 37 ms.
[2024-05-29 00:27:02] [INFO ] Time to serialize gal into /tmp/LTL5638037303212177436.gal : 19 ms
[2024-05-29 00:27:02] [INFO ] Time to serialize properties into /tmp/LTL2021167951917241906.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5638037303212177436.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2021167951917241906.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G((F("(i12.i2.u117.p326==0)"))&&(F(G(!("(((i3.i1.u32.p88==1)&&(i3.i1.u35.p96==1))&&(i3.i1.u36.p102==1))"))))))U("((i30.i0.u271.p75...188
Formula 0 simplified : F(G!"(i12.i2.u117.p326==0)" | GF"(((i3.i1.u32.p88==1)&&(i3.i1.u35.p96==1))&&(i3.i1.u36.p102==1))") R !"((i30.i0.u271.p754==1)&&(i30....173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15037533723940893866
[2024-05-29 00:27:17] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15037533723940893866
Running compilation step : cd /tmp/ltsmin15037533723940893866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1713 ms.
Running link step : cd /tmp/ltsmin15037533723940893866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15037533723940893866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((<>((LTLAPp0==true))&&<>([](!(LTLAPp1==true))))) U (LTLAPp2==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-13 finished in 138810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (G(!p1)||(!p1&&G(F(!p2)))||G(!p0))))))))'
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-29 00:27:32] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 00:27:33] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-29 00:27:33] [INFO ] Invariant cache hit.
[2024-05-29 00:27:34] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1895 ms to find 0 implicit places.
[2024-05-29 00:27:34] [INFO ] Invariant cache hit.
[2024-05-29 00:27:35] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2561 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 371 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1), acceptance={} source=3 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=4 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=6 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=8 dest: 4}, { cond=(AND p0 p2), acceptance={0, 1} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s113 1) (EQ s123 1) (EQ s127 1)), p1:(AND (EQ s833 1) (EQ s848 1)), p2:(AND (EQ s737 1) (EQ s770 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 95 reset in 849 ms.
Product exploration explored 100000 steps with 96 reset in 976 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 196 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 00:27:38] [INFO ] Invariant cache hit.
[2024-05-29 00:27:38] [INFO ] [Real]Absence check using 361 positive place invariants in 63 ms returned sat
[2024-05-29 00:27:39] [INFO ] After 1065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 00:27:39] [INFO ] [Nat]Absence check using 361 positive place invariants in 59 ms returned sat
[2024-05-29 00:27:41] [INFO ] After 1894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 00:27:41] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-05-29 00:27:41] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-29 00:27:42] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-29 00:27:42] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-29 00:27:42] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 00:27:42] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-29 00:27:42] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2024-05-29 00:27:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 677 ms
[2024-05-29 00:27:42] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-29 00:27:42] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 00:27:42] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-05-29 00:27:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 303 ms
[2024-05-29 00:27:43] [INFO ] After 3235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 993 ms.
[2024-05-29 00:27:44] [INFO ] After 4572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 431 ms.
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 276 times.
Drop transitions removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 280 place count 1001 transition count 961
Applied a total of 280 rules in 54 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1001/1003 places, 961/963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:27:44] [INFO ] Computed 361 invariants in 34 ms
[2024-05-29 00:27:45] [INFO ] [Real]Absence check using 359 positive place invariants in 60 ms returned sat
[2024-05-29 00:27:45] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 00:27:45] [INFO ] After 802ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:27:45] [INFO ] [Nat]Absence check using 359 positive place invariants in 63 ms returned sat
[2024-05-29 00:27:45] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 00:27:47] [INFO ] After 1250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 00:27:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 00:27:48] [INFO ] After 865ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 00:27:48] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2024-05-29 00:27:48] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-29 00:27:48] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 00:27:48] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 00:27:48] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 00:27:49] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 00:27:49] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 00:27:49] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 00:27:49] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:27:49] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:27:49] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 00:27:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1502 ms
[2024-05-29 00:27:49] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 00:27:50] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 00:27:50] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 00:27:50] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2024-05-29 00:27:50] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 00:27:50] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-29 00:27:50] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 00:27:50] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-29 00:27:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1039 ms
[2024-05-29 00:27:51] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 00:27:51] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 00:27:51] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-29 00:27:51] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 00:27:51] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 00:27:51] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 00:27:51] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 00:27:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 00:27:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 990 ms
[2024-05-29 00:27:52] [INFO ] After 4757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 284 ms.
[2024-05-29 00:27:52] [INFO ] After 6615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 316 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 21 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:27:52] [INFO ] Invariant cache hit.
[2024-05-29 00:27:53] [INFO ] [Real]Absence check using 359 positive place invariants in 63 ms returned sat
[2024-05-29 00:27:53] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 00:27:53] [INFO ] After 768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:27:53] [INFO ] [Nat]Absence check using 359 positive place invariants in 64 ms returned sat
[2024-05-29 00:27:53] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:27:54] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:27:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 00:27:55] [INFO ] After 668ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:27:55] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2024-05-29 00:27:55] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2024-05-29 00:27:56] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2024-05-29 00:27:56] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-29 00:27:56] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 4 ms to minimize.
[2024-05-29 00:27:56] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2024-05-29 00:27:56] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 00:27:56] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:27:56] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-29 00:27:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 00:27:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 00:27:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1581 ms
[2024-05-29 00:27:57] [INFO ] After 2299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1063 ms.
[2024-05-29 00:27:58] [INFO ] After 4514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 85 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 182780 steps, run timeout after 3047 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 182780 steps, saw 153743 distinct states, run finished after 3048 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:28:01] [INFO ] Invariant cache hit.
[2024-05-29 00:28:01] [INFO ] [Real]Absence check using 359 positive place invariants in 65 ms returned sat
[2024-05-29 00:28:01] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:28:02] [INFO ] After 776ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:28:02] [INFO ] [Nat]Absence check using 359 positive place invariants in 64 ms returned sat
[2024-05-29 00:28:02] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:03] [INFO ] After 833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:28:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 00:28:04] [INFO ] After 681ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:28:04] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2024-05-29 00:28:04] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2024-05-29 00:28:04] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2024-05-29 00:28:04] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 00:28:04] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-29 00:28:05] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-29 00:28:05] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:28:05] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-29 00:28:05] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 00:28:05] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-29 00:28:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 00:28:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1498 ms
[2024-05-29 00:28:05] [INFO ] After 2233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1019 ms.
[2024-05-29 00:28:06] [INFO ] After 4356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 77 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 1001/1001 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:28:06] [INFO ] Invariant cache hit.
[2024-05-29 00:28:07] [INFO ] Implicit Places using invariants in 698 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 701 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 739 ms. Remains : 1000/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188631 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188631 steps, saw 156743 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:28:10] [INFO ] Computed 360 invariants in 28 ms
[2024-05-29 00:28:10] [INFO ] [Real]Absence check using 358 positive place invariants in 61 ms returned sat
[2024-05-29 00:28:10] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:11] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:28:11] [INFO ] [Nat]Absence check using 358 positive place invariants in 61 ms returned sat
[2024-05-29 00:28:11] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:12] [INFO ] After 991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:28:13] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 00:28:13] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 00:28:13] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 00:28:13] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 00:28:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 00:28:13] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 00:28:13] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 00:28:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-29 00:28:14] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 00:28:15] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 00:28:15] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2024-05-29 00:28:15] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 00:28:15] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 00:28:15] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-29 00:28:15] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 4 ms to minimize.
[2024-05-29 00:28:15] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2024-05-29 00:28:16] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 00:28:16] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 00:28:16] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2024-05-29 00:28:16] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2024-05-29 00:28:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2024-05-29 00:28:16] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 00:28:16] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:28:16] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-29 00:28:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 00:28:17] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3838 ms
[2024-05-29 00:28:17] [INFO ] After 5487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 398 ms.
[2024-05-29 00:28:17] [INFO ] After 6135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1000/1000 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:28:17] [INFO ] Invariant cache hit.
[2024-05-29 00:28:18] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-29 00:28:18] [INFO ] Invariant cache hit.
[2024-05-29 00:28:19] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
[2024-05-29 00:28:19] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 00:28:19] [INFO ] Invariant cache hit.
[2024-05-29 00:28:20] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3040 ms. Remains : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 00:28:20] [INFO ] Invariant cache hit.
[2024-05-29 00:28:20] [INFO ] [Real]Absence check using 358 positive place invariants in 60 ms returned sat
[2024-05-29 00:28:20] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 00:28:21] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:28:21] [INFO ] [Nat]Absence check using 358 positive place invariants in 64 ms returned sat
[2024-05-29 00:28:21] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:22] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:28:22] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 00:28:22] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 00:28:22] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 00:28:23] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-29 00:28:23] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2024-05-29 00:28:23] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2024-05-29 00:28:23] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 00:28:23] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2024-05-29 00:28:23] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 00:28:23] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:28:23] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 00:28:24] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 00:28:24] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-29 00:28:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1744 ms
[2024-05-29 00:28:24] [INFO ] After 2649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-29 00:28:24] [INFO ] After 3067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 17 factoid took 705 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 374 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-29 00:28:25] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 00:28:26] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-29 00:28:26] [INFO ] Invariant cache hit.
[2024-05-29 00:28:27] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
[2024-05-29 00:28:27] [INFO ] Invariant cache hit.
[2024-05-29 00:28:28] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2323 ms. Remains : 1003/1003 places, 963/963 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 177 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 00:28:29] [INFO ] Invariant cache hit.
[2024-05-29 00:28:29] [INFO ] [Real]Absence check using 361 positive place invariants in 61 ms returned sat
[2024-05-29 00:28:30] [INFO ] After 989ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 00:28:30] [INFO ] [Nat]Absence check using 361 positive place invariants in 64 ms returned sat
[2024-05-29 00:28:32] [INFO ] After 1870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 00:28:32] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 00:28:32] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-29 00:28:32] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-29 00:28:32] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-29 00:28:32] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 00:28:32] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 00:28:32] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-05-29 00:28:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 661 ms
[2024-05-29 00:28:33] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-29 00:28:33] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-29 00:28:33] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2024-05-29 00:28:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 287 ms
[2024-05-29 00:28:33] [INFO ] After 3165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 993 ms.
[2024-05-29 00:28:34] [INFO ] After 4505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 295 ms.
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
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 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 276 times.
Drop transitions removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 280 place count 1001 transition count 961
Applied a total of 280 rules in 53 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1001/1003 places, 961/963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:28:35] [INFO ] Computed 361 invariants in 20 ms
[2024-05-29 00:28:35] [INFO ] [Real]Absence check using 359 positive place invariants in 60 ms returned sat
[2024-05-29 00:28:35] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:35] [INFO ] After 665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:28:36] [INFO ] [Nat]Absence check using 359 positive place invariants in 64 ms returned sat
[2024-05-29 00:28:36] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:36] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:28:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 00:28:36] [INFO ] After 216ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 00:28:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1017 ms
[2024-05-29 00:28:37] [INFO ] After 1297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 403 ms.
[2024-05-29 00:28:38] [INFO ] After 2508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 62 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193677 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193677 steps, saw 159393 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:28:41] [INFO ] Invariant cache hit.
[2024-05-29 00:28:41] [INFO ] [Real]Absence check using 359 positive place invariants in 60 ms returned sat
[2024-05-29 00:28:41] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:42] [INFO ] After 716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:28:42] [INFO ] [Nat]Absence check using 359 positive place invariants in 61 ms returned sat
[2024-05-29 00:28:42] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:43] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:28:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 00:28:43] [INFO ] After 643ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:28:44] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 00:28:44] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 00:28:44] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2024-05-29 00:28:44] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-29 00:28:44] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-05-29 00:28:45] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2024-05-29 00:28:45] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:28:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 00:28:45] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:28:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 00:28:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 00:28:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1549 ms
[2024-05-29 00:28:45] [INFO ] After 2247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 961 ms.
[2024-05-29 00:28:46] [INFO ] After 4253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 74 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1001/1001 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 15 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:28:46] [INFO ] Invariant cache hit.
[2024-05-29 00:28:47] [INFO ] Implicit Places using invariants in 674 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 675 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 709 ms. Remains : 1000/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193003 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193003 steps, saw 159061 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:28:50] [INFO ] Computed 360 invariants in 12 ms
[2024-05-29 00:28:50] [INFO ] [Real]Absence check using 358 positive place invariants in 60 ms returned sat
[2024-05-29 00:28:50] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:51] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:28:51] [INFO ] [Nat]Absence check using 358 positive place invariants in 55 ms returned sat
[2024-05-29 00:28:51] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:28:52] [INFO ] After 957ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:28:53] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 00:28:53] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 00:28:53] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 00:28:53] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:28:53] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 00:28:53] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 00:28:53] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 00:28:53] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-29 00:28:54] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-29 00:28:54] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 00:28:55] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2024-05-29 00:28:55] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 00:28:55] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-29 00:28:55] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2024-05-29 00:28:55] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 00:28:55] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-29 00:28:55] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-05-29 00:28:55] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 00:28:56] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2024-05-29 00:28:56] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 00:28:56] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 4 ms to minimize.
[2024-05-29 00:28:56] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 00:28:56] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 00:28:56] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-29 00:28:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 00:28:56] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3676 ms
[2024-05-29 00:28:56] [INFO ] After 5292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 385 ms.
[2024-05-29 00:28:57] [INFO ] After 5919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1000/1000 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:28:57] [INFO ] Invariant cache hit.
[2024-05-29 00:28:57] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-29 00:28:57] [INFO ] Invariant cache hit.
[2024-05-29 00:28:59] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
[2024-05-29 00:28:59] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-29 00:28:59] [INFO ] Invariant cache hit.
[2024-05-29 00:29:00] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2979 ms. Remains : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 00:29:00] [INFO ] Invariant cache hit.
[2024-05-29 00:29:00] [INFO ] [Real]Absence check using 358 positive place invariants in 65 ms returned sat
[2024-05-29 00:29:00] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:29:00] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:29:01] [INFO ] [Nat]Absence check using 358 positive place invariants in 60 ms returned sat
[2024-05-29 00:29:01] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:29:01] [INFO ] After 801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:29:02] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 00:29:02] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 00:29:02] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 00:29:02] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 00:29:02] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-29 00:29:02] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2024-05-29 00:29:02] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 00:29:03] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-29 00:29:03] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-29 00:29:03] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:29:03] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 00:29:03] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 00:29:03] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-29 00:29:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1669 ms
[2024-05-29 00:29:03] [INFO ] After 2543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-29 00:29:03] [INFO ] After 2940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 17 factoid took 634 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 381 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 358 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 102 reset in 757 ms.
Product exploration explored 100000 steps with 97 reset in 913 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 359 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1003 transition count 963
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 93 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:29:07] [INFO ] Redundant transitions in 104 ms returned [955]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 962 rows 1003 cols
[2024-05-29 00:29:07] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 00:29:08] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1003 places, 962/963 transitions.
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 0 rules in 45 ms. Remains 1003 /1003 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 821 ms. Remains : 1003/1003 places, 962/963 transitions.
Built C files in :
/tmp/ltsmin3256988963486687567
[2024-05-29 00:29:08] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3256988963486687567
Running compilation step : cd /tmp/ltsmin3256988963486687567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1778 ms.
Running link step : cd /tmp/ltsmin3256988963486687567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3256988963486687567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17076164204808073626.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 15 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-29 00:29:23] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 00:29:24] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-29 00:29:24] [INFO ] Invariant cache hit.
[2024-05-29 00:29:25] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2024-05-29 00:29:25] [INFO ] Invariant cache hit.
[2024-05-29 00:29:26] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2433 ms. Remains : 1003/1003 places, 963/963 transitions.
Built C files in :
/tmp/ltsmin17169090606820067124
[2024-05-29 00:29:26] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17169090606820067124
Running compilation step : cd /tmp/ltsmin17169090606820067124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1665 ms.
Running link step : cd /tmp/ltsmin17169090606820067124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17169090606820067124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14554698847514357334.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:29:41] [INFO ] Flatten gal took : 36 ms
[2024-05-29 00:29:41] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:29:41] [INFO ] Time to serialize gal into /tmp/LTL586039074851973002.gal : 16 ms
[2024-05-29 00:29:41] [INFO ] Time to serialize properties into /tmp/LTL9545080517128402611.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL586039074851973002.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9820862874134963110.hoa' '-atoms' '/tmp/LTL9545080517128402611.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9545080517128402611.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9820862874134963110.hoa
Detected timeout of ITS tools.
[2024-05-29 00:29:56] [INFO ] Flatten gal took : 39 ms
[2024-05-29 00:29:56] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:29:56] [INFO ] Time to serialize gal into /tmp/LTL18333198371397860931.gal : 5 ms
[2024-05-29 00:29:56] [INFO ] Time to serialize properties into /tmp/LTL4860836103934512292.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18333198371397860931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4860836103934512292.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("(((p113==1)&&(p123==1))&&(p127==1))"))U(((G(!("((p833==1)&&(p848==1))")))||((!("((p833==1)&&(p848==1))"))&&(G(F(!("((p73...274
Formula 0 simplified : FG(!"(((p113==0)||(p123==0))||(p127==0))" | X("(((p113==1)&&(p123==1))&&(p127==1))" M (F"((p833==1)&&(p848==1))" & ("((p833==1)&&(p8...196
Detected timeout of ITS tools.
[2024-05-29 00:30:11] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:30:11] [INFO ] Applying decomposition
[2024-05-29 00:30:11] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10838396131997911230.txt' '-o' '/tmp/graph10838396131997911230.bin' '-w' '/tmp/graph10838396131997911230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10838396131997911230.bin' '-l' '-1' '-v' '-w' '/tmp/graph10838396131997911230.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:30:11] [INFO ] Decomposing Gal with order
[2024-05-29 00:30:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:30:11] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-29 00:30:11] [INFO ] Flatten gal took : 45 ms
[2024-05-29 00:30:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 628 labels/synchronizations in 33 ms.
[2024-05-29 00:30:11] [INFO ] Time to serialize gal into /tmp/LTL15873729411865067919.gal : 12 ms
[2024-05-29 00:30:11] [INFO ] Time to serialize properties into /tmp/LTL929336429244578800.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15873729411865067919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL929336429244578800.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("(((i4.i1.u41.p113==1)&&(i4.i1.u44.p123==1))&&(i4.i1.u45.p127==1))"))U(((G(!("((i33.i0.u300.p833==1)&&(i33.i0.u305.p848==...436
Formula 0 simplified : FG(!"(((i4.i1.u41.p113==0)||(i4.i1.u44.p123==0))||(i4.i1.u45.p127==0))" | X("(((i4.i1.u41.p113==1)&&(i4.i1.u44.p123==1))&&(i4.i1.u45...328
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1556726611124988602
[2024-05-29 00:30:26] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1556726611124988602
Running compilation step : cd /tmp/ltsmin1556726611124988602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1653 ms.
Running link step : cd /tmp/ltsmin1556726611124988602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1556726611124988602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((!(LTLAPp0==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[](<>(!(LTLAPp2==true))))||[](!(LTLAPp0==true)))))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-14 finished in 189449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 38 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:30:41] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 00:30:42] [INFO ] Implicit Places using invariants in 565 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 566 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 622 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s14 1) (NEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 52 reset in 716 ms.
Product exploration explored 100000 steps with 52 reset in 861 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1988 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:30:44] [INFO ] Computed 360 invariants in 6 ms
[2024-05-29 00:30:45] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-29 00:30:45] [INFO ] Invariant cache hit.
[2024-05-29 00:30:46] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
[2024-05-29 00:30:46] [INFO ] Redundant transitions in 101 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-29 00:30:46] [INFO ] Computed 360 invariants in 6 ms
[2024-05-29 00:30:47] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2522 ms. Remains : 1000/1000 places, 960/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1870 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 52 reset in 775 ms.
Product exploration explored 100000 steps with 52 reset in 865 ms.
Built C files in :
/tmp/ltsmin8722898407067677378
[2024-05-29 00:30:49] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-29 00:30:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:30:49] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-29 00:30:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:30:49] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-29 00:30:49] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:30:49] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8722898407067677378
Running compilation step : cd /tmp/ltsmin8722898407067677378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2993 ms.
Running link step : cd /tmp/ltsmin8722898407067677378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8722898407067677378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4830777160153051881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-05-29 00:31:04] [INFO ] Invariant cache hit.
[2024-05-29 00:31:05] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-05-29 00:31:05] [INFO ] Invariant cache hit.
[2024-05-29 00:31:06] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
[2024-05-29 00:31:06] [INFO ] Redundant transitions in 112 ms returned []
[2024-05-29 00:31:06] [INFO ] Invariant cache hit.
[2024-05-29 00:31:07] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2590 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin16907678510919482511
[2024-05-29 00:31:07] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-29 00:31:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:31:07] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-29 00:31:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:31:07] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-29 00:31:07] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:31:07] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16907678510919482511
Running compilation step : cd /tmp/ltsmin16907678510919482511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2915 ms.
Running link step : cd /tmp/ltsmin16907678510919482511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16907678510919482511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16495111122420014114.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:31:22] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:31:22] [INFO ] Flatten gal took : 36 ms
[2024-05-29 00:31:22] [INFO ] Time to serialize gal into /tmp/LTL6556509025823841026.gal : 5 ms
[2024-05-29 00:31:22] [INFO ] Time to serialize properties into /tmp/LTL5980997256850726453.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6556509025823841026.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15433543765639025776.hoa' '-atoms' '/tmp/LTL5980997256850726453.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5980997256850726453.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15433543765639025776.hoa
Detected timeout of ITS tools.
[2024-05-29 00:31:37] [INFO ] Flatten gal took : 34 ms
[2024-05-29 00:31:37] [INFO ] Flatten gal took : 34 ms
[2024-05-29 00:31:37] [INFO ] Time to serialize gal into /tmp/LTL15032152842741462046.gal : 5 ms
[2024-05-29 00:31:37] [INFO ] Time to serialize properties into /tmp/LTL13812240475472583961.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15032152842741462046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13812240475472583961.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p14==0)||(p35==0))"))))
Formula 0 simplified : FG!"((p14==0)||(p35==0))"
Detected timeout of ITS tools.
[2024-05-29 00:31:52] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:31:52] [INFO ] Applying decomposition
[2024-05-29 00:31:52] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13316603608575139631.txt' '-o' '/tmp/graph13316603608575139631.bin' '-w' '/tmp/graph13316603608575139631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13316603608575139631.bin' '-l' '-1' '-v' '-w' '/tmp/graph13316603608575139631.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:31:52] [INFO ] Decomposing Gal with order
[2024-05-29 00:31:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:31:52] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-29 00:31:52] [INFO ] Flatten gal took : 48 ms
[2024-05-29 00:31:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 608 labels/synchronizations in 34 ms.
[2024-05-29 00:31:52] [INFO ] Time to serialize gal into /tmp/LTL6389581109205466965.gal : 9 ms
[2024-05-29 00:31:52] [INFO ] Time to serialize properties into /tmp/LTL13830244522506625526.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6389581109205466965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13830244522506625526.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i0.u6.p14==0)||(i1.i1.u13.p35==0))"))))
Formula 0 simplified : FG!"((i0.i0.u6.p14==0)||(i1.i1.u13.p35==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3109522495479291846
[2024-05-29 00:32:07] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3109522495479291846
Running compilation step : cd /tmp/ltsmin3109522495479291846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1635 ms.
Running link step : cd /tmp/ltsmin3109522495479291846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3109522495479291846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 ShieldIIPs-PT-040A-LTLFireability-15 finished in 100886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1 U (p2||G(!p1)))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&((X(!p0)&&p1)||X(G(!p0))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040A-LTLFireability-03
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 45 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:32:23] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 00:32:23] [INFO ] Implicit Places using invariants in 546 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 551 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 615 ms. Remains : 1000/1003 places, 961/963 transitions.
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}]], initial=0, aps=[p0:(AND (EQ s688 1) (EQ s698 1) (EQ s702 1)), p1:(AND (EQ s386 1) (EQ s390 1) (EQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 52 reset in 748 ms.
Product exploration explored 100000 steps with 53 reset in 899 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 83 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[p0, p0, p0]
Finished random walk after 1314 steps, including 0 resets, run visited all 3 properties in 24 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0]
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:32:25] [INFO ] Computed 360 invariants in 5 ms
[2024-05-29 00:32:26] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-29 00:32:26] [INFO ] Invariant cache hit.
[2024-05-29 00:32:27] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
[2024-05-29 00:32:27] [INFO ] Invariant cache hit.
[2024-05-29 00:32:28] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2353 ms. Remains : 1000/1000 places, 961/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 82 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:32:28] [INFO ] Invariant cache hit.
[2024-05-29 00:32:28] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:32:29] [INFO ] [Nat]Absence check using 360 positive place invariants in 65 ms returned sat
[2024-05-29 00:32:29] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:32:29] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-29 00:32:29] [INFO ] After 773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Partial Free-agglomeration rule applied 276 times.
Drop transitions removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 276 place count 1000 transition count 961
Applied a total of 276 rules in 33 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1000/1000 places, 961/961 transitions.
Finished random walk after 3262 steps, including 0 resets, run visited all 1 properties in 35 ms. (steps per millisecond=93 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 82 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 81 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 54 reset in 752 ms.
Product exploration explored 100000 steps with 51 reset in 897 ms.
Built C files in :
/tmp/ltsmin2464544242194337471
[2024-05-29 00:32:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2464544242194337471
Running compilation step : cd /tmp/ltsmin2464544242194337471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1663 ms.
Running link step : cd /tmp/ltsmin2464544242194337471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2464544242194337471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1935376590742170572.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:32:46] [INFO ] Invariant cache hit.
[2024-05-29 00:32:47] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-05-29 00:32:47] [INFO ] Invariant cache hit.
[2024-05-29 00:32:48] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
[2024-05-29 00:32:48] [INFO ] Invariant cache hit.
[2024-05-29 00:32:49] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2529 ms. Remains : 1000/1000 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin13542866342382498987
[2024-05-29 00:32:49] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13542866342382498987
Running compilation step : cd /tmp/ltsmin13542866342382498987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1708 ms.
Running link step : cd /tmp/ltsmin13542866342382498987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13542866342382498987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10407234760947575012.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:33:04] [INFO ] Flatten gal took : 36 ms
[2024-05-29 00:33:04] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:33:04] [INFO ] Time to serialize gal into /tmp/LTL2244326353424407970.gal : 5 ms
[2024-05-29 00:33:04] [INFO ] Time to serialize properties into /tmp/LTL458454262447232714.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2244326353424407970.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2499858592628324412.hoa' '-atoms' '/tmp/LTL458454262447232714.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL458454262447232714.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2499858592628324412.hoa
Detected timeout of ITS tools.
[2024-05-29 00:33:19] [INFO ] Flatten gal took : 38 ms
[2024-05-29 00:33:19] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:33:19] [INFO ] Time to serialize gal into /tmp/LTL16461544833653755659.gal : 5 ms
[2024-05-29 00:33:19] [INFO ] Time to serialize properties into /tmp/LTL11978410092433266094.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16461544833653755659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11978410092433266094.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(((p688==0)||(p698==0))||(p702==0))")&&((X(G("(((p688==0)||(p698==0))||(p702==0))")))||(("((p386==1)&&(p390==1))")&&(("(p401==1...208
Formula 0 simplified : G(!"(((p688==0)||(p698==0))||(p702==0))" | (XF!"(((p688==0)||(p698==0))||(p702==0))" & (!"((p386==1)&&(p390==1))" | !"(p401==1)" | X...196
Detected timeout of ITS tools.
[2024-05-29 00:33:34] [INFO ] Flatten gal took : 39 ms
[2024-05-29 00:33:34] [INFO ] Applying decomposition
[2024-05-29 00:33:34] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15633211889037524915.txt' '-o' '/tmp/graph15633211889037524915.bin' '-w' '/tmp/graph15633211889037524915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15633211889037524915.bin' '-l' '-1' '-v' '-w' '/tmp/graph15633211889037524915.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:33:34] [INFO ] Decomposing Gal with order
[2024-05-29 00:33:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:33:35] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-29 00:33:35] [INFO ] Flatten gal took : 44 ms
[2024-05-29 00:33:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 33 ms.
[2024-05-29 00:33:35] [INFO ] Time to serialize gal into /tmp/LTL11463909407266107709.gal : 9 ms
[2024-05-29 00:33:35] [INFO ] Time to serialize properties into /tmp/LTL17384883268643202770.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11463909407266107709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17384883268643202770.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(("(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0))||(i27.i2.u252.p702==0))")&&((X(G("(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0...352
Formula 0 simplified : G(!"(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0))||(i27.i2.u252.p702==0))" | (XF!"(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0))|...340
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5537478538908199021
[2024-05-29 00:33:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5537478538908199021
Running compilation step : cd /tmp/ltsmin5537478538908199021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1644 ms.
Running link step : cd /tmp/ltsmin5537478538908199021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5537478538908199021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&(X([]((LTLAPp0==true)))||(X((LTLAPp0==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-03 finished in 102373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||X(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(!p1)))) U p2))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (G(!p1)||(!p1&&G(F(!p2)))||G(!p0))))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040A-LTLFireability-14
Stuttering acceptance computed with spot in 403 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 40 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:34:06] [INFO ] Computed 361 invariants in 6 ms
[2024-05-29 00:34:06] [INFO ] Implicit Places using invariants in 581 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 583 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 640 ms. Remains : 1000/1003 places, 961/963 transitions.
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1), acceptance={} source=3 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=4 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=6 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=8 dest: 4}, { cond=(AND p0 p2), acceptance={0, 1} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s113 1) (EQ s123 1) (EQ s127 1)), p1:(AND (EQ s833 1) (EQ s848 1)), p2:(AND (EQ s737 1) (EQ s770 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 84 reset in 756 ms.
Product exploration explored 100000 steps with 100 reset in 902 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 199 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:34:09] [INFO ] Computed 360 invariants in 6 ms
[2024-05-29 00:34:09] [INFO ] [Real]Absence check using 360 positive place invariants in 58 ms returned sat
[2024-05-29 00:34:10] [INFO ] After 964ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 00:34:10] [INFO ] [Nat]Absence check using 360 positive place invariants in 58 ms returned sat
[2024-05-29 00:34:12] [INFO ] After 1373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 00:34:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-29 00:34:12] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-29 00:34:12] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 00:34:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2024-05-29 00:34:12] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-29 00:34:12] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-29 00:34:12] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-29 00:34:13] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:34:13] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-29 00:34:13] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-29 00:34:13] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-29 00:34:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 749 ms
[2024-05-29 00:34:13] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2024-05-29 00:34:13] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2024-05-29 00:34:14] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2024-05-29 00:34:14] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2024-05-29 00:34:14] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 00:34:14] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 00:34:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 00:34:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 00:34:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 941 ms
[2024-05-29 00:34:14] [INFO ] After 3987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 460 ms.
[2024-05-29 00:34:15] [INFO ] After 4768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 448 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Partial Free-agglomeration rule applied 276 times.
Drop transitions removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 276 place count 1000 transition count 961
Applied a total of 276 rules in 44 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:34:15] [INFO ] Computed 360 invariants in 10 ms
[2024-05-29 00:34:16] [INFO ] [Real]Absence check using 358 positive place invariants in 67 ms returned sat
[2024-05-29 00:34:16] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:34:16] [INFO ] After 839ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 00:34:17] [INFO ] [Nat]Absence check using 358 positive place invariants in 64 ms returned sat
[2024-05-29 00:34:17] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 00:34:18] [INFO ] After 1399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 00:34:18] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 00:34:18] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 00:34:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 00:34:18] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-29 00:34:19] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 00:34:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 00:34:19] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 00:34:19] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 00:34:19] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 00:34:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 00:34:20] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 00:34:20] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 00:34:20] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-29 00:34:20] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2024-05-29 00:34:20] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-29 00:34:20] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2024-05-29 00:34:21] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-29 00:34:21] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 00:34:21] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2024-05-29 00:34:21] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 00:34:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 00:34:21] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-29 00:34:21] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 00:34:21] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-29 00:34:22] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-29 00:34:22] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 00:34:22] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3708 ms
[2024-05-29 00:34:22] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 00:34:22] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 00:34:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2024-05-29 00:34:22] [INFO ] After 5449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 241 ms.
[2024-05-29 00:34:22] [INFO ] After 5990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 123 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:34:23] [INFO ] Invariant cache hit.
[2024-05-29 00:34:23] [INFO ] [Real]Absence check using 358 positive place invariants in 69 ms returned sat
[2024-05-29 00:34:23] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:34:23] [INFO ] After 765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:34:24] [INFO ] [Nat]Absence check using 358 positive place invariants in 61 ms returned sat
[2024-05-29 00:34:24] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 00:34:24] [INFO ] After 777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:34:25] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 00:34:25] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 6 ms to minimize.
[2024-05-29 00:34:25] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 00:34:25] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 00:34:25] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2024-05-29 00:34:25] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2024-05-29 00:34:25] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 00:34:26] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2024-05-29 00:34:26] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-29 00:34:26] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 00:34:26] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 00:34:26] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 00:34:26] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-29 00:34:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1721 ms
[2024-05-29 00:34:26] [INFO ] After 2560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2024-05-29 00:34:26] [INFO ] After 2941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 189082 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189082 steps, saw 156947 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:34:29] [INFO ] Invariant cache hit.
[2024-05-29 00:34:30] [INFO ] [Real]Absence check using 358 positive place invariants in 58 ms returned sat
[2024-05-29 00:34:30] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:34:30] [INFO ] After 704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:34:30] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2024-05-29 00:34:30] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:34:31] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:34:31] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 00:34:32] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 00:34:32] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 00:34:32] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 3 ms to minimize.
[2024-05-29 00:34:32] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2024-05-29 00:34:32] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2024-05-29 00:34:32] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 00:34:32] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-29 00:34:33] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2024-05-29 00:34:33] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 00:34:33] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 00:34:33] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 00:34:33] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:34:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1780 ms
[2024-05-29 00:34:33] [INFO ] After 2620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 134 ms.
[2024-05-29 00:34:33] [INFO ] After 3003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1000/1000 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:34:33] [INFO ] Invariant cache hit.
[2024-05-29 00:34:34] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-29 00:34:34] [INFO ] Invariant cache hit.
[2024-05-29 00:34:36] [INFO ] Implicit Places using invariants and state equation in 1835 ms returned []
Implicit Place search using SMT with State Equation took 2548 ms to find 0 implicit places.
[2024-05-29 00:34:36] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 00:34:36] [INFO ] Invariant cache hit.
[2024-05-29 00:34:37] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3277 ms. Remains : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 00:34:37] [INFO ] Invariant cache hit.
[2024-05-29 00:34:37] [INFO ] [Real]Absence check using 358 positive place invariants in 69 ms returned sat
[2024-05-29 00:34:37] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 00:34:37] [INFO ] After 800ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:34:38] [INFO ] [Nat]Absence check using 358 positive place invariants in 60 ms returned sat
[2024-05-29 00:34:38] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:34:38] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:34:39] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 00:34:39] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 00:34:39] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-29 00:34:39] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 00:34:39] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2024-05-29 00:34:39] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2024-05-29 00:34:39] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 00:34:40] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2024-05-29 00:34:40] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-29 00:34:40] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 00:34:40] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 00:34:40] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 00:34:40] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2024-05-29 00:34:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1845 ms
[2024-05-29 00:34:40] [INFO ] After 2685ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-05-29 00:34:40] [INFO ] After 3058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 17 factoid took 796 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 535 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 425 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:34:42] [INFO ] Computed 360 invariants in 5 ms
[2024-05-29 00:34:43] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-29 00:34:43] [INFO ] Invariant cache hit.
[2024-05-29 00:34:44] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2024-05-29 00:34:44] [INFO ] Invariant cache hit.
[2024-05-29 00:34:45] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2562 ms. Remains : 1000/1000 places, 961/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 217 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 00:34:46] [INFO ] Invariant cache hit.
[2024-05-29 00:34:46] [INFO ] [Real]Absence check using 360 positive place invariants in 63 ms returned sat
[2024-05-29 00:34:47] [INFO ] After 1015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 00:34:47] [INFO ] [Nat]Absence check using 360 positive place invariants in 62 ms returned sat
[2024-05-29 00:34:48] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 00:34:49] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-29 00:34:49] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-29 00:34:49] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:34:49] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 00:34:49] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 00:34:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 499 ms
[2024-05-29 00:34:49] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-29 00:34:49] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 00:34:49] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-29 00:34:49] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-29 00:34:50] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 00:34:50] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 00:34:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 548 ms
[2024-05-29 00:34:50] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 00:34:50] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-05-29 00:34:50] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2024-05-29 00:34:50] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-29 00:34:50] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-29 00:34:50] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-29 00:34:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 666 ms
[2024-05-29 00:34:51] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2024-05-29 00:34:51] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-29 00:34:51] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-29 00:34:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-29 00:34:51] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 00:34:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 523 ms
[2024-05-29 00:34:51] [INFO ] After 3814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 390 ms.
[2024-05-29 00:34:51] [INFO ] After 4534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 382 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Partial Free-agglomeration rule applied 276 times.
Drop transitions removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 276 place count 1000 transition count 961
Applied a total of 276 rules in 31 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:34:52] [INFO ] Computed 360 invariants in 14 ms
[2024-05-29 00:34:52] [INFO ] [Real]Absence check using 358 positive place invariants in 59 ms returned sat
[2024-05-29 00:34:52] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:34:53] [INFO ] After 687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:34:53] [INFO ] [Nat]Absence check using 358 positive place invariants in 58 ms returned sat
[2024-05-29 00:34:53] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:34:54] [INFO ] After 958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:34:55] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 00:34:55] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 00:34:55] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 00:34:55] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-29 00:34:55] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-29 00:34:55] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 00:34:55] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 00:34:55] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-29 00:34:56] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-29 00:34:56] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 00:34:57] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2024-05-29 00:34:57] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 00:34:57] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 00:34:57] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2024-05-29 00:34:57] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 00:34:57] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2024-05-29 00:34:57] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 00:34:58] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 00:34:58] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-29 00:34:58] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-05-29 00:34:58] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 00:34:58] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 00:34:58] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:34:58] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 00:34:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 00:34:58] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3801 ms
[2024-05-29 00:34:58] [INFO ] After 5399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 382 ms.
[2024-05-29 00:34:59] [INFO ] After 6021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187309 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187309 steps, saw 156018 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:35:02] [INFO ] Invariant cache hit.
[2024-05-29 00:35:02] [INFO ] [Real]Absence check using 358 positive place invariants in 59 ms returned sat
[2024-05-29 00:35:02] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 00:35:03] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:35:03] [INFO ] [Nat]Absence check using 358 positive place invariants in 57 ms returned sat
[2024-05-29 00:35:03] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:35:04] [INFO ] After 765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:35:04] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-29 00:35:04] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 00:35:04] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 00:35:04] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 00:35:04] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1740 ms
[2024-05-29 00:35:05] [INFO ] After 2572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-29 00:35:06] [INFO ] After 2951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1000/1000 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:35:06] [INFO ] Invariant cache hit.
[2024-05-29 00:35:06] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-29 00:35:06] [INFO ] Invariant cache hit.
[2024-05-29 00:35:08] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 2217 ms to find 0 implicit places.
[2024-05-29 00:35:08] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-29 00:35:08] [INFO ] Invariant cache hit.
[2024-05-29 00:35:08] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2840 ms. Remains : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 00:35:09] [INFO ] Invariant cache hit.
[2024-05-29 00:35:09] [INFO ] [Real]Absence check using 358 positive place invariants in 58 ms returned sat
[2024-05-29 00:35:09] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:35:09] [INFO ] After 704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:35:09] [INFO ] [Nat]Absence check using 358 positive place invariants in 56 ms returned sat
[2024-05-29 00:35:09] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:35:10] [INFO ] After 778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:35:10] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 00:35:11] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 00:35:11] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-29 00:35:11] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 00:35:11] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2024-05-29 00:35:11] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2024-05-29 00:35:11] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 00:35:12] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-29 00:35:12] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-29 00:35:12] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 00:35:12] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 00:35:12] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 00:35:12] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 00:35:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1808 ms
[2024-05-29 00:35:12] [INFO ] After 2646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-29 00:35:12] [INFO ] After 3021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 17 factoid took 644 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 395 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 373 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 95 reset in 767 ms.
Product exploration explored 100000 steps with 99 reset in 911 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 347 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:35:16] [INFO ] Redundant transitions in 107 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-29 00:35:16] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:35:17] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 743 ms. Remains : 1000/1000 places, 960/961 transitions.
Built C files in :
/tmp/ltsmin1480511287251178046
[2024-05-29 00:35:17] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1480511287251178046
Running compilation step : cd /tmp/ltsmin1480511287251178046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1686 ms.
Running link step : cd /tmp/ltsmin1480511287251178046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1480511287251178046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17180137809286145925.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:35:32] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:35:33] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-29 00:35:33] [INFO ] Invariant cache hit.
[2024-05-29 00:35:34] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1853 ms to find 0 implicit places.
[2024-05-29 00:35:34] [INFO ] Invariant cache hit.
[2024-05-29 00:35:35] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2522 ms. Remains : 1000/1000 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin18253762392585981676
[2024-05-29 00:35:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18253762392585981676
Running compilation step : cd /tmp/ltsmin18253762392585981676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1635 ms.
Running link step : cd /tmp/ltsmin18253762392585981676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18253762392585981676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2364714671624475861.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:35:50] [INFO ] Flatten gal took : 36 ms
[2024-05-29 00:35:50] [INFO ] Flatten gal took : 36 ms
[2024-05-29 00:35:50] [INFO ] Time to serialize gal into /tmp/LTL14293167946312975682.gal : 5 ms
[2024-05-29 00:35:50] [INFO ] Time to serialize properties into /tmp/LTL12877513455162083832.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14293167946312975682.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5201113743324165404.hoa' '-atoms' '/tmp/LTL12877513455162083832.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12877513455162083832.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5201113743324165404.hoa
Detected timeout of ITS tools.
[2024-05-29 00:36:05] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:36:05] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:36:05] [INFO ] Time to serialize gal into /tmp/LTL11815666826011472809.gal : 5 ms
[2024-05-29 00:36:05] [INFO ] Time to serialize properties into /tmp/LTL11679782648806823988.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11815666826011472809.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11679782648806823988.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("(((p113==1)&&(p123==1))&&(p127==1))"))U(((G(!("((p833==1)&&(p848==1))")))||((!("((p833==1)&&(p848==1))"))&&(G(F(!("((p73...274
Formula 0 simplified : FG(!"(((p113==0)||(p123==0))||(p127==0))" | X("(((p113==1)&&(p123==1))&&(p127==1))" M (F"((p833==1)&&(p848==1))" & ("((p833==1)&&(p8...196
Detected timeout of ITS tools.
[2024-05-29 00:36:20] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:36:20] [INFO ] Applying decomposition
[2024-05-29 00:36:20] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16130980427894898448.txt' '-o' '/tmp/graph16130980427894898448.bin' '-w' '/tmp/graph16130980427894898448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16130980427894898448.bin' '-l' '-1' '-v' '-w' '/tmp/graph16130980427894898448.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:36:20] [INFO ] Decomposing Gal with order
[2024-05-29 00:36:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:36:20] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-29 00:36:20] [INFO ] Flatten gal took : 43 ms
[2024-05-29 00:36:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 33 ms.
[2024-05-29 00:36:20] [INFO ] Time to serialize gal into /tmp/LTL1836276899844922734.gal : 10 ms
[2024-05-29 00:36:20] [INFO ] Time to serialize properties into /tmp/LTL13276730548441637914.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1836276899844922734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13276730548441637914.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("(((i4.i2.u41.p113==1)&&(i4.i2.u44.p123==1))&&(i4.i2.u45.p127==1))"))U(((G(!("((i33.i2.u300.p833==1)&&(i33.i2.u305.p848==...436
Formula 0 simplified : FG(!"(((i4.i2.u41.p113==0)||(i4.i2.u44.p123==0))||(i4.i2.u45.p127==0))" | X("(((i4.i2.u41.p113==1)&&(i4.i2.u44.p123==1))&&(i4.i2.u45...328
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4909732171368727092
[2024-05-29 00:36:35] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4909732171368727092
Running compilation step : cd /tmp/ltsmin4909732171368727092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1658 ms.
Running link step : cd /tmp/ltsmin4909732171368727092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4909732171368727092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((!(LTLAPp0==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[](<>(!(LTLAPp2==true))))||[](!(LTLAPp0==true)))))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-14 finished in 165429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-29 00:36:51] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15767160358170424826
[2024-05-29 00:36:51] [INFO ] Computing symmetric may disable matrix : 963 transitions.
[2024-05-29 00:36:51] [INFO ] Applying decomposition
[2024-05-29 00:36:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:51] [INFO ] Computing symmetric may enable matrix : 963 transitions.
[2024-05-29 00:36:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:51] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14073893154538881789.txt' '-o' '/tmp/graph14073893154538881789.bin' '-w' '/tmp/graph14073893154538881789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14073893154538881789.bin' '-l' '-1' '-v' '-w' '/tmp/graph14073893154538881789.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:36:51] [INFO ] Decomposing Gal with order
[2024-05-29 00:36:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:36:51] [INFO ] Computing Do-Not-Accords matrix : 963 transitions.
[2024-05-29 00:36:51] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:51] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15767160358170424826
Running compilation step : cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 00:36:51] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-29 00:36:51] [INFO ] Flatten gal took : 47 ms
[2024-05-29 00:36:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 628 labels/synchronizations in 30 ms.
[2024-05-29 00:36:51] [INFO ] Time to serialize gal into /tmp/LTLFireability402029563379017291.gal : 10 ms
[2024-05-29 00:36:51] [INFO ] Time to serialize properties into /tmp/LTLFireability18027039334097169618.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability402029563379017291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18027039334097169618.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 6 LTL properties
Checking formula 0 : !((G(F(("((i24.i2.u220.p611==0)||(i24.i2.u222.p615==0))")||(("(i24.i0.u225.p626==0)")||((!("(((i29.i1.u265.p736==1)&&(i29.i1.u267.p740...435
Formula 0 simplified : FG(!"((i24.i2.u220.p611==0)||(i24.i2.u222.p615==0))" & !"(i24.i0.u225.p626==0)" & ("(((i29.i1.u265.p736==1)&&(i29.i1.u267.p740==1))&...339
Compilation finished in 2718 ms.
Running link step : cd /tmp/ltsmin15767160358170424826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(LTLAPp3==true)&&((X(!(LTLAPp3==true))&&(LTLAPp4==true))||X([](!(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(LTLAPp3==true)&&((X(!(LTLAPp3==true))&&(LTLAPp4==true))||X([](!(LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp5==true))&&<>(((LTLAPp6==true)||X((LTLAPp7==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 01:03:27] [INFO ] Applying decomposition
[2024-05-29 01:03:27] [INFO ] Flatten gal took : 107 ms
[2024-05-29 01:03:27] [INFO ] Decomposing Gal with order
[2024-05-29 01:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:03:27] [INFO ] Removed a total of 680 redundant transitions.
[2024-05-29 01:03:27] [INFO ] Flatten gal took : 81 ms
[2024-05-29 01:03:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 65 ms.
[2024-05-29 01:03:27] [INFO ] Time to serialize gal into /tmp/LTLFireability13131936394196295573.gal : 15 ms
[2024-05-29 01:03:27] [INFO ] Time to serialize properties into /tmp/LTLFireability321440841646554715.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13131936394196295573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability321440841646554715.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 6 LTL properties
Checking formula 0 : !((G(F(("((u246.p611==0)||(u248.p615==0))")||(("(u251.p626==0)")||((!("(((u296.p736==1)&&(u298.p740==1))&&(u301.p751==1))"))U(("((!(((...330
Formula 0 simplified : FG(!"((u246.p611==0)||(u248.p615==0))" & !"(u251.p626==0)" & ("(((u296.p736==1)&&(u298.p740==1))&&(u301.p751==1))" M !"((!(((u246.p6...255
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp5==true))&&<>(((LTLAPp6==true)||X((LTLAPp7==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>((LTLAPp8==true))&&<>([](!(LTLAPp9==true))))) U (LTLAPp10==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>((LTLAPp8==true))&&<>([](!(LTLAPp9==true))))) U (LTLAPp10==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15767160358170424826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp11==true)&&X((!(LTLAPp11==true) U ([](!(LTLAPp12==true))||(!(LTLAPp12==true)&&[](<>(!(LTLAPp13==true))))||[](!(LTLAPp11==true))))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2125196 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034208 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-040A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPs-PT-040A, 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 r373-tall-171683788500083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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