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.r393-oct2-167903716600132.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 ltsminxred
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 r393-oct2-167903716600132
=====================================================================

--------------------
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 1679427939171

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:45:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 19:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:45:42] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-21 19:45:42] [INFO ] Transformed 1003 places.
[2023-03-21 19:45:42] [INFO ] Transformed 963 transitions.
[2023-03-21 19:45:42] [INFO ] Found NUPN structural information;
[2023-03-21 19:45:42] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-040A-LTLFireability-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 92 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-21 19:45:43] [INFO ] Computed 361 place invariants in 54 ms
[2023-03-21 19:45:44] [INFO ] Implicit Places using invariants in 1645 ms returned []
[2023-03-21 19:45:44] [INFO ] Invariant cache hit.
[2023-03-21 19:45:47] [INFO ] Implicit Places using invariants and state equation in 2980 ms returned []
Implicit Place search using SMT with State Equation took 4728 ms to find 0 implicit places.
[2023-03-21 19:45:47] [INFO ] Invariant cache hit.
[2023-03-21 19:45:48] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5559 ms. Remains : 1003/1003 places, 963/963 transitions.
Support contains 58 out of 1003 places after structural reductions.
[2023-03-21 19:45:49] [INFO ] Flatten gal took : 200 ms
[2023-03-21 19:45:49] [INFO ] Flatten gal took : 97 ms
[2023-03-21 19:45:49] [INFO ] Input system was already deterministic with 963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:45:50] [INFO ] Invariant cache hit.
[2023-03-21 19:45:50] [INFO ] [Real]Absence check using 361 positive place invariants in 179 ms returned sat
[2023-03-21 19:45:51] [INFO ] After 1696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:45:52] [INFO ] [Nat]Absence check using 361 positive place invariants in 278 ms returned sat
[2023-03-21 19:45:53] [INFO ] After 1023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:45:53] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 62 ms to minimize.
[2023-03-21 19:45:53] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 4 ms to minimize.
[2023-03-21 19:45:54] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 13 ms to minimize.
[2023-03-21 19:45:54] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 13 ms to minimize.
[2023-03-21 19:45:54] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-21 19:45:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1009 ms
[2023-03-21 19:45:54] [INFO ] After 2105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-21 19:45:54] [INFO ] After 2861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 66 ms.
Support contains 3 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 12 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
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 281 place count 1000 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 282 place count 999 transition count 960
Applied a total of 282 rules in 389 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 999/1003 places, 960/963 transitions.
Finished random walk after 7870 steps, including 2 resets, run visited all 1 properties in 96 ms. (steps per millisecond=81 )
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 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 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 120 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:45:56] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-21 19:45:57] [INFO ] Implicit Places using invariants in 1236 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1249 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 44 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 1414 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 268 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 2061 steps with 0 reset in 36 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-00 finished in 1857 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 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 96 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2023-03-21 19:45:57] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:45:59] [INFO ] Implicit Places using invariants in 1898 ms returned []
[2023-03-21 19:45:59] [INFO ] Invariant cache hit.
[2023-03-21 19:46:02] [INFO ] Implicit Places using invariants and state equation in 2287 ms returned []
Implicit Place search using SMT with State Equation took 4226 ms to find 0 implicit places.
[2023-03-21 19:46:02] [INFO ] Redundant transitions in 414 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-21 19:46:02] [INFO ] Computed 360 place invariants in 24 ms
[2023-03-21 19:46:03] [INFO ] Dead Transitions using invariants and state equation in 1314 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 30 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 6126 ms. Remains : 999/1003 places, 959/963 transitions.
Stuttering acceptance computed with spot in 62 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 2005 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 6242 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 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-21 19:46:03] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-21 19:46:04] [INFO ] Implicit Places using invariants in 824 ms returned []
[2023-03-21 19:46:04] [INFO ] Invariant cache hit.
[2023-03-21 19:46:07] [INFO ] Implicit Places using invariants and state equation in 2893 ms returned []
Implicit Place search using SMT with State Equation took 3719 ms to find 0 implicit places.
[2023-03-21 19:46:07] [INFO ] Invariant cache hit.
[2023-03-21 19:46:08] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4694 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 146 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 74071 steps with 72 reset in 647 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-05 finished in 5506 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 27 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-21 19:46:09] [INFO ] Invariant cache hit.
[2023-03-21 19:46:11] [INFO ] Implicit Places using invariants in 1596 ms returned []
[2023-03-21 19:46:11] [INFO ] Invariant cache hit.
[2023-03-21 19:46:13] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned []
Implicit Place search using SMT with State Equation took 3629 ms to find 0 implicit places.
[2023-03-21 19:46:13] [INFO ] Invariant cache hit.
[2023-03-21 19:46:14] [INFO ] Dead Transitions using invariants and state equation in 1213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4873 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 488 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 5409 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 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-21 19:46:14] [INFO ] Invariant cache hit.
[2023-03-21 19:46:17] [INFO ] Implicit Places using invariants in 2335 ms returned []
[2023-03-21 19:46:17] [INFO ] Invariant cache hit.
[2023-03-21 19:46:19] [INFO ] Implicit Places using invariants and state equation in 2451 ms returned []
Implicit Place search using SMT with State Equation took 4802 ms to find 0 implicit places.
[2023-03-21 19:46:19] [INFO ] Invariant cache hit.
[2023-03-21 19:46:20] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5446 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 218 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 2027 steps with 0 reset in 31 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-08 finished in 5725 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 20 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-21 19:46:20] [INFO ] Invariant cache hit.
[2023-03-21 19:46:21] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2023-03-21 19:46:21] [INFO ] Invariant cache hit.
[2023-03-21 19:46:23] [INFO ] Implicit Places using invariants and state equation in 2165 ms returned []
Implicit Place search using SMT with State Equation took 3367 ms to find 0 implicit places.
[2023-03-21 19:46:24] [INFO ] Invariant cache hit.
[2023-03-21 19:46:24] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4130 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 153 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 566 reset in 848 ms.
Product exploration explored 100000 steps with 571 reset in 958 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 130 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 163 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 196 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=65 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 174 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 168 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-21 19:46:27] [INFO ] Invariant cache hit.
[2023-03-21 19:46:29] [INFO ] [Real]Absence check using 361 positive place invariants in 407 ms returned sat
[2023-03-21 19:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:46:32] [INFO ] [Real]Absence check using state equation in 2875 ms returned sat
[2023-03-21 19:46:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:46:33] [INFO ] [Nat]Absence check using 361 positive place invariants in 253 ms returned sat
[2023-03-21 19:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:46:35] [INFO ] [Nat]Absence check using state equation in 2116 ms returned sat
[2023-03-21 19:46:35] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 131 ms.
[2023-03-21 19:46:51] [INFO ] Deduced a trap composed of 3 places in 4216 ms of which 4 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:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-21 19:46:51] [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)
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 24 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-21 19:46:51] [INFO ] Invariant cache hit.
[2023-03-21 19:46:52] [INFO ] Implicit Places using invariants in 758 ms returned []
[2023-03-21 19:46:52] [INFO ] Invariant cache hit.
[2023-03-21 19:46:54] [INFO ] Implicit Places using invariants and state equation in 1988 ms returned []
Implicit Place search using SMT with State Equation took 2764 ms to find 0 implicit places.
[2023-03-21 19:46:54] [INFO ] Invariant cache hit.
[2023-03-21 19:46:55] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3693 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 146 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 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 160 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=53 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 153 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 167 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-21 19:46:56] [INFO ] Invariant cache hit.
[2023-03-21 19:46:57] [INFO ] [Real]Absence check using 361 positive place invariants in 304 ms returned sat
[2023-03-21 19:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:47:00] [INFO ] [Real]Absence check using state equation in 2801 ms returned sat
[2023-03-21 19:47:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:47:01] [INFO ] [Nat]Absence check using 361 positive place invariants in 149 ms returned sat
[2023-03-21 19:47:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:47:04] [INFO ] [Nat]Absence check using state equation in 3003 ms returned sat
[2023-03-21 19:47:04] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 115 ms.
[2023-03-21 19:47:15] [INFO ] Deduced a trap composed of 3 places in 816 ms of which 2 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: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-21 19:47:15] [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 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 560 reset in 688 ms.
Product exploration explored 100000 steps with 547 reset in 929 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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-21 19:47:18] [INFO ] Redundant transitions in 330 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-21 19:47:18] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-21 19:47:19] [INFO ] Dead Transitions using invariants and state equation in 930 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 25 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 1420 ms. Remains : 1003/1003 places, 962/963 transitions.
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.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-21 19:47:19] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-21 19:47:20] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-21 19:47:20] [INFO ] Invariant cache hit.
[2023-03-21 19:47:22] [INFO ] Implicit Places using invariants and state equation in 2080 ms returned []
Implicit Place search using SMT with State Equation took 2789 ms to find 0 implicit places.
[2023-03-21 19:47:22] [INFO ] Invariant cache hit.
[2023-03-21 19:47:22] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3505 ms. Remains : 1003/1003 places, 963/963 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-10 finished in 62589 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 39 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:47:23] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-21 19:47:23] [INFO ] Implicit Places using invariants in 612 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 641 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 31 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 714 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 87 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 2301 steps with 2 reset in 16 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-11 finished in 831 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 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-21 19:47:24] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-21 19:47:24] [INFO ] Implicit Places using invariants in 706 ms returned []
[2023-03-21 19:47:24] [INFO ] Invariant cache hit.
[2023-03-21 19:47:26] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2693 ms to find 0 implicit places.
[2023-03-21 19:47:26] [INFO ] Invariant cache hit.
[2023-03-21 19:47:27] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3485 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 233 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 25024 reset in 1924 ms.
Product exploration explored 100000 steps with 25005 reset in 1872 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 242 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 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 3748 steps, including 1 resets, run visited all 2 properties in 37 ms. (steps per millisecond=101 )
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 270 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 128 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-21 19:47:32] [INFO ] Invariant cache hit.
[2023-03-21 19:47:33] [INFO ] [Real]Absence check using 361 positive place invariants in 315 ms returned sat
[2023-03-21 19:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:47:36] [INFO ] [Real]Absence check using state equation in 2224 ms returned sat
[2023-03-21 19:47:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:47:37] [INFO ] [Nat]Absence check using 361 positive place invariants in 142 ms returned sat
[2023-03-21 19:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:47:38] [INFO ] [Nat]Absence check using state equation in 1593 ms returned sat
[2023-03-21 19:47:38] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2023-03-21 19:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-21 19:47:38] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 64 ms.
[2023-03-21 19:47:51] [INFO ] Added : 615 causal constraints over 123 iterations in 12211 ms. Result :unknown
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 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-21 19:47:51] [INFO ] Invariant cache hit.
[2023-03-21 19:47:52] [INFO ] Implicit Places using invariants in 1206 ms returned []
[2023-03-21 19:47:52] [INFO ] Invariant cache hit.
[2023-03-21 19:47:53] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 2733 ms to find 0 implicit places.
[2023-03-21 19:47:53] [INFO ] Invariant cache hit.
[2023-03-21 19:47:54] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3550 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 325 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 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 1904 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=100 )
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 320 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 136 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-21 19:47:55] [INFO ] Invariant cache hit.
[2023-03-21 19:47:58] [INFO ] [Real]Absence check using 361 positive place invariants in 205 ms returned sat
[2023-03-21 19:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:48:01] [INFO ] [Real]Absence check using state equation in 2575 ms returned sat
[2023-03-21 19:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:48:03] [INFO ] [Nat]Absence check using 361 positive place invariants in 126 ms returned sat
[2023-03-21 19:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:48:04] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2023-03-21 19:48:04] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2023-03-21 19:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-21 19:48:04] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 110 ms.
[2023-03-21 19:48:17] [INFO ] Deduced a trap composed of 3 places in 930 ms of which 2 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: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-21 19:48:17] [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)
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 33281 reset in 2179 ms.
Product exploration explored 100000 steps with 33329 reset in 2274 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 156 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 83 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-21 19:48:22] [INFO ] Redundant transitions in 236 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-21 19:48:22] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-21 19:48:23] [INFO ] Dead Transitions using invariants and state equation in 1110 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 3 ms
Applied a total of 0 rules in 25 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 1478 ms. Remains : 1003/1003 places, 962/963 transitions.
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-21 19:48:23] [INFO ] Computed 361 place invariants in 39 ms
[2023-03-21 19:48:24] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2023-03-21 19:48:24] [INFO ] Invariant cache hit.
[2023-03-21 19:48:26] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 3171 ms to find 0 implicit places.
[2023-03-21 19:48:26] [INFO ] Invariant cache hit.
[2023-03-21 19:48:27] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4113 ms. Remains : 1003/1003 places, 963/963 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-12 finished in 63989 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 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 51 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:48:28] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-21 19:48:29] [INFO ] Implicit Places using invariants in 1066 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1080 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 36 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 1167 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 202 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 80 reset in 755 ms.
Product exploration explored 100000 steps with 80 reset in 885 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 656 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 308 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Finished random walk after 1714 steps, including 0 resets, run visited all 5 properties in 36 ms. (steps per millisecond=47 )
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 925 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 271 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 961 rows 1000 cols
[2023-03-21 19:48:33] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:48:35] [INFO ] [Real]Absence check using 360 positive place invariants in 223 ms returned sat
[2023-03-21 19:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:48:37] [INFO ] [Real]Absence check using state equation in 2574 ms returned sat
[2023-03-21 19:48:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:48:38] [INFO ] [Nat]Absence check using 360 positive place invariants in 438 ms returned sat
[2023-03-21 19:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:48:40] [INFO ] [Nat]Absence check using state equation in 1794 ms returned sat
[2023-03-21 19:48:40] [INFO ] Computed and/alt/rep : 882/3061/882 causal constraints (skipped 78 transitions) in 61 ms.
[2023-03-21 19:48:52] [INFO ] Added : 530 causal constraints over 106 iterations in 12157 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 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-21 19:48:52] [INFO ] Invariant cache hit.
[2023-03-21 19:48:53] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-21 19:48:53] [INFO ] Invariant cache hit.
[2023-03-21 19:48:55] [INFO ] Implicit Places using invariants and state equation in 2220 ms returned []
Implicit Place search using SMT with State Equation took 2866 ms to find 0 implicit places.
[2023-03-21 19:48:56] [INFO ] Redundant transitions in 767 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-21 19:48:56] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:48:57] [INFO ] Dead Transitions using invariants and state equation in 662 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 62 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 4393 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 627 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 222 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Finished random walk after 1925 steps, including 0 resets, run visited all 5 properties in 74 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 765 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 208 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
[2023-03-21 19:48:59] [INFO ] Invariant cache hit.
[2023-03-21 19:49:00] [INFO ] [Real]Absence check using 360 positive place invariants in 416 ms returned sat
[2023-03-21 19:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:49:03] [INFO ] [Real]Absence check using state equation in 3186 ms returned sat
[2023-03-21 19:49:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:49:04] [INFO ] [Nat]Absence check using 360 positive place invariants in 182 ms returned sat
[2023-03-21 19:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:49:07] [INFO ] [Nat]Absence check using state equation in 2986 ms returned sat
[2023-03-21 19:49:08] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2023-03-21 19:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-21 19:49:08] [INFO ] Computed and/alt/rep : 882/3066/882 causal constraints (skipped 77 transitions) in 106 ms.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 3 places in 682 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: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-21 19:49:19] [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 p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 81 reset in 743 ms.
Product exploration explored 100000 steps with 80 reset in 844 ms.
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 30 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-21 19:49:21] [INFO ] Invariant cache hit.
[2023-03-21 19:49:22] [INFO ] Implicit Places using invariants in 696 ms returned []
[2023-03-21 19:49:22] [INFO ] Invariant cache hit.
[2023-03-21 19:49:23] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
[2023-03-21 19:49:23] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-21 19:49:23] [INFO ] Invariant cache hit.
[2023-03-21 19:49:24] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3071 ms. Remains : 1000/1000 places, 960/960 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-13 finished in 56688 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 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-21 19:49:24] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-21 19:49:25] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2023-03-21 19:49:25] [INFO ] Invariant cache hit.
[2023-03-21 19:49:27] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 2472 ms to find 0 implicit places.
[2023-03-21 19:49:27] [INFO ] Invariant cache hit.
[2023-03-21 19:49:27] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3247 ms. Remains : 1003/1003 places, 963/963 transitions.
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)]
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 92 reset in 827 ms.
Product exploration explored 100000 steps with 90 reset in 918 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 1506 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 810 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 359 ms. (steps per millisecond=27 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 19:49:33] [INFO ] Invariant cache hit.
[2023-03-21 19:49:33] [INFO ] [Real]Absence check using 361 positive place invariants in 120 ms returned sat
[2023-03-21 19:49:34] [INFO ] After 1250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:49:35] [INFO ] [Nat]Absence check using 361 positive place invariants in 116 ms returned sat
[2023-03-21 19:49:36] [INFO ] After 1342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:49:36] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2023-03-21 19:49:36] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2023-03-21 19:49:36] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-21 19:49:37] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 1 ms to minimize.
[2023-03-21 19:49:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 803 ms
[2023-03-21 19:49:37] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:49:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-21 19:49:37] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2023-03-21 19:49:38] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-21 19:49:38] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 36 ms to minimize.
[2023-03-21 19:49:38] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2023-03-21 19:49:38] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2023-03-21 19:49:39] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-21 19:49:39] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-21 19:49:39] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-03-21 19:49:39] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-21 19:49:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1848 ms
[2023-03-21 19:49:39] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2023-03-21 19:49:40] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2023-03-21 19:49:40] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2023-03-21 19:49:40] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-21 19:49:40] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-21 19:49:40] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2023-03-21 19:49:41] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 10 ms to minimize.
[2023-03-21 19:49:41] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2023-03-21 19:49:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1403 ms
[2023-03-21 19:49:41] [INFO ] After 6176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 523 ms.
[2023-03-21 19:49:41] [INFO ] After 7310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 603 ms.
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 276 times.
Drop transitions removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 280 place count 1001 transition count 961
Applied a total of 280 rules in 58 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 59 ms. Remains : 1001/1003 places, 961/963 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:49:42] [INFO ] Computed 361 place invariants in 67 ms
[2023-03-21 19:49:43] [INFO ] [Real]Absence check using 359 positive place invariants in 111 ms returned sat
[2023-03-21 19:49:43] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 19:49:44] [INFO ] After 1164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 19:49:44] [INFO ] [Nat]Absence check using 359 positive place invariants in 62 ms returned sat
[2023-03-21 19:49:44] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 19:49:45] [INFO ] After 1306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 19:49:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:49:46] [INFO ] After 499ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 0 ms to minimize.
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 0 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 2 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 15 places in 345 ms of which 1 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 0 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 12 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 1 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3420 ms
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 9 places in 318 ms of which 23 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 2 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 4 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2784 ms
[2023-03-21 19:49:52] [INFO ] After 7249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-21 19:49:53] [INFO ] After 9062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 329 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:49:53] [INFO ] Invariant cache hit.
[2023-03-21 19:49:53] [INFO ] [Real]Absence check using 359 positive place invariants in 53 ms returned sat
[2023-03-21 19:49:53] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-21 19:49:54] [INFO ] After 965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:49:54] [INFO ] [Nat]Absence check using 359 positive place invariants in 61 ms returned sat
[2023-03-21 19:49:54] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 19:49:55] [INFO ] After 833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:49:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:49:55] [INFO ] After 130ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 15 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1811 ms
[2023-03-21 19:49:57] [INFO ] After 2092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-21 19:49:58] [INFO ] After 3440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 106 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 28 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 28 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) 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 183459 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183459 steps, saw 154188 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:50:01] [INFO ] Invariant cache hit.
[2023-03-21 19:50:01] [INFO ] [Real]Absence check using 359 positive place invariants in 108 ms returned sat
[2023-03-21 19:50:01] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 19:50:02] [INFO ] After 870ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:50:02] [INFO ] [Nat]Absence check using 359 positive place invariants in 166 ms returned sat
[2023-03-21 19:50:02] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 19:50:03] [INFO ] After 1144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:50:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:50:03] [INFO ] After 136ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 19:50:04] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 1 ms to minimize.
[2023-03-21 19:50:04] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 0 ms to minimize.
[2023-03-21 19:50:04] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 0 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2023-03-21 19:50:06] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2023-03-21 19:50:06] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-21 19:50:06] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-21 19:50:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2373 ms
[2023-03-21 19:50:06] [INFO ] After 2638ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-21 19:50:06] [INFO ] After 4361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 76 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 38 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 51 ms. Remains : 1001/1001 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-21 19:50:06] [INFO ] Invariant cache hit.
[2023-03-21 19:50:07] [INFO ] Implicit Places using invariants in 1253 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1256 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 32 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 1327 ms. Remains : 1000/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 181114 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181114 steps, saw 153087 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-21 19:50:11] [INFO ] Computed 360 place invariants in 50 ms
[2023-03-21 19:50:11] [INFO ] [Real]Absence check using 358 positive place invariants in 53 ms returned sat
[2023-03-21 19:50:11] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 19:50:12] [INFO ] After 853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:50:12] [INFO ] [Nat]Absence check using 358 positive place invariants in 138 ms returned sat
[2023-03-21 19:50:12] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 19:50:14] [INFO ] After 1878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:50:14] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2023-03-21 19:50:14] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 0 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1301 ms
[2023-03-21 19:50:15] [INFO ] After 3316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-21 19:50:16] [INFO ] After 3954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 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 26 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 39 ms. Remains : 1000/1000 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-21 19:50:16] [INFO ] Invariant cache hit.
[2023-03-21 19:50:17] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2023-03-21 19:50:17] [INFO ] Invariant cache hit.
[2023-03-21 19:50:20] [INFO ] Implicit Places using invariants and state equation in 2963 ms returned []
Implicit Place search using SMT with State Equation took 4015 ms to find 0 implicit places.
[2023-03-21 19:50:20] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-21 19:50:20] [INFO ] Invariant cache hit.
[2023-03-21 19:50:21] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4864 ms. Remains : 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.
Running SMT prover for 1 properties.
[2023-03-21 19:50:21] [INFO ] Invariant cache hit.
[2023-03-21 19:50:21] [INFO ] [Real]Absence check using 358 positive place invariants in 114 ms returned sat
[2023-03-21 19:50:21] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-21 19:50:22] [INFO ] After 1256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:50:22] [INFO ] [Nat]Absence check using 358 positive place invariants in 125 ms returned sat
[2023-03-21 19:50:22] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 19:50:23] [INFO ] After 1104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:50:24] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-21 19:50:24] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2023-03-21 19:50:24] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2023-03-21 19:50:24] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2023-03-21 19:50:24] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-21 19:50:25] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-21 19:50:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1088 ms
[2023-03-21 19:50:25] [INFO ] After 2330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 478 ms.
[2023-03-21 19:50:25] [INFO ] After 3293ms 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 1644 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 612 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 587 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 44 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-21 19:50:28] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-21 19:50:29] [INFO ] Implicit Places using invariants in 810 ms returned []
[2023-03-21 19:50:29] [INFO ] Invariant cache hit.
[2023-03-21 19:50:34] [INFO ] Implicit Places using invariants and state equation in 5526 ms returned []
Implicit Place search using SMT with State Equation took 6388 ms to find 0 implicit places.
[2023-03-21 19:50:34] [INFO ] Invariant cache hit.
[2023-03-21 19:50:35] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7069 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 1415 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 828 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 546 ms. (steps per millisecond=18 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) 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
Running SMT prover for 4 properties.
[2023-03-21 19:50:38] [INFO ] Invariant cache hit.
[2023-03-21 19:50:39] [INFO ] [Real]Absence check using 361 positive place invariants in 64 ms returned sat
[2023-03-21 19:50:40] [INFO ] After 1237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:50:40] [INFO ] [Nat]Absence check using 361 positive place invariants in 75 ms returned sat
[2023-03-21 19:50:42] [INFO ] After 2219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:50:42] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2023-03-21 19:50:43] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 15 ms to minimize.
[2023-03-21 19:50:43] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2023-03-21 19:50:43] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 0 ms to minimize.
[2023-03-21 19:50:43] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 0 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1407 ms
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 567 ms
[2023-03-21 19:50:45] [INFO ] After 4670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1080 ms.
[2023-03-21 19:50:46] [INFO ] After 6220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 421 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 77 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 77 ms. Remains : 1001/1003 places, 961/963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:50:47] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-21 19:50:47] [INFO ] [Real]Absence check using 359 positive place invariants in 59 ms returned sat
[2023-03-21 19:50:47] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-21 19:50:48] [INFO ] After 976ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 19:50:48] [INFO ] [Nat]Absence check using 359 positive place invariants in 121 ms returned sat
[2023-03-21 19:50:48] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-21 19:50:49] [INFO ] After 1052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 19:50:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:50:50] [INFO ] After 727ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 19:50:51] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2023-03-21 19:50:56] [INFO ] Deduced a trap composed of 9 places in 573 ms of which 1 ms to minimize.
[2023-03-21 19:50:56] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-21 19:50:56] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 1 ms to minimize.
[2023-03-21 19:50:57] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2023-03-21 19:50:57] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 1 ms to minimize.
[2023-03-21 19:50:58] [INFO ] Deduced a trap composed of 9 places in 390 ms of which 1 ms to minimize.
[2023-03-21 19:50:58] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2023-03-21 19:50:58] [INFO ] Deduced a trap composed of 9 places in 360 ms of which 0 ms to minimize.
[2023-03-21 19:50:59] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-21 19:50:59] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 0 ms to minimize.
[2023-03-21 19:50:59] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2023-03-21 19:51:00] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 26 ms to minimize.
[2023-03-21 19:51:00] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 0 ms to minimize.
[2023-03-21 19:51:00] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2023-03-21 19:51:00] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2023-03-21 19:51:01] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 0 ms to minimize.
[2023-03-21 19:51:01] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2023-03-21 19:51:01] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-21 19:51:01] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2023-03-21 19:51:02] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-21 19:51:02] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-21 19:51:02] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 10821 ms
[2023-03-21 19:51:02] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 0 ms to minimize.
[2023-03-21 19:51:02] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-21 19:51:03] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-21 19:51:03] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 0 ms to minimize.
[2023-03-21 19:51:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 787 ms
[2023-03-21 19:51:03] [INFO ] After 13673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 508 ms.
[2023-03-21 19:51:03] [INFO ] After 15749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 279 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1001/1001 places, 961/961 transitions.
Finished random walk after 5837 steps, including 1 resets, run visited all 2 properties in 95 ms. (steps per millisecond=61 )
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 p0 p1 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 17 factoid took 1888 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 689 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 665 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)]
Product exploration explored 100000 steps with 88 reset in 1006 ms.
Product exploration explored 100000 steps with 98 reset in 985 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
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)]
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 3 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 3 ms
Applied a total of 2 rules in 68 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-21 19:51:11] [INFO ] Redundant transitions in 341 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-21 19:51:11] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-21 19:51:12] [INFO ] Dead Transitions using invariants and state equation in 721 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 3 ms
Applied a total of 0 rules in 21 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 1162 ms. Remains : 1003/1003 places, 962/963 transitions.
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-21 19:51:12] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-21 19:51:13] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2023-03-21 19:51:13] [INFO ] Invariant cache hit.
[2023-03-21 19:51:15] [INFO ] Implicit Places using invariants and state equation in 1996 ms returned []
Implicit Place search using SMT with State Equation took 3172 ms to find 0 implicit places.
[2023-03-21 19:51:15] [INFO ] Invariant cache hit.
[2023-03-21 19:51:16] [INFO ] Dead Transitions using invariants and state equation in 1171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4360 ms. Remains : 1003/1003 places, 963/963 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-14 finished in 112146 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 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 42 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:51:16] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-21 19:51:18] [INFO ] Implicit Places using invariants in 1137 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1138 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 18 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 1211 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 70 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 790 ms.
Product exploration explored 100000 steps with 52 reset in 924 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 274 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 130 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1867 steps, including 0 resets, run visited all 1 properties in 35 ms. (steps per millisecond=53 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 235 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 118 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-21 19:51:20] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-21 19:51:22] [INFO ] Implicit Places using invariants in 1234 ms returned []
[2023-03-21 19:51:22] [INFO ] Invariant cache hit.
[2023-03-21 19:51:24] [INFO ] Implicit Places using invariants and state equation in 2224 ms returned []
Implicit Place search using SMT with State Equation took 3484 ms to find 0 implicit places.
[2023-03-21 19:51:24] [INFO ] Redundant transitions in 231 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-21 19:51:24] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-21 19:51:26] [INFO ] Dead Transitions using invariants and state equation in 1391 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 25 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 5181 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 241 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 126 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1786 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=66 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 229 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 151 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 52 reset in 817 ms.
Product exploration explored 100000 steps with 52 reset in 940 ms.
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 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-21 19:51:28] [INFO ] Invariant cache hit.
[2023-03-21 19:51:29] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-21 19:51:29] [INFO ] Invariant cache hit.
[2023-03-21 19:51:32] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
[2023-03-21 19:51:32] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-21 19:51:32] [INFO ] Invariant cache hit.
[2023-03-21 19:51:33] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4422 ms. Remains : 1000/1000 places, 960/960 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-15 finished in 16563 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))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040A-LTLFireability-10
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_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 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 65 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2023-03-21 19:51:33] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:51:35] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2023-03-21 19:51:35] [INFO ] Invariant cache hit.
[2023-03-21 19:51:36] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
[2023-03-21 19:51:36] [INFO ] Invariant cache hit.
[2023-03-21 19:51:37] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 999/1003 places, 960/963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4039 ms. Remains : 999/1003 places, 960/963 transitions.
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 s864 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 27103 steps with 145 reset in 195 ms.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-10 finished in 4559 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-040A-LTLFireability-12
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 61 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
[2023-03-21 19:51:38] [INFO ] Invariant cache hit.
[2023-03-21 19:51:39] [INFO ] Implicit Places using invariants in 707 ms returned []
[2023-03-21 19:51:39] [INFO ] Invariant cache hit.
[2023-03-21 19:51:40] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
[2023-03-21 19:51:40] [INFO ] Invariant cache hit.
[2023-03-21 19:51:40] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 999/1003 places, 960/963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2655 ms. Remains : 999/1003 places, 960/963 transitions.
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 s856 1) (EQ s858 1)), p0:(NEQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25004 reset in 828 ms.
Product exploration explored 100000 steps with 25056 reset in 1028 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT 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 360 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 204 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 1863 steps, including 0 resets, run visited all 2 properties in 35 ms. (steps per millisecond=53 )
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 386 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 185 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-21 19:51:44] [INFO ] Invariant cache hit.
[2023-03-21 19:51:45] [INFO ] [Real]Absence check using 360 positive place invariants in 192 ms returned sat
[2023-03-21 19:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:51:48] [INFO ] [Real]Absence check using state equation in 3470 ms returned sat
[2023-03-21 19:51:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:51:49] [INFO ] [Nat]Absence check using 360 positive place invariants in 143 ms returned sat
[2023-03-21 19:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:51:51] [INFO ] [Nat]Absence check using state equation in 1566 ms returned sat
[2023-03-21 19:51:51] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 0 ms to minimize.
[2023-03-21 19:51:51] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2023-03-21 19:51:51] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2023-03-21 19:51:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 608 ms
[2023-03-21 19:51:52] [INFO ] Computed and/alt/rep : 959/2392/959 causal constraints (skipped 0 transitions) in 91 ms.
[2023-03-21 19:52:04] [INFO ] Added : 430 causal constraints over 86 iterations in 12009 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 960/960 transitions.
Applied a total of 0 rules in 18 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-21 19:52:04] [INFO ] Invariant cache hit.
[2023-03-21 19:52:05] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2023-03-21 19:52:05] [INFO ] Invariant cache hit.
[2023-03-21 19:52:07] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 3253 ms to find 0 implicit places.
[2023-03-21 19:52:07] [INFO ] Invariant cache hit.
[2023-03-21 19:52:07] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3823 ms. Remains : 999/999 places, 960/960 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT 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 166 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 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 1928 steps, including 0 resets, run visited all 2 properties in 44 ms. (steps per millisecond=43 )
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 400 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 199 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-21 19:52:09] [INFO ] Invariant cache hit.
[2023-03-21 19:52:10] [INFO ] [Real]Absence check using 360 positive place invariants in 227 ms returned sat
[2023-03-21 19:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:52:12] [INFO ] [Real]Absence check using state equation in 2093 ms returned sat
[2023-03-21 19:52:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:52:13] [INFO ] [Nat]Absence check using 360 positive place invariants in 148 ms returned sat
[2023-03-21 19:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:52:14] [INFO ] [Nat]Absence check using state equation in 1393 ms returned sat
[2023-03-21 19:52:14] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 1 ms to minimize.
[2023-03-21 19:52:15] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 13 ms to minimize.
[2023-03-21 19:52:15] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2023-03-21 19:52:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 652 ms
[2023-03-21 19:52:15] [INFO ] Computed and/alt/rep : 959/2392/959 causal constraints (skipped 0 transitions) in 74 ms.
[2023-03-21 19:52:28] [INFO ] Deduced a trap composed of 2 places in 998 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:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-21 19:52:28] [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)
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 33422 reset in 990 ms.
Product exploration explored 100000 steps with 33311 reset in 992 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 960/960 transitions.
Applied a total of 0 rules in 27 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-21 19:52:31] [INFO ] Redundant transitions in 769 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-21 19:52:31] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:52:32] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/999 places, 959/960 transitions.
Applied a total of 0 rules in 20 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 1451 ms. Remains : 999/999 places, 959/960 transitions.
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 960/960 transitions.
Applied a total of 0 rules in 11 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
// Phase 1: matrix 960 rows 999 cols
[2023-03-21 19:52:32] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:52:33] [INFO ] Implicit Places using invariants in 742 ms returned []
[2023-03-21 19:52:33] [INFO ] Invariant cache hit.
[2023-03-21 19:52:34] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
[2023-03-21 19:52:34] [INFO ] Invariant cache hit.
[2023-03-21 19:52:35] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2972 ms. Remains : 999/999 places, 960/960 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-12 finished in 57321 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 619 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 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
Applied a total of 4 rules in 95 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:52:36] [INFO ] Computed 361 place invariants in 16 ms
[2023-03-21 19:52:36] [INFO ] Implicit Places using invariants in 690 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 691 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 25 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 811 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 90 reset in 797 ms.
Product exploration explored 100000 steps with 101 reset in 967 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 1429 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 598 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 382 ms. (steps per millisecond=26 ) properties (out of 11) seen :7
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 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-21 19:52:41] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:52:41] [INFO ] [Real]Absence check using 360 positive place invariants in 163 ms returned sat
[2023-03-21 19:52:43] [INFO ] After 1610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:52:43] [INFO ] [Nat]Absence check using 360 positive place invariants in 60 ms returned sat
[2023-03-21 19:52:45] [INFO ] After 2221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:52:46] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-21 19:52:46] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-21 19:52:46] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 17 ms to minimize.
[2023-03-21 19:52:46] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2023-03-21 19:52:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2023-03-21 19:52:46] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 1 ms to minimize.
[2023-03-21 19:52:47] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-21 19:52:47] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-21 19:52:47] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2023-03-21 19:52:47] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2023-03-21 19:52:47] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:52:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2023-03-21 19:52:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1312 ms
[2023-03-21 19:52:48] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-21 19:52:48] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-21 19:52:48] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-21 19:52:49] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 27 ms to minimize.
[2023-03-21 19:52:49] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 0 ms to minimize.
[2023-03-21 19:52:49] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-21 19:52:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1109 ms
[2023-03-21 19:52:49] [INFO ] After 6001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-03-21 19:52:50] [INFO ] After 6972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 501 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 41 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 41 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-21 19:52:51] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-21 19:52:51] [INFO ] [Real]Absence check using 358 positive place invariants in 69 ms returned sat
[2023-03-21 19:52:51] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 19:52:52] [INFO ] After 996ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:52:52] [INFO ] [Nat]Absence check using 358 positive place invariants in 60 ms returned sat
[2023-03-21 19:52:52] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 19:52:54] [INFO ] After 1494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:52:55] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2023-03-21 19:52:55] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-21 19:52:55] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2023-03-21 19:52:56] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2023-03-21 19:52:56] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 0 ms to minimize.
[2023-03-21 19:52:56] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2023-03-21 19:52:57] [INFO ] Deduced a trap composed of 17 places in 535 ms of which 0 ms to minimize.
[2023-03-21 19:52:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1960 ms
[2023-03-21 19:52:58] [INFO ] Deduced a trap composed of 13 places in 333 ms of which 1 ms to minimize.
[2023-03-21 19:52:58] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2023-03-21 19:52:59] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 0 ms to minimize.
[2023-03-21 19:52:59] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-21 19:52:59] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 0 ms to minimize.
[2023-03-21 19:53:00] [INFO ] Deduced a trap composed of 8 places in 787 ms of which 1 ms to minimize.
[2023-03-21 19:53:00] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-03-21 19:53:00] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-21 19:53:01] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 1 ms to minimize.
[2023-03-21 19:53:01] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 0 ms to minimize.
[2023-03-21 19:53:01] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 0 ms to minimize.
[2023-03-21 19:53:02] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 1 ms to minimize.
[2023-03-21 19:53:02] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-21 19:53:02] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 0 ms to minimize.
[2023-03-21 19:53:02] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-21 19:53:03] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2023-03-21 19:53:03] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 1 ms to minimize.
[2023-03-21 19:53:03] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2023-03-21 19:53:03] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2023-03-21 19:53:04] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2023-03-21 19:53:04] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-21 19:53:04] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:53:04] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2023-03-21 19:53:04] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6453 ms
[2023-03-21 19:53:05] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 19 ms to minimize.
[2023-03-21 19:53:05] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-03-21 19:53:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 470 ms
[2023-03-21 19:53:05] [INFO ] After 12779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2072 ms.
[2023-03-21 19:53:07] [INFO ] After 15255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 324 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 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 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :2
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
Running SMT prover for 1 properties.
[2023-03-21 19:53:07] [INFO ] Invariant cache hit.
[2023-03-21 19:53:08] [INFO ] [Real]Absence check using 358 positive place invariants in 93 ms returned sat
[2023-03-21 19:53:08] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 19:53:08] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:53:09] [INFO ] [Nat]Absence check using 358 positive place invariants in 124 ms returned sat
[2023-03-21 19:53:09] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 19 ms returned sat
[2023-03-21 19:53:10] [INFO ] After 1257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:53:10] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 0 ms to minimize.
[2023-03-21 19:53:11] [INFO ] Deduced a trap composed of 8 places in 448 ms of which 0 ms to minimize.
[2023-03-21 19:53:11] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2023-03-21 19:53:11] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-21 19:53:11] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-21 19:53:12] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:53:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1566 ms
[2023-03-21 19:53:12] [INFO ] After 2967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 446 ms.
[2023-03-21 19:53:12] [INFO ] After 3870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 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 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 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 182431 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182431 steps, saw 153586 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:53:15] [INFO ] Invariant cache hit.
[2023-03-21 19:53:16] [INFO ] [Real]Absence check using 358 positive place invariants in 120 ms returned sat
[2023-03-21 19:53:16] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-21 19:53:16] [INFO ] After 1069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:53:17] [INFO ] [Nat]Absence check using 358 positive place invariants in 82 ms returned sat
[2023-03-21 19:53:17] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 19:53:18] [INFO ] After 1483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:53:19] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-21 19:53:19] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-21 19:53:19] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2023-03-21 19:53:19] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-21 19:53:19] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2023-03-21 19:53:20] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-21 19:53:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1334 ms
[2023-03-21 19:53:20] [INFO ] After 2923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 425 ms.
[2023-03-21 19:53:20] [INFO ] After 3720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 59 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 24 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 24 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 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-21 19:53:20] [INFO ] Invariant cache hit.
[2023-03-21 19:53:21] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2023-03-21 19:53:21] [INFO ] Invariant cache hit.
[2023-03-21 19:53:23] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2847 ms to find 0 implicit places.
[2023-03-21 19:53:23] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-21 19:53:23] [INFO ] Invariant cache hit.
[2023-03-21 19:53:24] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3925 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 1 properties.
[2023-03-21 19:53:24] [INFO ] Invariant cache hit.
[2023-03-21 19:53:24] [INFO ] [Real]Absence check using 358 positive place invariants in 74 ms returned sat
[2023-03-21 19:53:24] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 19:53:25] [INFO ] After 814ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:53:25] [INFO ] [Nat]Absence check using 358 positive place invariants in 157 ms returned sat
[2023-03-21 19:53:25] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-21 19:53:27] [INFO ] After 1114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:53:27] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-21 19:53:27] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-21 19:53:27] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 1 ms to minimize.
[2023-03-21 19:53:28] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 0 ms to minimize.
[2023-03-21 19:53:28] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-21 19:53:28] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-21 19:53:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1674 ms
[2023-03-21 19:53:28] [INFO ] After 2853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 446 ms.
[2023-03-21 19:53:29] [INFO ] After 3789ms 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 1790 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 508 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 705 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 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-21 19:53:32] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:53:33] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-21 19:53:33] [INFO ] Invariant cache hit.
[2023-03-21 19:53:34] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 2492 ms to find 0 implicit places.
[2023-03-21 19:53:34] [INFO ] Invariant cache hit.
[2023-03-21 19:53:35] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3229 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 1455 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 673 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 228 ms. (steps per millisecond=43 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 19:53:38] [INFO ] Invariant cache hit.
[2023-03-21 19:53:38] [INFO ] [Real]Absence check using 360 positive place invariants in 57 ms returned sat
[2023-03-21 19:53:39] [INFO ] After 1261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:53:39] [INFO ] [Nat]Absence check using 360 positive place invariants in 66 ms returned sat
[2023-03-21 19:53:41] [INFO ] After 1494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:53:41] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2023-03-21 19:53:41] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2023-03-21 19:53:42] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2023-03-21 19:53:42] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-21 19:53:42] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-21 19:53:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 881 ms
[2023-03-21 19:53:42] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-21 19:53:42] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2023-03-21 19:53:43] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-21 19:53:43] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-21 19:53:43] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-21 19:53:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2023-03-21 19:53:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 936 ms
[2023-03-21 19:53:43] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 0 ms to minimize.
[2023-03-21 19:53:44] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2023-03-21 19:53:44] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 0 ms to minimize.
[2023-03-21 19:53:44] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2023-03-21 19:53:44] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 13 ms to minimize.
[2023-03-21 19:53:45] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-21 19:53:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1430 ms
[2023-03-21 19:53:45] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-21 19:53:45] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2023-03-21 19:53:45] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-21 19:53:45] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2023-03-21 19:53:46] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:53:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 842 ms
[2023-03-21 19:53:46] [INFO ] After 6118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 568 ms.
[2023-03-21 19:53:46] [INFO ] After 7151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 346 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 34 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 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-21 19:53:47] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-21 19:53:47] [INFO ] [Real]Absence check using 358 positive place invariants in 56 ms returned sat
[2023-03-21 19:53:47] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-21 19:53:48] [INFO ] After 1002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:53:48] [INFO ] [Nat]Absence check using 358 positive place invariants in 194 ms returned sat
[2023-03-21 19:53:48] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 15 ms returned sat
[2023-03-21 19:53:50] [INFO ] After 1436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:53:51] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-21 19:53:51] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 0 ms to minimize.
[2023-03-21 19:53:51] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 0 ms to minimize.
[2023-03-21 19:53:52] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 0 ms to minimize.
[2023-03-21 19:53:52] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2023-03-21 19:53:52] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-21 19:53:52] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2023-03-21 19:53:53] [INFO ] Deduced a trap composed of 15 places in 436 ms of which 1 ms to minimize.
[2023-03-21 19:53:54] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 0 ms to minimize.
[2023-03-21 19:53:54] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 26 ms to minimize.
[2023-03-21 19:53:54] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2023-03-21 19:53:54] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2023-03-21 19:53:55] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 0 ms to minimize.
[2023-03-21 19:53:55] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2023-03-21 19:53:55] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2023-03-21 19:53:55] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2023-03-21 19:53:55] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 5 ms to minimize.
[2023-03-21 19:53:56] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2023-03-21 19:53:56] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-21 19:53:56] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2023-03-21 19:53:56] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2023-03-21 19:53:56] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-21 19:53:57] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-21 19:53:57] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2023-03-21 19:53:57] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-21 19:53:57] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6475 ms
[2023-03-21 19:53:57] [INFO ] After 8635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-21 19:53:57] [INFO ] After 9582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 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 44 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1000/1000 places, 961/961 transitions.
Finished random walk after 5634 steps, including 1 resets, run visited all 1 properties in 56 ms. (steps per millisecond=100 )
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 p0 p1 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 17 factoid took 1694 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 580 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 620 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 656 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 92 reset in 872 ms.
Product exploration explored 100000 steps with 102 reset in 963 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 612 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 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-21 19:54:04] [INFO ] Redundant transitions in 400 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-21 19:54:04] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:54:05] [INFO ] Dead Transitions using invariants and state equation in 716 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 17 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 1178 ms. Remains : 1000/1000 places, 960/961 transitions.
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 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-21 19:54:05] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:54:06] [INFO ] Implicit Places using invariants in 629 ms returned []
[2023-03-21 19:54:06] [INFO ] Invariant cache hit.
[2023-03-21 19:54:07] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2235 ms to find 0 implicit places.
[2023-03-21 19:54:07] [INFO ] Invariant cache hit.
[2023-03-21 19:54:08] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3159 ms. Remains : 1000/1000 places, 961/961 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-14 finished in 93233 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-21 19:54:08] [INFO ] Flatten gal took : 67 ms
[2023-03-21 19:54:08] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-21 19:54:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 963 transitions and 4326 arcs took 20 ms.
Total runtime 506253 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4050/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4050/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4050/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4050/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4050/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-040A-LTLFireability-10
Could not compute solution for formula : ShieldIIPs-PT-040A-LTLFireability-12
Could not compute solution for formula : ShieldIIPs-PT-040A-LTLFireability-13
Could not compute solution for formula : ShieldIIPs-PT-040A-LTLFireability-14
Could not compute solution for formula : ShieldIIPs-PT-040A-LTLFireability-15

BK_STOP 1679428451667

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-040A-LTLFireability-10
ltl formula formula --ltl=/tmp/4050/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1003 places, 963 transitions and 4326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4050/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4050/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.120 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4050/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4050/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x560bbc9263f4]
1: pnml2lts-mc(+0xa2496) [0x560bbc926496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f1715d18140]
3: pnml2lts-mc(+0x405be5) [0x560bbcc89be5]
4: pnml2lts-mc(+0x16b3f9) [0x560bbc9ef3f9]
5: pnml2lts-mc(+0x164ac4) [0x560bbc9e8ac4]
6: pnml2lts-mc(+0x272e0a) [0x560bbcaf6e0a]
7: pnml2lts-mc(+0xb61f0) [0x560bbc93a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f1715b6b4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f1715b6b67a]
10: pnml2lts-mc(+0xa1581) [0x560bbc925581]
11: pnml2lts-mc(+0xa1910) [0x560bbc925910]
12: pnml2lts-mc(+0xa32a2) [0x560bbc9272a2]
13: pnml2lts-mc(+0xa50f4) [0x560bbc9290f4]
14: pnml2lts-mc(+0xa516b) [0x560bbc92916b]
15: pnml2lts-mc(+0x3f34b3) [0x560bbcc774b3]
16: pnml2lts-mc(+0x7c63d) [0x560bbc90063d]
17: pnml2lts-mc(+0x67d86) [0x560bbc8ebd86]
18: pnml2lts-mc(+0x60a8a) [0x560bbc8e4a8a]
19: pnml2lts-mc(+0x5eb15) [0x560bbc8e2b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1715b53d0a]
21: pnml2lts-mc(+0x6075e) [0x560bbc8e475e]
ltl formula name ShieldIIPs-PT-040A-LTLFireability-12
ltl formula formula --ltl=/tmp/4050/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1003 places, 963 transitions and 4326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.100 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4050/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4050/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4050/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4050/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldIIPs-PT-040A-LTLFireability-13
ltl formula formula --ltl=/tmp/4050/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1003 places, 963 transitions and 4326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.150 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4050/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4050/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4050/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4050/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name ShieldIIPs-PT-040A-LTLFireability-14
ltl formula formula --ltl=/tmp/4050/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1003 places, 963 transitions and 4326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.040 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4050/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4050/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4050/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4050/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPs-PT-040A-LTLFireability-15
ltl formula formula --ltl=/tmp/4050/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1003 places, 963 transitions and 4326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.050 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4050/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4050/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4050/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4050/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ltsminxred"
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 ltsminxred"
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 r393-oct2-167903716600132"
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 ;