Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 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 1679175568679

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 21:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 21:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:39:31] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-18 21:39:31] [INFO ] Transformed 1003 places.
[2023-03-18 21:39:31] [INFO ] Transformed 963 transitions.
[2023-03-18 21:39:31] [INFO ] Found NUPN structural information;
[2023-03-18 21:39:31] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-040A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 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 83 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-18 21:39:32] [INFO ] Computed 361 place invariants in 21 ms
[2023-03-18 21:39:34] [INFO ] Implicit Places using invariants in 1727 ms returned []
[2023-03-18 21:39:34] [INFO ] Invariant cache hit.
[2023-03-18 21:39:36] [INFO ] Implicit Places using invariants and state equation in 2074 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
[2023-03-18 21:39:36] [INFO ] Invariant cache hit.
[2023-03-18 21:39:36] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4740 ms. Remains : 1003/1003 places, 963/963 transitions.
Support contains 58 out of 1003 places after structural reductions.
[2023-03-18 21:39:37] [INFO ] Flatten gal took : 145 ms
[2023-03-18 21:39:37] [INFO ] Flatten gal took : 83 ms
[2023-03-18 21:39:37] [INFO ] Input system was already deterministic with 963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:39:38] [INFO ] Invariant cache hit.
[2023-03-18 21:39:38] [INFO ] [Real]Absence check using 361 positive place invariants in 243 ms returned sat
[2023-03-18 21:39:39] [INFO ] After 1675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:39:40] [INFO ] [Nat]Absence check using 361 positive place invariants in 51 ms returned sat
[2023-03-18 21:39:41] [INFO ] After 1237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:39:41] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 7 ms to minimize.
[2023-03-18 21:39:41] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 0 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 16 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 17 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1413 ms
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 11 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2023-03-18 21:39:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 942 ms
[2023-03-18 21:39:44] [INFO ] After 3816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 432 ms.
[2023-03-18 21:39:44] [INFO ] After 4651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 166 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 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 6 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
Applied a total of 278 rules in 171 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 171 ms. Remains : 1001/1003 places, 961/963 transitions.
Finished random walk after 7948 steps, including 2 resets, run visited all 2 properties in 246 ms. (steps per millisecond=32 )
FORMULA ShieldIIPs-PT-040A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPs-PT-040A-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202303021504/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 65 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-18 21:39:45] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-18 21:39:47] [INFO ] Implicit Places using invariants in 1486 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1493 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 63 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 1627 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-00 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 s862 1) (EQ s895 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 2082 steps with 0 reset in 34 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-00 finished in 1996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 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 3 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 62 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2023-03-18 21:39:47] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-18 21:39:49] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2023-03-18 21:39:49] [INFO ] Invariant cache hit.
[2023-03-18 21:39:52] [INFO ] Implicit Places using invariants and state equation in 3186 ms returned []
Implicit Place search using SMT with State Equation took 4618 ms to find 0 implicit places.
[2023-03-18 21:39:52] [INFO ] Redundant transitions in 341 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
[2023-03-18 21:39:52] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-18 21:39:53] [INFO ] Dead Transitions using invariants and state equation in 1236 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 50 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 6345 ms. Remains : 999/1003 places, 959/963 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-02 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 s510 1) (EQ s514 1) (EQ s525 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 2113 steps with 0 reset in 27 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-02 finished in 6457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||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 11 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-18 21:39:54] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-18 21:39:54] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-18 21:39:54] [INFO ] Invariant cache hit.
[2023-03-18 21:39:56] [INFO ] Implicit Places using invariants and state equation in 1891 ms returned []
Implicit Place search using SMT with State Equation took 2615 ms to find 0 implicit places.
[2023-03-18 21:39:56] [INFO ] Invariant cache hit.
[2023-03-18 21:39:57] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3311 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-05 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:(EQ s496 1), p1:(AND (EQ s661 1) (EQ s665 1) (EQ s677 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 70358 steps with 67 reset in 718 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-05 finished in 4232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(F(p2))&&p1))||(p2&&F(p3)))))'
Support contains 9 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.
[2023-03-18 21:39:58] [INFO ] Invariant cache hit.
[2023-03-18 21:39:59] [INFO ] Implicit Places using invariants in 904 ms returned []
[2023-03-18 21:39:59] [INFO ] Invariant cache hit.
[2023-03-18 21:40:00] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
[2023-03-18 21:40:00] [INFO ] Invariant cache hit.
[2023-03-18 21:40:01] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3220 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 518 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3)), true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p3) p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p3), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p2:(EQ s751 1), p0:(AND (EQ s736 1) (EQ s740 1) (EQ s752 1)), p3:(AND (EQ s511 1) (EQ s517 1) (EQ s527 1)), p1:(AND (EQ s453 1) (EQ s474 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-07 finished in 3775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0) U p1) U X((p2 U p1)))))'
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 50 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-18 21:40:02] [INFO ] Invariant cache hit.
[2023-03-18 21:40:03] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-18 21:40:03] [INFO ] Invariant cache hit.
[2023-03-18 21:40:05] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2898 ms to find 0 implicit places.
[2023-03-18 21:40:05] [INFO ] Invariant cache hit.
[2023-03-18 21:40:05] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3768 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
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 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s713 1) (EQ s721 1) (EQ s727 1)), p2:(AND (EQ s57 1) (EQ s59 1)), p0:(AND (EQ s205 1) (EQ s218 1) (EQ s57 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2041 steps with 0 reset in 19 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-08 finished in 4018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(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 11 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-18 21:40:06] [INFO ] Invariant cache hit.
[2023-03-18 21:40:06] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-18 21:40:06] [INFO ] Invariant cache hit.
[2023-03-18 21:40:08] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 2718 ms to find 0 implicit places.
[2023-03-18 21:40:08] [INFO ] Invariant cache hit.
[2023-03-18 21:40:09] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3476 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s865 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 551 reset in 849 ms.
Product exploration explored 100000 steps with 554 reset in 1005 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 177 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=44 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 21:40:12] [INFO ] Invariant cache hit.
[2023-03-18 21:40:13] [INFO ] [Real]Absence check using 361 positive place invariants in 268 ms returned sat
[2023-03-18 21:40:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:40:16] [INFO ] [Real]Absence check using state equation in 2360 ms returned sat
[2023-03-18 21:40:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:40:17] [INFO ] [Nat]Absence check using 361 positive place invariants in 146 ms returned sat
[2023-03-18 21:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:40:19] [INFO ] [Nat]Absence check using state equation in 2642 ms returned sat
[2023-03-18 21:40:19] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 131 ms.
[2023-03-18 21:40:31] [INFO ] Added : 490 causal constraints over 98 iterations in 11507 ms. Result :unknown
Could not prove EG (NOT 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 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-18 21:40:31] [INFO ] Invariant cache hit.
[2023-03-18 21:40:32] [INFO ] Implicit Places using invariants in 782 ms returned []
[2023-03-18 21:40:32] [INFO ] Invariant cache hit.
[2023-03-18 21:40:33] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 2348 ms to find 0 implicit places.
[2023-03-18 21:40:33] [INFO ] Invariant cache hit.
[2023-03-18 21:40:34] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3139 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 157 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=78 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 21:40:35] [INFO ] Invariant cache hit.
[2023-03-18 21:40:36] [INFO ] [Real]Absence check using 361 positive place invariants in 324 ms returned sat
[2023-03-18 21:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:40:39] [INFO ] [Real]Absence check using state equation in 3178 ms returned sat
[2023-03-18 21:40:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:40:40] [INFO ] [Nat]Absence check using 361 positive place invariants in 149 ms returned sat
[2023-03-18 21:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:40:42] [INFO ] [Nat]Absence check using state equation in 2125 ms returned sat
[2023-03-18 21:40:42] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 97 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
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:261)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-18 21:40:54] [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: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 557 reset in 786 ms.
Stuttering criterion allowed to conclude after 19577 steps with 96 reset in 168 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-10 finished in 49762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 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 81 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-18 21:40:55] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-18 21:40:56] [INFO ] Implicit Places using invariants in 683 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 684 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 23 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 788 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s963 1) (EQ s971 1) (EQ s977 1) (EQ s897 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2172 steps with 1 reset in 18 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-11 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U G(p1))))'
Support contains 3 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 13 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-18 21:40:56] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-18 21:40:57] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-18 21:40:57] [INFO ] Invariant cache hit.
[2023-03-18 21:40:59] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2023-03-18 21:40:59] [INFO ] Invariant cache hit.
[2023-03-18 21:40:59] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2893 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s857 1) (EQ s859 1)), p0:(NEQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24991 reset in 2018 ms.
Product exploration explored 100000 steps with 25046 reset in 2000 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 p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 301 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 1885 steps, including 0 resets, run visited all 2 properties in 39 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 440 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-18 21:41:05] [INFO ] Invariant cache hit.
[2023-03-18 21:41:06] [INFO ] [Real]Absence check using 361 positive place invariants in 201 ms returned sat
[2023-03-18 21:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:41:08] [INFO ] [Real]Absence check using state equation in 2028 ms returned sat
[2023-03-18 21:41:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:41:09] [INFO ] [Nat]Absence check using 361 positive place invariants in 154 ms returned sat
[2023-03-18 21:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:41:10] [INFO ] [Nat]Absence check using state equation in 1307 ms returned sat
[2023-03-18 21:41:10] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2023-03-18 21:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-18 21:41:11] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 91 ms.
[2023-03-18 21:41:24] [INFO ] Deduced a trap composed of 3 places in 1081 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-18 21:41:24] [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: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 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 11 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-18 21:41:24] [INFO ] Invariant cache hit.
[2023-03-18 21:41:25] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-18 21:41:25] [INFO ] Invariant cache hit.
[2023-03-18 21:41:26] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2303 ms to find 0 implicit places.
[2023-03-18 21:41:26] [INFO ] Invariant cache hit.
[2023-03-18 21:41:27] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3034 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 p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 1921 steps, including 0 resets, run visited all 2 properties in 43 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 454 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-18 21:41:29] [INFO ] Invariant cache hit.
[2023-03-18 21:41:30] [INFO ] [Real]Absence check using 361 positive place invariants in 204 ms returned sat
[2023-03-18 21:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:41:32] [INFO ] [Real]Absence check using state equation in 2168 ms returned sat
[2023-03-18 21:41:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:41:33] [INFO ] [Nat]Absence check using 361 positive place invariants in 162 ms returned sat
[2023-03-18 21:41:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:41:34] [INFO ] [Nat]Absence check using state equation in 1310 ms returned sat
[2023-03-18 21:41:34] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2023-03-18 21:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-03-18 21:41:35] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 106 ms.
[2023-03-18 21:41:47] [INFO ] Added : 525 causal constraints over 105 iterations in 12548 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 33128 reset in 2357 ms.
Product exploration explored 100000 steps with 33257 reset in 2426 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 3 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 2 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 108 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-18 21:41:53] [INFO ] Redundant transitions in 129 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
[2023-03-18 21:41:53] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-18 21:41:53] [INFO ] Dead Transitions using invariants and state equation in 561 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 70 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 892 ms. Remains : 1003/1003 places, 962/963 transitions.
Built C files in :
/tmp/ltsmin16828133405963666684
[2023-03-18 21:41:53] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16828133405963666684
Running compilation step : cd /tmp/ltsmin16828133405963666684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1798 ms.
Running link step : cd /tmp/ltsmin16828133405963666684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin16828133405963666684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12693495872446369364.hoa' '--buchi-type=spotba'
LTSmin run took 3051 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-040A-LTLFireability-12 finished in 62164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&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 3 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 5 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 107 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-18 21:41:59] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-18 21:41:59] [INFO ] Implicit Places using invariants in 533 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 535 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 22 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 665 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 301 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 820 ms.
Product exploration explored 100000 steps with 81 reset in 1020 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 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 809 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 288 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Finished random walk after 1686 steps, including 0 resets, run visited all 5 properties in 84 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT p2))), (X (X (NOT p1)))]
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 886 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 386 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 961 rows 1000 cols
[2023-03-18 21:42:04] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-18 21:42:05] [INFO ] [Real]Absence check using 360 positive place invariants in 295 ms returned sat
[2023-03-18 21:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:42:08] [INFO ] [Real]Absence check using state equation in 2164 ms returned sat
[2023-03-18 21:42:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:42:09] [INFO ] [Nat]Absence check using 360 positive place invariants in 178 ms returned sat
[2023-03-18 21:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:42:10] [INFO ] [Nat]Absence check using state equation in 1617 ms returned sat
[2023-03-18 21:42:10] [INFO ] Computed and/alt/rep : 882/3061/882 causal constraints (skipped 78 transitions) in 84 ms.
[2023-03-18 21:42:23] [INFO ] Added : 500 causal constraints over 100 iterations in 12349 ms. Result :unknown
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 42 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-18 21:42:23] [INFO ] Invariant cache hit.
[2023-03-18 21:42:24] [INFO ] Implicit Places using invariants in 820 ms returned []
[2023-03-18 21:42:24] [INFO ] Invariant cache hit.
[2023-03-18 21:42:25] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
[2023-03-18 21:42:25] [INFO ] Redundant transitions in 130 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
[2023-03-18 21:42:25] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-18 21:42:26] [INFO ] Dead Transitions using invariants and state equation in 792 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 20 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 3317 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 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 741 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 272 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Finished random walk after 1796 steps, including 0 resets, run visited all 5 properties in 68 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT p2))), (X (X (NOT p1)))]
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 666 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 244 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
[2023-03-18 21:42:28] [INFO ] Invariant cache hit.
[2023-03-18 21:42:30] [INFO ] [Real]Absence check using 360 positive place invariants in 247 ms returned sat
[2023-03-18 21:42:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:42:32] [INFO ] [Real]Absence check using state equation in 2627 ms returned sat
[2023-03-18 21:42:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:42:33] [INFO ] [Nat]Absence check using 360 positive place invariants in 147 ms returned sat
[2023-03-18 21:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:42:36] [INFO ] [Nat]Absence check using state equation in 2815 ms returned sat
[2023-03-18 21:42:36] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-18 21:42:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-18 21:42:36] [INFO ] Computed and/alt/rep : 882/3066/882 causal constraints (skipped 77 transitions) in 148 ms.
[2023-03-18 21:42:47] [INFO ] Added : 435 causal constraints over 87 iterations in 10961 ms. Result :unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 80 reset in 885 ms.
Product exploration explored 100000 steps with 81 reset in 1042 ms.
Built C files in :
/tmp/ltsmin9805511088612398234
[2023-03-18 21:42:49] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2023-03-18 21:42:49] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:42:49] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2023-03-18 21:42:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:42:50] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2023-03-18 21:42:50] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:42:50] [INFO ] Built C files in 285ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9805511088612398234
Running compilation step : cd /tmp/ltsmin9805511088612398234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2698 ms.
Running link step : cd /tmp/ltsmin9805511088612398234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9805511088612398234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4519576010881437993.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 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-18 21:43:05] [INFO ] Invariant cache hit.
[2023-03-18 21:43:05] [INFO ] Implicit Places using invariants in 926 ms returned []
[2023-03-18 21:43:05] [INFO ] Invariant cache hit.
[2023-03-18 21:43:07] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 2565 ms to find 0 implicit places.
[2023-03-18 21:43:07] [INFO ] Redundant transitions in 236 ms returned []
[2023-03-18 21:43:07] [INFO ] Invariant cache hit.
[2023-03-18 21:43:08] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3735 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin15206255097179654248
[2023-03-18 21:43:08] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2023-03-18 21:43:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:43:08] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2023-03-18 21:43:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:43:08] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2023-03-18 21:43:08] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:43:08] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15206255097179654248
Running compilation step : cd /tmp/ltsmin15206255097179654248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2697 ms.
Running link step : cd /tmp/ltsmin15206255097179654248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin15206255097179654248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8473318817356866173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:43:23] [INFO ] Flatten gal took : 54 ms
[2023-03-18 21:43:23] [INFO ] Flatten gal took : 51 ms
[2023-03-18 21:43:23] [INFO ] Time to serialize gal into /tmp/LTL4788427210257760310.gal : 10 ms
[2023-03-18 21:43:23] [INFO ] Time to serialize properties into /tmp/LTL8760704356060713226.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4788427210257760310.gal' '-t' 'CGAL' '-hoa' '/tmp/aut898926411595122877.hoa' '-atoms' '/tmp/LTL8760704356060713226.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL8760704356060713226.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut898926411595122877.hoa
Detected timeout of ITS tools.
[2023-03-18 21:43:39] [INFO ] Flatten gal took : 49 ms
[2023-03-18 21:43:39] [INFO ] Flatten gal took : 50 ms
[2023-03-18 21:43:39] [INFO ] Time to serialize gal into /tmp/LTL16433806233301768225.gal : 7 ms
[2023-03-18 21:43:39] [INFO ] Time to serialize properties into /tmp/LTL3295447074339146201.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16433806233301768225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3295447074339146201.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
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.
[2023-03-18 21:43:54] [INFO ] Flatten gal took : 88 ms
[2023-03-18 21:43:54] [INFO ] Applying decomposition
[2023-03-18 21:43:54] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9602967627907110272.txt' '-o' '/tmp/graph9602967627907110272.bin' '-w' '/tmp/graph9602967627907110272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9602967627907110272.bin' '-l' '-1' '-v' '-w' '/tmp/graph9602967627907110272.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:43:54] [INFO ] Decomposing Gal with order
[2023-03-18 21:43:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:43:54] [INFO ] Removed a total of 635 redundant transitions.
[2023-03-18 21:43:54] [INFO ] Flatten gal took : 157 ms
[2023-03-18 21:43:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 604 labels/synchronizations in 88 ms.
[2023-03-18 21:43:55] [INFO ] Time to serialize gal into /tmp/LTL15048483115233599670.gal : 15 ms
[2023-03-18 21:43:55] [INFO ] Time to serialize properties into /tmp/LTL12339536386874547788.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15048483115233599670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12339536386874547788.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G((F("(i12.i1.u117.p326==0)"))&&(F(G(!("(((i3.i0.u32.p88==1)&&(i3.i0.u35.p96==1))&&(i3.i0.u36.p102==1))"))))))U("((i30.i1.u271.p75...188
Formula 0 simplified : F(G!"(i12.i1.u117.p326==0)" | GF"(((i3.i0.u32.p88==1)&&(i3.i0.u35.p96==1))&&(i3.i0.u36.p102==1))") R !"((i30.i1.u271.p754==1)&&(i30....173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9480250655851283529
[2023-03-18 21:44:10] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9480250655851283529
Running compilation step : cd /tmp/ltsmin9480250655851283529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1954 ms.
Running link step : cd /tmp/ltsmin9480250655851283529;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin9480250655851283529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((<>((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 146440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&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 15 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-18 21:44:25] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-18 21:44:26] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-18 21:44:26] [INFO ] Invariant cache hit.
[2023-03-18 21:44:28] [INFO ] Implicit Places using invariants and state equation in 1804 ms returned []
Implicit Place search using SMT with State Equation took 2621 ms to find 0 implicit places.
[2023-03-18 21:44:28] [INFO ] Invariant cache hit.
[2023-03-18 21:44:28] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3322 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 745 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 83 reset in 1074 ms.
Product exploration explored 100000 steps with 99 reset in 1125 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 p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1692 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 593 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 293 ms. (steps per millisecond=34 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:44:34] [INFO ] Invariant cache hit.
[2023-03-18 21:44:34] [INFO ] [Real]Absence check using 361 positive place invariants in 105 ms returned sat
[2023-03-18 21:44:35] [INFO ] After 1375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:44:36] [INFO ] [Nat]Absence check using 361 positive place invariants in 53 ms returned sat
[2023-03-18 21:44:37] [INFO ] After 1289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:44:37] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2023-03-18 21:44:37] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-18 21:44:38] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2023-03-18 21:44:38] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-03-18 21:44:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 762 ms
[2023-03-18 21:44:38] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 14 ms to minimize.
[2023-03-18 21:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-18 21:44:39] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2023-03-18 21:44:39] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-18 21:44:39] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-03-18 21:44:39] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2023-03-18 21:44:39] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-18 21:44:39] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2023-03-18 21:44:40] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-18 21:44:40] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2023-03-18 21:44:40] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-03-18 21:44:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1432 ms
[2023-03-18 21:44:40] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2023-03-18 21:44:41] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2023-03-18 21:44:41] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2023-03-18 21:44:41] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2023-03-18 21:44:41] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-18 21:44:41] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2023-03-18 21:44:42] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-18 21:44:42] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2023-03-18 21:44:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1721 ms
[2023-03-18 21:44:42] [INFO ] After 6165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 524 ms.
[2023-03-18 21:44:43] [INFO ] After 7072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 573 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 3 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 90 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 90 ms. Remains : 1001/1003 places, 961/963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) 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 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-18 21:44:44] [INFO ] Computed 361 place invariants in 40 ms
[2023-03-18 21:44:44] [INFO ] [Real]Absence check using 359 positive place invariants in 125 ms returned sat
[2023-03-18 21:44:44] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 21:44:45] [INFO ] After 1196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:44:45] [INFO ] [Nat]Absence check using 359 positive place invariants in 109 ms returned sat
[2023-03-18 21:44:45] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 31 ms returned sat
[2023-03-18 21:44:47] [INFO ] After 1791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:44:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:44:48] [INFO ] After 525ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:44:48] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2023-03-18 21:44:48] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-18 21:44:49] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 1 ms to minimize.
[2023-03-18 21:44:49] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-18 21:44:49] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 0 ms to minimize.
[2023-03-18 21:44:50] [INFO ] Deduced a trap composed of 23 places in 398 ms of which 1 ms to minimize.
[2023-03-18 21:44:50] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2023-03-18 21:44:50] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2023-03-18 21:44:51] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2023-03-18 21:44:51] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2023-03-18 21:44:51] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 12 ms to minimize.
[2023-03-18 21:44:51] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-18 21:44:51] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2023-03-18 21:44:51] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-18 21:44:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3462 ms
[2023-03-18 21:44:52] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 1 ms to minimize.
[2023-03-18 21:44:52] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 0 ms to minimize.
[2023-03-18 21:44:53] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 16 ms to minimize.
[2023-03-18 21:44:53] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-18 21:44:53] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 40 ms to minimize.
[2023-03-18 21:44:53] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2023-03-18 21:44:54] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-18 21:44:54] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-18 21:44:54] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 4 ms to minimize.
[2023-03-18 21:44:54] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-18 21:44:54] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2023-03-18 21:44:54] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2023-03-18 21:44:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2525 ms
[2023-03-18 21:44:54] [INFO ] After 7097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-18 21:44:55] [INFO ] After 9740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 302 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 35 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 36 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 104748 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104748 steps, saw 97759 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:44:58] [INFO ] Invariant cache hit.
[2023-03-18 21:44:59] [INFO ] [Real]Absence check using 359 positive place invariants in 135 ms returned sat
[2023-03-18 21:44:59] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 21:44:59] [INFO ] After 1123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:45:00] [INFO ] [Nat]Absence check using 359 positive place invariants in 155 ms returned sat
[2023-03-18 21:45:00] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-18 21:45:01] [INFO ] After 1084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:45:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:45:01] [INFO ] After 306ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:45:02] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2023-03-18 21:45:02] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-18 21:45:02] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 0 ms to minimize.
[2023-03-18 21:45:02] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 6 ms to minimize.
[2023-03-18 21:45:02] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-03-18 21:45:02] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-18 21:45:02] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-18 21:45:03] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-18 21:45:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1290 ms
[2023-03-18 21:45:03] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2023-03-18 21:45:03] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-18 21:45:03] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2023-03-18 21:45:04] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-18 21:45:04] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-18 21:45:04] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2023-03-18 21:45:04] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2023-03-18 21:45:05] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2023-03-18 21:45:05] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 0 ms to minimize.
[2023-03-18 21:45:05] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-18 21:45:05] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-18 21:45:05] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-18 21:45:06] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 1 ms to minimize.
[2023-03-18 21:45:06] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2023-03-18 21:45:06] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-18 21:45:06] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-03-18 21:45:06] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-18 21:45:06] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3502 ms
[2023-03-18 21:45:06] [INFO ] After 5289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 253 ms.
[2023-03-18 21:45:07] [INFO ] After 7115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 298 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 39 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 39 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 21 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-18 21:45:07] [INFO ] Invariant cache hit.
[2023-03-18 21:45:08] [INFO ] Implicit Places using invariants in 897 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 898 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 18 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 964 ms. Remains : 1000/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) 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
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
Interrupted probabilistic random walk after 126641 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126641 steps, saw 118117 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-18 21:45:11] [INFO ] Computed 360 place invariants in 24 ms
[2023-03-18 21:45:11] [INFO ] [Real]Absence check using 358 positive place invariants in 93 ms returned sat
[2023-03-18 21:45:11] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:45:12] [INFO ] After 1242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:45:13] [INFO ] [Nat]Absence check using 358 positive place invariants in 123 ms returned sat
[2023-03-18 21:45:13] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 21:45:15] [INFO ] After 1842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:45:15] [INFO ] Deduced a trap composed of 9 places in 475 ms of which 0 ms to minimize.
[2023-03-18 21:45:16] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 1 ms to minimize.
[2023-03-18 21:45:16] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2023-03-18 21:45:16] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 13 ms to minimize.
[2023-03-18 21:45:16] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2023-03-18 21:45:17] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2023-03-18 21:45:17] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2023-03-18 21:45:17] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 0 ms to minimize.
[2023-03-18 21:45:17] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2023-03-18 21:45:18] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2023-03-18 21:45:18] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-18 21:45:18] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-18 21:45:18] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-18 21:45:18] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2023-03-18 21:45:18] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3538 ms
[2023-03-18 21:45:19] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2023-03-18 21:45:19] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-18 21:45:19] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-18 21:45:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 601 ms
[2023-03-18 21:45:19] [INFO ] After 6214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 661 ms.
[2023-03-18 21:45:20] [INFO ] After 7356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 174 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 19 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 19 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 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-18 21:45:20] [INFO ] Invariant cache hit.
[2023-03-18 21:45:21] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2023-03-18 21:45:21] [INFO ] Invariant cache hit.
[2023-03-18 21:45:24] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned []
Implicit Place search using SMT with State Equation took 4024 ms to find 0 implicit places.
[2023-03-18 21:45:24] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 21:45:24] [INFO ] Invariant cache hit.
[2023-03-18 21:45:25] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4780 ms. Remains : 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.
Running SMT prover for 2 properties.
[2023-03-18 21:45:25] [INFO ] Invariant cache hit.
[2023-03-18 21:45:25] [INFO ] [Real]Absence check using 358 positive place invariants in 99 ms returned sat
[2023-03-18 21:45:25] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:45:26] [INFO ] After 1148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:45:26] [INFO ] [Nat]Absence check using 358 positive place invariants in 72 ms returned sat
[2023-03-18 21:45:26] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-18 21:45:27] [INFO ] After 903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:45:28] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-18 21:45:28] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-18 21:45:28] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2023-03-18 21:45:28] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-18 21:45:29] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-18 21:45:29] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-18 21:45:29] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-18 21:45:29] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-18 21:45:29] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-18 21:45:29] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-18 21:45:30] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-18 21:45:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1995 ms
[2023-03-18 21:45:30] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2023-03-18 21:45:30] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-18 21:45:30] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2023-03-18 21:45:31] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-03-18 21:45:31] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-18 21:45:31] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2023-03-18 21:45:31] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-18 21:45:31] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2023-03-18 21:45:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1532 ms
[2023-03-18 21:45:31] [INFO ] After 5108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1036 ms.
[2023-03-18 21:45:32] [INFO ] After 6488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2 p0)), (F p0), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 17 factoid took 1528 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 518 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 388 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 13 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-18 21:45:35] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-18 21:45:36] [INFO ] Implicit Places using invariants in 923 ms returned []
[2023-03-18 21:45:36] [INFO ] Invariant cache hit.
[2023-03-18 21:45:39] [INFO ] Implicit Places using invariants and state equation in 2668 ms returned []
Implicit Place search using SMT with State Equation took 3592 ms to find 0 implicit places.
[2023-03-18 21:45:39] [INFO ] Invariant cache hit.
[2023-03-18 21:45:39] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4206 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 p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 999 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 531 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 335 ms. (steps per millisecond=29 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:45:41] [INFO ] Invariant cache hit.
[2023-03-18 21:45:42] [INFO ] [Real]Absence check using 361 positive place invariants in 63 ms returned sat
[2023-03-18 21:45:43] [INFO ] After 1268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:45:43] [INFO ] [Nat]Absence check using 361 positive place invariants in 73 ms returned sat
[2023-03-18 21:45:45] [INFO ] After 2377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:45:46] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 1 ms to minimize.
[2023-03-18 21:45:46] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-03-18 21:45:46] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-18 21:45:46] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 0 ms to minimize.
[2023-03-18 21:45:46] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2023-03-18 21:45:47] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 0 ms to minimize.
[2023-03-18 21:45:47] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2023-03-18 21:45:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1531 ms
[2023-03-18 21:45:47] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2023-03-18 21:45:47] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2023-03-18 21:45:48] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2023-03-18 21:45:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 510 ms
[2023-03-18 21:45:48] [INFO ] After 4962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 986 ms.
[2023-03-18 21:45:49] [INFO ] After 6358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 537 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 3 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 68 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 68 ms. Remains : 1001/1003 places, 961/963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-18 21:45:50] [INFO ] Computed 361 place invariants in 12 ms
[2023-03-18 21:45:50] [INFO ] [Real]Absence check using 359 positive place invariants in 122 ms returned sat
[2023-03-18 21:45:50] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:45:51] [INFO ] After 1411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:45:52] [INFO ] [Nat]Absence check using 359 positive place invariants in 125 ms returned sat
[2023-03-18 21:45:52] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 21:45:53] [INFO ] After 1209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:45:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:45:54] [INFO ] After 718ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:45:55] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 5 ms to minimize.
[2023-03-18 21:45:59] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 1 ms to minimize.
[2023-03-18 21:46:00] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2023-03-18 21:46:00] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-18 21:46:00] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2023-03-18 21:46:00] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2023-03-18 21:46:02] [INFO ] Deduced a trap composed of 9 places in 1277 ms of which 1 ms to minimize.
[2023-03-18 21:46:03] [INFO ] Deduced a trap composed of 9 places in 781 ms of which 1 ms to minimize.
[2023-03-18 21:46:03] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-18 21:46:03] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2023-03-18 21:46:04] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 1 ms to minimize.
[2023-03-18 21:46:04] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 0 ms to minimize.
[2023-03-18 21:46:04] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-18 21:46:04] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2023-03-18 21:46:05] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-18 21:46:05] [INFO ] Deduced a trap composed of 15 places in 364 ms of which 1 ms to minimize.
[2023-03-18 21:46:06] [INFO ] Deduced a trap composed of 15 places in 473 ms of which 0 ms to minimize.
[2023-03-18 21:46:06] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2023-03-18 21:46:06] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 1 ms to minimize.
[2023-03-18 21:46:06] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 0 ms to minimize.
[2023-03-18 21:46:07] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 0 ms to minimize.
[2023-03-18 21:46:07] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2023-03-18 21:46:07] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 12379 ms
[2023-03-18 21:46:08] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2023-03-18 21:46:08] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-18 21:46:08] [INFO ] Deduced a trap composed of 19 places in 437 ms of which 1 ms to minimize.
[2023-03-18 21:46:08] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 0 ms to minimize.
[2023-03-18 21:46:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1166 ms
[2023-03-18 21:46:08] [INFO ] After 15607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 606 ms.
[2023-03-18 21:46:09] [INFO ] After 17855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 286 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 243 ms. (steps per millisecond=41 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:46:10] [INFO ] Invariant cache hit.
[2023-03-18 21:46:10] [INFO ] [Real]Absence check using 359 positive place invariants in 159 ms returned sat
[2023-03-18 21:46:10] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:46:11] [INFO ] After 1171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:46:11] [INFO ] [Nat]Absence check using 359 positive place invariants in 105 ms returned sat
[2023-03-18 21:46:11] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 21:46:12] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:46:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:46:13] [INFO ] After 639ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:46:13] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 1 ms to minimize.
[2023-03-18 21:46:14] [INFO ] Deduced a trap composed of 9 places in 380 ms of which 1 ms to minimize.
[2023-03-18 21:46:14] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 1 ms to minimize.
[2023-03-18 21:46:14] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-18 21:46:15] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-18 21:46:15] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2023-03-18 21:46:15] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2023-03-18 21:46:15] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-18 21:46:15] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2023-03-18 21:46:15] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2023-03-18 21:46:16] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-18 21:46:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2753 ms
[2023-03-18 21:46:16] [INFO ] After 3479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1110 ms.
[2023-03-18 21:46:17] [INFO ] After 5846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 109 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 19 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 31 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) 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
Interrupted probabilistic random walk after 168543 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168543 steps, saw 145846 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:46:20] [INFO ] Invariant cache hit.
[2023-03-18 21:46:20] [INFO ] [Real]Absence check using 359 positive place invariants in 160 ms returned sat
[2023-03-18 21:46:20] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-18 21:46:21] [INFO ] After 936ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:46:21] [INFO ] [Nat]Absence check using 359 positive place invariants in 61 ms returned sat
[2023-03-18 21:46:21] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:46:22] [INFO ] After 876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:46:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:46:23] [INFO ] After 642ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:46:23] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-18 21:46:23] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-18 21:46:24] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 3 ms to minimize.
[2023-03-18 21:46:24] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 0 ms to minimize.
[2023-03-18 21:46:24] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-18 21:46:25] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2023-03-18 21:46:25] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-18 21:46:25] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-18 21:46:25] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2023-03-18 21:46:25] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2023-03-18 21:46:26] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-18 21:46:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2790 ms
[2023-03-18 21:46:26] [INFO ] After 3497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1075 ms.
[2023-03-18 21:46:27] [INFO ] After 5749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 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 37 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 37 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 32 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-18 21:46:27] [INFO ] Invariant cache hit.
[2023-03-18 21:46:28] [INFO ] Implicit Places using invariants in 799 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 802 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 22 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 869 ms. Remains : 1000/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 181852 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181852 steps, saw 153405 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-18 21:46:31] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-18 21:46:31] [INFO ] [Real]Absence check using 358 positive place invariants in 53 ms returned sat
[2023-03-18 21:46:31] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-18 21:46:32] [INFO ] After 1127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:46:32] [INFO ] [Nat]Absence check using 358 positive place invariants in 205 ms returned sat
[2023-03-18 21:46:32] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-18 21:46:34] [INFO ] After 1194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:46:35] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-18 21:46:35] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-18 21:46:35] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-18 21:46:35] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2023-03-18 21:46:35] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2023-03-18 21:46:35] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-18 21:46:36] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-03-18 21:46:36] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-18 21:46:37] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
[2023-03-18 21:46:37] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-18 21:46:37] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2023-03-18 21:46:37] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2023-03-18 21:46:38] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-18 21:46:38] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 0 ms to minimize.
[2023-03-18 21:46:38] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2023-03-18 21:46:38] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2023-03-18 21:46:39] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2023-03-18 21:46:39] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-18 21:46:39] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
[2023-03-18 21:46:39] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2023-03-18 21:46:39] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2023-03-18 21:46:40] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-18 21:46:40] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-18 21:46:40] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2023-03-18 21:46:40] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-18 21:46:40] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5796 ms
[2023-03-18 21:46:40] [INFO ] After 7632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 462 ms.
[2023-03-18 21:46:41] [INFO ] After 8566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 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 21 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 21 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 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-18 21:46:41] [INFO ] Invariant cache hit.
[2023-03-18 21:46:42] [INFO ] Implicit Places using invariants in 1029 ms returned []
[2023-03-18 21:46:42] [INFO ] Invariant cache hit.
[2023-03-18 21:46:44] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 3155 ms to find 0 implicit places.
[2023-03-18 21:46:44] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 21:46:44] [INFO ] Invariant cache hit.
[2023-03-18 21:46:45] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3786 ms. Remains : 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.
Running SMT prover for 1 properties.
[2023-03-18 21:46:45] [INFO ] Invariant cache hit.
[2023-03-18 21:46:45] [INFO ] [Real]Absence check using 358 positive place invariants in 103 ms returned sat
[2023-03-18 21:46:45] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:46:46] [INFO ] After 1210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:46:46] [INFO ] [Nat]Absence check using 358 positive place invariants in 256 ms returned sat
[2023-03-18 21:46:46] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 21:46:47] [INFO ] After 1152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:46:48] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 14 ms to minimize.
[2023-03-18 21:46:48] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-18 21:46:48] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 1 ms to minimize.
[2023-03-18 21:46:49] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 0 ms to minimize.
[2023-03-18 21:46:49] [INFO ] Deduced a trap composed of 15 places in 363 ms of which 0 ms to minimize.
[2023-03-18 21:46:49] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2023-03-18 21:46:49] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-18 21:46:50] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2023-03-18 21:46:50] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2023-03-18 21:46:50] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-18 21:46:50] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-18 21:46:50] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 13 ms to minimize.
[2023-03-18 21:46:50] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2023-03-18 21:46:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3051 ms
[2023-03-18 21:46:51] [INFO ] After 4266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-18 21:46:51] [INFO ] After 4951ms 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 p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
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 1493 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 377 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 483 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 510 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 100 reset in 992 ms.
Product exploration explored 100000 steps with 91 reset in 1178 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 493 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 2 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 1 ms
Applied a total of 2 rules in 69 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-18 21:46:57] [INFO ] Redundant transitions in 124 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
[2023-03-18 21:46:57] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-18 21:46:57] [INFO ] Dead Transitions using invariants and state equation in 658 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 1 ms
Applied a total of 0 rules in 18 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 908 ms. Remains : 1003/1003 places, 962/963 transitions.
Built C files in :
/tmp/ltsmin5632304637134641187
[2023-03-18 21:46:57] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5632304637134641187
Running compilation step : cd /tmp/ltsmin5632304637134641187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1738 ms.
Running link step : cd /tmp/ltsmin5632304637134641187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5632304637134641187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5000565242980171143.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 21 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-18 21:47:12] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-18 21:47:13] [INFO ] Implicit Places using invariants in 770 ms returned []
[2023-03-18 21:47:13] [INFO ] Invariant cache hit.
[2023-03-18 21:47:15] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2371 ms to find 0 implicit places.
[2023-03-18 21:47:15] [INFO ] Invariant cache hit.
[2023-03-18 21:47:16] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3181 ms. Remains : 1003/1003 places, 963/963 transitions.
Built C files in :
/tmp/ltsmin13097171085966139922
[2023-03-18 21:47:16] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13097171085966139922
Running compilation step : cd /tmp/ltsmin13097171085966139922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1958 ms.
Running link step : cd /tmp/ltsmin13097171085966139922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin13097171085966139922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13485311777432781767.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:47:31] [INFO ] Flatten gal took : 99 ms
[2023-03-18 21:47:31] [INFO ] Flatten gal took : 45 ms
[2023-03-18 21:47:31] [INFO ] Time to serialize gal into /tmp/LTL2455356823286450051.gal : 7 ms
[2023-03-18 21:47:31] [INFO ] Time to serialize properties into /tmp/LTL14101322117110318130.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2455356823286450051.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2913474257113398361.hoa' '-atoms' '/tmp/LTL14101322117110318130.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14101322117110318130.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2913474257113398361.hoa
Detected timeout of ITS tools.
[2023-03-18 21:47:46] [INFO ] Flatten gal took : 41 ms
[2023-03-18 21:47:46] [INFO ] Flatten gal took : 47 ms
[2023-03-18 21:47:46] [INFO ] Time to serialize gal into /tmp/LTL16874035647754687379.gal : 5 ms
[2023-03-18 21:47:46] [INFO ] Time to serialize properties into /tmp/LTL3214380530119068381.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16874035647754687379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3214380530119068381.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...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.
[2023-03-18 21:48:01] [INFO ] Flatten gal took : 125 ms
[2023-03-18 21:48:01] [INFO ] Applying decomposition
[2023-03-18 21:48:01] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2395538614827223595.txt' '-o' '/tmp/graph2395538614827223595.bin' '-w' '/tmp/graph2395538614827223595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2395538614827223595.bin' '-l' '-1' '-v' '-w' '/tmp/graph2395538614827223595.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:48:02] [INFO ] Decomposing Gal with order
[2023-03-18 21:48:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:48:02] [INFO ] Removed a total of 640 redundant transitions.
[2023-03-18 21:48:02] [INFO ] Flatten gal took : 79 ms
[2023-03-18 21:48:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 612 labels/synchronizations in 82 ms.
[2023-03-18 21:48:02] [INFO ] Time to serialize gal into /tmp/LTL15798255680263410727.gal : 12 ms
[2023-03-18 21:48:02] [INFO ] Time to serialize properties into /tmp/LTL18118422336742899160.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15798255680263410727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18118422336742899160.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("(((i4.i1.u41.p113==1)&&(i4.i1.u44.p123==1))&&(i4.i1.u45.p127==1))"))U(((G(!("((i33.i1.u300.p833==1)&&(i33.i1.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/ltsmin8886060479825030275
[2023-03-18 21:48:17] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8886060479825030275
Running compilation step : cd /tmp/ltsmin8886060479825030275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1882 ms.
Running link step : cd /tmp/ltsmin8886060479825030275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8886060479825030275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((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 247128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 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 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 3 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 80 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-18 21:48:32] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-18 21:48:33] [INFO ] Implicit Places using invariants in 844 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 859 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 960 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 130 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 1112 ms.
Product exploration explored 100000 steps with 52 reset in 1120 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 170 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 134 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1827 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=55 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 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 123 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 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 43 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-18 21:48:36] [INFO ] Computed 360 place invariants in 7 ms
[2023-03-18 21:48:37] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-18 21:48:37] [INFO ] Invariant cache hit.
[2023-03-18 21:48:38] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2191 ms to find 0 implicit places.
[2023-03-18 21:48:39] [INFO ] Redundant transitions in 320 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
[2023-03-18 21:48:39] [INFO ] Computed 360 place invariants in 7 ms
[2023-03-18 21:48:39] [INFO ] Dead Transitions using invariants and state equation in 785 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 21 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 3389 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 192 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 107 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1822 steps, including 0 resets, run visited all 1 properties in 35 ms. (steps per millisecond=52 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 269 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 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 52 reset in 1163 ms.
Product exploration explored 100000 steps with 52 reset in 1178 ms.
Built C files in :
/tmp/ltsmin14319549193439468741
[2023-03-18 21:48:43] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2023-03-18 21:48:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:48:43] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2023-03-18 21:48:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:48:43] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2023-03-18 21:48:43] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:48:43] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14319549193439468741
Running compilation step : cd /tmp/ltsmin14319549193439468741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14319549193439468741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14319549193439468741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 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 41 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-18 21:48:46] [INFO ] Invariant cache hit.
[2023-03-18 21:48:47] [INFO ] Implicit Places using invariants in 720 ms returned []
[2023-03-18 21:48:47] [INFO ] Invariant cache hit.
[2023-03-18 21:48:48] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
[2023-03-18 21:48:48] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-18 21:48:48] [INFO ] Invariant cache hit.
[2023-03-18 21:48:49] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2882 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin17871659410313184424
[2023-03-18 21:48:49] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2023-03-18 21:48:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:48:49] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2023-03-18 21:48:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:48:49] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2023-03-18 21:48:49] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:48:49] [INFO ] Built C files in 237ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17871659410313184424
Running compilation step : cd /tmp/ltsmin17871659410313184424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2804 ms.
Running link step : cd /tmp/ltsmin17871659410313184424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin17871659410313184424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15232462344003093810.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:49:04] [INFO ] Flatten gal took : 44 ms
[2023-03-18 21:49:04] [INFO ] Flatten gal took : 43 ms
[2023-03-18 21:49:04] [INFO ] Time to serialize gal into /tmp/LTL3012671961519519425.gal : 6 ms
[2023-03-18 21:49:04] [INFO ] Time to serialize properties into /tmp/LTL9532166703366333885.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3012671961519519425.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10688811255427240731.hoa' '-atoms' '/tmp/LTL9532166703366333885.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9532166703366333885.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10688811255427240731.hoa
Detected timeout of ITS tools.
[2023-03-18 21:49:19] [INFO ] Flatten gal took : 68 ms
[2023-03-18 21:49:19] [INFO ] Flatten gal took : 113 ms
[2023-03-18 21:49:19] [INFO ] Time to serialize gal into /tmp/LTL3205882751277580404.gal : 20 ms
[2023-03-18 21:49:19] [INFO ] Time to serialize properties into /tmp/LTL16923355526877197534.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3205882751277580404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16923355526877197534.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
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.
[2023-03-18 21:49:34] [INFO ] Flatten gal took : 69 ms
[2023-03-18 21:49:34] [INFO ] Applying decomposition
[2023-03-18 21:49:34] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11739824507195394807.txt' '-o' '/tmp/graph11739824507195394807.bin' '-w' '/tmp/graph11739824507195394807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11739824507195394807.bin' '-l' '-1' '-v' '-w' '/tmp/graph11739824507195394807.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:49:35] [INFO ] Decomposing Gal with order
[2023-03-18 21:49:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:49:35] [INFO ] Removed a total of 635 redundant transitions.
[2023-03-18 21:49:35] [INFO ] Flatten gal took : 63 ms
[2023-03-18 21:49:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 39 ms.
[2023-03-18 21:49:35] [INFO ] Time to serialize gal into /tmp/LTL18038161341889132603.gal : 12 ms
[2023-03-18 21:49:35] [INFO ] Time to serialize properties into /tmp/LTL17203123194195278341.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18038161341889132603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17203123194195278341.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i1.u6.p14==0)||(i1.i0.u13.p35==0))"))))
Formula 0 simplified : FG!"((i0.i1.u6.p14==0)||(i1.i0.u13.p35==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1549268369866412591
[2023-03-18 21:49:50] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1549268369866412591
Running compilation step : cd /tmp/ltsmin1549268369866412591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1766 ms.
Running link step : cd /tmp/ltsmin1549268369866412591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1549268369866412591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((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 93033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(!p1)))) U p2))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&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 622 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 5 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 4 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 88 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-18 21:50:06] [INFO ] Computed 361 place invariants in 8 ms
[2023-03-18 21:50:07] [INFO ] Implicit Places using invariants in 872 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 874 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 980 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 99 reset in 889 ms.
Product exploration explored 100000 steps with 95 reset in 1130 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 p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1215 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 663 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 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-18 21:50:12] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-18 21:50:12] [INFO ] [Real]Absence check using 360 positive place invariants in 61 ms returned sat
[2023-03-18 21:50:13] [INFO ] After 1279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:50:14] [INFO ] [Nat]Absence check using 360 positive place invariants in 90 ms returned sat
[2023-03-18 21:50:17] [INFO ] After 2954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:50:17] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-18 21:50:17] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-03-18 21:50:17] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-18 21:50:17] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-18 21:50:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 685 ms
[2023-03-18 21:50:18] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-18 21:50:18] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-18 21:50:18] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2023-03-18 21:50:19] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 0 ms to minimize.
[2023-03-18 21:50:19] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-18 21:50:19] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-18 21:50:19] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-18 21:50:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1512 ms
[2023-03-18 21:50:20] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-18 21:50:20] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-18 21:50:20] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2023-03-18 21:50:20] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2023-03-18 21:50:20] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 13 ms to minimize.
[2023-03-18 21:50:21] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 13 ms to minimize.
[2023-03-18 21:50:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1061 ms
[2023-03-18 21:50:21] [INFO ] After 6865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 450 ms.
[2023-03-18 21:50:21] [INFO ] After 7883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 495 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 36 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 36 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-18 21:50:22] [INFO ] Computed 360 place invariants in 8 ms
[2023-03-18 21:50:22] [INFO ] [Real]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-18 21:50:22] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 21:50:23] [INFO ] After 772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:50:23] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2023-03-18 21:50:23] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:50:25] [INFO ] After 1663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:50:25] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2023-03-18 21:50:25] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 0 ms to minimize.
[2023-03-18 21:50:25] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2023-03-18 21:50:26] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-18 21:50:26] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 4 ms to minimize.
[2023-03-18 21:50:26] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 26 ms to minimize.
[2023-03-18 21:50:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1201 ms
[2023-03-18 21:50:26] [INFO ] After 2978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-03-18 21:50:26] [INFO ] After 3522ms 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 22 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 34 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 171946 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171946 steps, saw 147916 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:50:30] [INFO ] Invariant cache hit.
[2023-03-18 21:50:30] [INFO ] [Real]Absence check using 358 positive place invariants in 110 ms returned sat
[2023-03-18 21:50:30] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:50:31] [INFO ] After 1256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:50:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 64 ms returned sat
[2023-03-18 21:50:31] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:50:32] [INFO ] After 1109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:50:33] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:50:33] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-18 21:50:33] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2023-03-18 21:50:33] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 0 ms to minimize.
[2023-03-18 21:50:34] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-18 21:50:34] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-18 21:50:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1446 ms
[2023-03-18 21:50:34] [INFO ] After 2699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 508 ms.
[2023-03-18 21:50:34] [INFO ] After 3494ms 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 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 76 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 77 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 30 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-18 21:50:35] [INFO ] Invariant cache hit.
[2023-03-18 21:50:35] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-18 21:50:35] [INFO ] Invariant cache hit.
[2023-03-18 21:50:37] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 2754 ms to find 0 implicit places.
[2023-03-18 21:50:37] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-18 21:50:37] [INFO ] Invariant cache hit.
[2023-03-18 21:50:38] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3654 ms. Remains : 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.
Running SMT prover for 1 properties.
[2023-03-18 21:50:38] [INFO ] Invariant cache hit.
[2023-03-18 21:50:38] [INFO ] [Real]Absence check using 358 positive place invariants in 50 ms returned sat
[2023-03-18 21:50:38] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:50:39] [INFO ] After 817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:50:39] [INFO ] [Nat]Absence check using 358 positive place invariants in 69 ms returned sat
[2023-03-18 21:50:39] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-18 21:50:41] [INFO ] After 1270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:50:41] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-18 21:50:41] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2023-03-18 21:50:41] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2023-03-18 21:50:41] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-18 21:50:42] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-18 21:50:42] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-18 21:50:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1324 ms
[2023-03-18 21:50:42] [INFO ] After 2702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 529 ms.
[2023-03-18 21:50:43] [INFO ] After 3556ms 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 p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2 p0)), (F p0), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 17 factoid took 2069 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 568 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 562 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 29 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-18 21:50:46] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-18 21:50:47] [INFO ] Implicit Places using invariants in 907 ms returned []
[2023-03-18 21:50:47] [INFO ] Invariant cache hit.
[2023-03-18 21:50:49] [INFO ] Implicit Places using invariants and state equation in 2593 ms returned []
Implicit Place search using SMT with State Equation took 3504 ms to find 0 implicit places.
[2023-03-18 21:50:49] [INFO ] Invariant cache hit.
[2023-03-18 21:50:50] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4453 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 p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1237 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 622 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 345 ms. (steps per millisecond=28 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:50:53] [INFO ] Invariant cache hit.
[2023-03-18 21:50:53] [INFO ] [Real]Absence check using 360 positive place invariants in 204 ms returned sat
[2023-03-18 21:50:55] [INFO ] After 1792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:50:55] [INFO ] [Nat]Absence check using 360 positive place invariants in 155 ms returned sat
[2023-03-18 21:50:57] [INFO ] After 1411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:50:57] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 23 ms to minimize.
[2023-03-18 21:50:57] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-18 21:50:57] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-18 21:50:58] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2023-03-18 21:50:58] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2023-03-18 21:50:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1231 ms
[2023-03-18 21:50:58] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-18 21:50:58] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2023-03-18 21:50:59] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2023-03-18 21:50:59] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-18 21:50:59] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 15 ms to minimize.
[2023-03-18 21:50:59] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2023-03-18 21:50:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1027 ms
[2023-03-18 21:50:59] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-18 21:51:00] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-18 21:51:00] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2023-03-18 21:51:00] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-03-18 21:51:00] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 0 ms to minimize.
[2023-03-18 21:51:00] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2023-03-18 21:51:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1207 ms
[2023-03-18 21:51:01] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-18 21:51:01] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 0 ms to minimize.
[2023-03-18 21:51:01] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2023-03-18 21:51:01] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2023-03-18 21:51:02] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2023-03-18 21:51:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1101 ms
[2023-03-18 21:51:02] [INFO ] After 6522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 558 ms.
[2023-03-18 21:51:02] [INFO ] After 7595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 446 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 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 4) seen :3
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
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-18 21:51:03] [INFO ] Computed 360 place invariants in 11 ms
[2023-03-18 21:51:03] [INFO ] [Real]Absence check using 358 positive place invariants in 55 ms returned sat
[2023-03-18 21:51:03] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:51:04] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:51:04] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2023-03-18 21:51:04] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:51:05] [INFO ] After 1048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:51:06] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-18 21:51:06] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2023-03-18 21:51:07] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-18 21:51:07] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 1 ms to minimize.
[2023-03-18 21:51:07] [INFO ] Deduced a trap composed of 15 places in 468 ms of which 1 ms to minimize.
[2023-03-18 21:51:08] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-18 21:51:08] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2023-03-18 21:51:08] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-18 21:51:09] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 0 ms to minimize.
[2023-03-18 21:51:09] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 0 ms to minimize.
[2023-03-18 21:51:10] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2023-03-18 21:51:10] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2023-03-18 21:51:10] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-18 21:51:10] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 0 ms to minimize.
[2023-03-18 21:51:11] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 0 ms to minimize.
[2023-03-18 21:51:11] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2023-03-18 21:51:11] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-18 21:51:11] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-18 21:51:12] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 1 ms to minimize.
[2023-03-18 21:51:12] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-18 21:51:12] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2023-03-18 21:51:12] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-18 21:51:12] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2023-03-18 21:51:13] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-18 21:51:13] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-18 21:51:13] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6885 ms
[2023-03-18 21:51:13] [INFO ] After 8692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 427 ms.
[2023-03-18 21:51:13] [INFO ] After 9383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 54 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 46 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 59 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) 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 180339 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180339 steps, saw 152582 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:51:17] [INFO ] Invariant cache hit.
[2023-03-18 21:51:17] [INFO ] [Real]Absence check using 358 positive place invariants in 160 ms returned sat
[2023-03-18 21:51:17] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:51:18] [INFO ] After 1087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:51:18] [INFO ] [Nat]Absence check using 358 positive place invariants in 73 ms returned sat
[2023-03-18 21:51:18] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 21:51:19] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:51:19] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2023-03-18 21:51:20] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2023-03-18 21:51:20] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2023-03-18 21:51:20] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2023-03-18 21:51:20] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2023-03-18 21:51:20] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2023-03-18 21:51:21] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2023-03-18 21:51:21] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-18 21:51:21] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 0 ms to minimize.
[2023-03-18 21:51:21] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-18 21:51:22] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-18 21:51:22] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-18 21:51:22] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2023-03-18 21:51:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3174 ms
[2023-03-18 21:51:22] [INFO ] After 4118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-18 21:51:22] [INFO ] After 4609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 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 17 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.
[2023-03-18 21:51:22] [INFO ] Invariant cache hit.
[2023-03-18 21:51:23] [INFO ] Implicit Places using invariants in 826 ms returned []
[2023-03-18 21:51:23] [INFO ] Invariant cache hit.
[2023-03-18 21:51:25] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 3044 ms to find 0 implicit places.
[2023-03-18 21:51:26] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-18 21:51:26] [INFO ] Invariant cache hit.
[2023-03-18 21:51:26] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3894 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.
[2023-03-18 21:51:26] [INFO ] Invariant cache hit.
[2023-03-18 21:51:27] [INFO ] [Real]Absence check using 358 positive place invariants in 511 ms returned sat
[2023-03-18 21:51:27] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-18 21:51:28] [INFO ] After 1276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:51:28] [INFO ] [Nat]Absence check using 358 positive place invariants in 95 ms returned sat
[2023-03-18 21:51:28] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-18 21:51:29] [INFO ] After 938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:51:29] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2023-03-18 21:51:30] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2023-03-18 21:51:30] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 0 ms to minimize.
[2023-03-18 21:51:30] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2023-03-18 21:51:30] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-18 21:51:31] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2023-03-18 21:51:31] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-18 21:51:31] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 0 ms to minimize.
[2023-03-18 21:51:31] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2023-03-18 21:51:31] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 36 ms to minimize.
[2023-03-18 21:51:32] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-18 21:51:32] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-18 21:51:32] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-18 21:51:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3051 ms
[2023-03-18 21:51:32] [INFO ] After 4075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-18 21:51:32] [INFO ] After 4692ms 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 p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
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 1576 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 736 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 736 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 480 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 86 reset in 1087 ms.
Product exploration explored 100000 steps with 93 reset in 1021 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 556 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 43 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-18 21:51:39] [INFO ] Redundant transitions in 241 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
[2023-03-18 21:51:39] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-18 21:51:40] [INFO ] Dead Transitions using invariants and state equation in 874 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 31 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 1216 ms. Remains : 1000/1000 places, 960/961 transitions.
Built C files in :
/tmp/ltsmin6551062872833272612
[2023-03-18 21:51:40] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6551062872833272612
Running compilation step : cd /tmp/ltsmin6551062872833272612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1817 ms.
Running link step : cd /tmp/ltsmin6551062872833272612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6551062872833272612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1166338310622394822.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 28 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-18 21:51:55] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-18 21:51:56] [INFO ] Implicit Places using invariants in 859 ms returned []
[2023-03-18 21:51:56] [INFO ] Invariant cache hit.
[2023-03-18 21:51:57] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 2452 ms to find 0 implicit places.
[2023-03-18 21:51:58] [INFO ] Invariant cache hit.
[2023-03-18 21:51:58] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3089 ms. Remains : 1000/1000 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin3644069776179270606
[2023-03-18 21:51:58] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3644069776179270606
Running compilation step : cd /tmp/ltsmin3644069776179270606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1885 ms.
Running link step : cd /tmp/ltsmin3644069776179270606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3644069776179270606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9486922589809945897.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:52:13] [INFO ] Flatten gal took : 59 ms
[2023-03-18 21:52:13] [INFO ] Flatten gal took : 39 ms
[2023-03-18 21:52:13] [INFO ] Time to serialize gal into /tmp/LTL2111320362116657418.gal : 5 ms
[2023-03-18 21:52:13] [INFO ] Time to serialize properties into /tmp/LTL15434212005314336173.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2111320362116657418.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6965850157286476747.hoa' '-atoms' '/tmp/LTL15434212005314336173.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15434212005314336173.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6965850157286476747.hoa
Detected timeout of ITS tools.
[2023-03-18 21:52:28] [INFO ] Flatten gal took : 41 ms
[2023-03-18 21:52:29] [INFO ] Flatten gal took : 40 ms
[2023-03-18 21:52:29] [INFO ] Time to serialize gal into /tmp/LTL12842900056811728589.gal : 5 ms
[2023-03-18 21:52:29] [INFO ] Time to serialize properties into /tmp/LTL12725254122641460024.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12842900056811728589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12725254122641460024.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(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.
[2023-03-18 21:52:44] [INFO ] Flatten gal took : 71 ms
[2023-03-18 21:52:44] [INFO ] Applying decomposition
[2023-03-18 21:52:44] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13918886331947652155.txt' '-o' '/tmp/graph13918886331947652155.bin' '-w' '/tmp/graph13918886331947652155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13918886331947652155.bin' '-l' '-1' '-v' '-w' '/tmp/graph13918886331947652155.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:52:44] [INFO ] Decomposing Gal with order
[2023-03-18 21:52:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:52:44] [INFO ] Removed a total of 637 redundant transitions.
[2023-03-18 21:52:44] [INFO ] Flatten gal took : 56 ms
[2023-03-18 21:52:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 42 ms.
[2023-03-18 21:52:44] [INFO ] Time to serialize gal into /tmp/LTL7266491853298093448.gal : 19 ms
[2023-03-18 21:52:44] [INFO ] Time to serialize properties into /tmp/LTL14749504890241349233.ltl : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7266491853298093448.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14749504890241349233.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("(((i4.i2.u41.p113==1)&&(i4.i2.u44.p123==1))&&(i4.i2.u45.p127==1))"))U(((G(!("((i33.i1.u300.p833==1)&&(i33.i1.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/ltsmin7442216376425963582
[2023-03-18 21:52:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7442216376425963582
Running compilation step : cd /tmp/ltsmin7442216376425963582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1906 ms.
Running link step : cd /tmp/ltsmin7442216376425963582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7442216376425963582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((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 188754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-18 21:53:14] [INFO ] Flatten gal took : 82 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7755394588793602386
[2023-03-18 21:53:15] [INFO ] Computing symmetric may disable matrix : 963 transitions.
[2023-03-18 21:53:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:53:15] [INFO ] Computing symmetric may enable matrix : 963 transitions.
[2023-03-18 21:53:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:53:15] [INFO ] Applying decomposition
[2023-03-18 21:53:15] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13574986171841935921.txt' '-o' '/tmp/graph13574986171841935921.bin' '-w' '/tmp/graph13574986171841935921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13574986171841935921.bin' '-l' '-1' '-v' '-w' '/tmp/graph13574986171841935921.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:53:15] [INFO ] Computing Do-Not-Accords matrix : 963 transitions.
[2023-03-18 21:53:15] [INFO ] Decomposing Gal with order
[2023-03-18 21:53:15] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:53:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:53:15] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7755394588793602386
Running compilation step : cd /tmp/ltsmin7755394588793602386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 21:53:15] [INFO ] Removed a total of 640 redundant transitions.
[2023-03-18 21:53:15] [INFO ] Flatten gal took : 63 ms
[2023-03-18 21:53:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 35 ms.
[2023-03-18 21:53:15] [INFO ] Time to serialize gal into /tmp/LTLFireability5658757231522221478.gal : 10 ms
[2023-03-18 21:53:15] [INFO ] Time to serialize properties into /tmp/LTLFireability6056544029362245947.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5658757231522221478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6056544029362245947.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !(((G((F("(i12.i2.u117.p326!=1)"))&&(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!=1)" | GF"(((i3.i1.u32.p88==1)&&(i3.i1.u35.p96==1))&&(i3.i1.u36.p102==1))") R !"((i30.i0.u271.p754==1)&&(i30....173
Compilation finished in 2936 ms.
Running link step : cd /tmp/ltsmin7755394588793602386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin7755394588793602386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>((LTLAPp0==true))&&<>([](!(LTLAPp1==true))))) U (LTLAPp2==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin7755394588793602386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>((LTLAPp0==true))&&<>([](!(LTLAPp1==true))))) U (LTLAPp2==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7755394588793602386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp3==true)&&X((!(LTLAPp3==true) U ([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&[](<>(!(LTLAPp5==true))))||[](!(LTLAPp3==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 22:17:50] [INFO ] Applying decomposition
[2023-03-18 22:17:50] [INFO ] Flatten gal took : 115 ms
[2023-03-18 22:17:50] [INFO ] Decomposing Gal with order
[2023-03-18 22:17:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:17:50] [INFO ] Removed a total of 680 redundant transitions.
[2023-03-18 22:17:50] [INFO ] Flatten gal took : 122 ms
[2023-03-18 22:17:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 79 ms.
[2023-03-18 22:17:51] [INFO ] Time to serialize gal into /tmp/LTLFireability14807173482408185519.gal : 34 ms
[2023-03-18 22:17:51] [INFO ] Time to serialize properties into /tmp/LTLFireability13176939467888717210.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14807173482408185519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13176939467888717210.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !(((G((F("(u131.p326!=1)"))&&(F(G(!("(((u37.p88==1)&&(u40.p96==1))&&(u41.p102==1))"))))))U("((u302.p754==1)&&(u309.p769==1))")))
Formula 0 simplified : F(G!"(u131.p326!=1)" | GF"(((u37.p88==1)&&(u40.p96==1))&&(u41.p102==1))") R !"((u302.p754==1)&&(u309.p769==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.209: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.209: LTL layer: formula: [](<>((!(LTLAPp3==true)&&X((!(LTLAPp3==true) U ([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&[](<>(!(LTLAPp5==true))))||[](!(LTLAPp3==true))))))))
pins2lts-mc-linux64( 7/ 8), 0.209: "[](<>((!(LTLAPp3==true)&&X((!(LTLAPp3==true) U ([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&[](<>(!(LTLAPp5==true))))||[](!(LTLAPp3==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.210: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.274: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.276: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.277: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.275: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.283: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.284: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.306: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.520: There are 971 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.520: State length is 1004, there are 995 groups
pins2lts-mc-linux64( 0/ 8), 0.520: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.520: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.520: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.520: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.656: [Blue] ~120 levels ~960 states ~9064 transitions
pins2lts-mc-linux64( 7/ 8), 0.781: [Blue] ~240 levels ~1920 states ~21720 transitions
pins2lts-mc-linux64( 6/ 8), 1.049: [Blue] ~480 levels ~3840 states ~53688 transitions
pins2lts-mc-linux64( 7/ 8), 1.379: [Blue] ~960 levels ~7680 states ~137752 transitions
pins2lts-mc-linux64( 7/ 8), 1.983: [Blue] ~1913 levels ~15360 states ~286664 transitions
pins2lts-mc-linux64( 7/ 8), 2.594: [Blue] ~1931 levels ~30720 states ~426296 transitions
pins2lts-mc-linux64( 7/ 8), 3.859: [Blue] ~1931 levels ~61440 states ~763496 transitions
pins2lts-mc-linux64( 5/ 8), 6.298: [Blue] ~1965 levels ~122880 states ~541008 transitions
pins2lts-mc-linux64( 5/ 8), 11.153: [Blue] ~1973 levels ~245760 states ~869520 transitions
pins2lts-mc-linux64( 5/ 8), 20.534: [Blue] ~1973 levels ~491520 states ~1584760 transitions
pins2lts-mc-linux64( 5/ 8), 38.913: [Blue] ~1975 levels ~983040 states ~3040088 transitions
pins2lts-mc-linux64( 5/ 8), 75.220: [Blue] ~1975 levels ~1966080 states ~6415640 transitions
pins2lts-mc-linux64( 5/ 8), 148.040: [Blue] ~1975 levels ~3932160 states ~12972800 transitions
pins2lts-mc-linux64( 5/ 8), 292.925: [Blue] ~1975 levels ~7864320 states ~26531552 transitions
pins2lts-mc-linux64( 5/ 8), 583.596: [Blue] ~1975 levels ~15728640 states ~55836064 transitions
pins2lts-mc-linux64( 0/ 8), 1171.871: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1172.000:
pins2lts-mc-linux64( 0/ 8), 1172.000: Explored 28370647 states 404257794 transitions, fanout: 14.249
pins2lts-mc-linux64( 0/ 8), 1172.000: Total exploration time 1171.430 sec (1171.310 sec minimum, 1171.373 sec on average)
pins2lts-mc-linux64( 0/ 8), 1172.000: States per second: 24219, Transitions per second: 345098
pins2lts-mc-linux64( 0/ 8), 1172.000:
pins2lts-mc-linux64( 0/ 8), 1172.000: State space has 28512534 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1172.000: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1172.000: blue states: 28370647 (99.50%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1172.000: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1172.000: all-red states: 3906294 (13.70%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1172.000:
pins2lts-mc-linux64( 0/ 8), 1172.000: Total memory used for local state coloring: 0.2MB
pins2lts-mc-linux64( 0/ 8), 1172.000:
pins2lts-mc-linux64( 0/ 8), 1172.000: Queue width: 8B, total height: 16223, memory: 0.12MB
pins2lts-mc-linux64( 0/ 8), 1172.000: Tree memory: 473.5MB, 17.4 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1172.000: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1172.000: Stored 1061 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1172.000: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1172.000: Est. total memory use: 473.7MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7755394588793602386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp3==true)&&X((!(LTLAPp3==true) U ([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&[](<>(!(LTLAPp5==true))))||[](!(LTLAPp3==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7755394588793602386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp3==true)&&X((!(LTLAPp3==true) U ([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&[](<>(!(LTLAPp5==true))))||[](!(LTLAPp3==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 176188 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16105008 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r389-oct2-167903713200132"
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 ;