About the Execution of LoLa+red for ShieldIIPs-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2588.823 | 533888.00 | 638512.00 | 90.10 | FFFFFFFFFFFF???? | normal |
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.r391-oct2-167903714900132.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 lolaxred
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 r391-oct2-167903714900132
=====================================================================
--------------------
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 1679266820053
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:00:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:00:22] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-19 23:00:22] [INFO ] Transformed 1003 places.
[2023-03-19 23:00:22] [INFO ] Transformed 963 transitions.
[2023-03-19 23:00:22] [INFO ] Found NUPN structural information;
[2023-03-19 23:00:22] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 100 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:00:22] [INFO ] Computed 361 place invariants in 24 ms
[2023-03-19 23:00:24] [INFO ] Implicit Places using invariants in 1119 ms returned []
[2023-03-19 23:00:24] [INFO ] Invariant cache hit.
[2023-03-19 23:00:26] [INFO ] Implicit Places using invariants and state equation in 2213 ms returned []
Implicit Place search using SMT with State Equation took 3371 ms to find 0 implicit places.
[2023-03-19 23:00:26] [INFO ] Invariant cache hit.
[2023-03-19 23:00:27] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4330 ms. Remains : 1003/1003 places, 963/963 transitions.
Support contains 58 out of 1003 places after structural reductions.
[2023-03-19 23:00:27] [INFO ] Flatten gal took : 143 ms
[2023-03-19 23:00:27] [INFO ] Flatten gal took : 79 ms
[2023-03-19 23:00:27] [INFO ] Input system was already deterministic with 963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 28) seen :25
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 23:00:28] [INFO ] Invariant cache hit.
[2023-03-19 23:00:28] [INFO ] [Real]Absence check using 361 positive place invariants in 169 ms returned sat
[2023-03-19 23:00:29] [INFO ] After 1239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:00:29] [INFO ] [Nat]Absence check using 361 positive place invariants in 99 ms returned sat
[2023-03-19 23:00:31] [INFO ] After 1392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:00:31] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 6 ms to minimize.
[2023-03-19 23:00:31] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2023-03-19 23:00:32] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 13 ms to minimize.
[2023-03-19 23:00:32] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 33 ms to minimize.
[2023-03-19 23:00:32] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2023-03-19 23:00:32] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 26 ms to minimize.
[2023-03-19 23:00:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1050 ms
[2023-03-19 23:00:32] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-03-19 23:00:33] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 0 ms to minimize.
[2023-03-19 23:00:33] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2023-03-19 23:00:33] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 14 ms to minimize.
[2023-03-19 23:00:33] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2023-03-19 23:00:34] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2023-03-19 23:00:34] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-19 23:00:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1580 ms
[2023-03-19 23:00:34] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-19 23:00:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-19 23:00:34] [INFO ] After 4530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 234 ms.
[2023-03-19 23:00:34] [INFO ] After 5235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 286 ms.
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 6 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 11 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 275 times.
Drop transitions removed 275 transitions
Iterating global reduction 0 with 275 rules applied. Total rules applied 279 place count 1001 transition count 961
Applied a total of 279 rules in 244 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 245 ms. Remains : 1001/1003 places, 961/963 transitions.
Finished random walk after 5847 steps, including 1 resets, run visited all 2 properties in 84 ms. (steps per millisecond=69 )
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 6 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 13 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 123 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-19 23:00:36] [INFO ] Computed 361 place invariants in 11 ms
[2023-03-19 23:00:36] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-19 23:00:36] [INFO ] Invariant cache hit.
[2023-03-19 23:00:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:00:39] [INFO ] Implicit Places using invariants and state equation in 2477 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3220 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 59 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 3403 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 254 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 2131 steps with 0 reset in 41 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-00 finished in 3850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1002 transition count 961
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 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 57 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2023-03-19 23:00:39] [INFO ] Computed 360 place invariants in 10 ms
[2023-03-19 23:00:40] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-19 23:00:40] [INFO ] Invariant cache hit.
[2023-03-19 23:00:42] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
[2023-03-19 23:00:42] [INFO ] Redundant transitions in 266 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-19 23:00:42] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-19 23:00:43] [INFO ] Dead Transitions using invariants and state equation in 656 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 24 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 3301 ms. Remains : 999/1003 places, 959/963 transitions.
Stuttering acceptance computed with spot in 32 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 2003 steps with 0 reset in 20 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-02 finished in 3374 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 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:00:43] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-19 23:00:43] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-19 23:00:43] [INFO ] Invariant cache hit.
[2023-03-19 23:00:45] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
[2023-03-19 23:00:45] [INFO ] Invariant cache hit.
[2023-03-19 23:00:46] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2945 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 116 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 74667 steps with 71 reset in 663 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-05 finished in 3749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(F(p2))&&p1))||(p2&&F(p3)))))'
Support contains 9 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 15 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-19 23:00:47] [INFO ] Invariant cache hit.
[2023-03-19 23:00:47] [INFO ] Implicit Places using invariants in 681 ms returned []
[2023-03-19 23:00:47] [INFO ] Invariant cache hit.
[2023-03-19 23:00:49] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 2320 ms to find 0 implicit places.
[2023-03-19 23:00:49] [INFO ] Invariant cache hit.
[2023-03-19 23:00:50] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3021 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 412 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 1 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-07 finished in 3477 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 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-19 23:00:50] [INFO ] Invariant cache hit.
[2023-03-19 23:00:51] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-19 23:00:51] [INFO ] Invariant cache hit.
[2023-03-19 23:00:52] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
[2023-03-19 23:00:52] [INFO ] Invariant cache hit.
[2023-03-19 23:00:53] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2958 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 187 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 2048 steps with 0 reset in 20 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-08 finished in 3199 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 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-19 23:00:53] [INFO ] Invariant cache hit.
[2023-03-19 23:00:54] [INFO ] Implicit Places using invariants in 665 ms returned []
[2023-03-19 23:00:54] [INFO ] Invariant cache hit.
[2023-03-19 23:00:55] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
[2023-03-19 23:00:55] [INFO ] Invariant cache hit.
[2023-03-19 23:00:56] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2700 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 141 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 555 reset in 783 ms.
Stuttering criterion allowed to conclude after 41213 steps with 225 reset in 413 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-10 finished in 4061 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 44 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-19 23:00:57] [INFO ] Computed 361 place invariants in 8 ms
[2023-03-19 23:00:58] [INFO ] Implicit Places using invariants in 788 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 791 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 30 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 865 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 36 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 2710 steps with 4 reset in 39 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-11 finished in 968 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 23 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:00:58] [INFO ] Computed 361 place invariants in 8 ms
[2023-03-19 23:00:59] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-19 23:00:59] [INFO ] Invariant cache hit.
[2023-03-19 23:01:01] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
[2023-03-19 23:01:01] [INFO ] Invariant cache hit.
[2023-03-19 23:01:01] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3076 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 101 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 25010 reset in 1821 ms.
Product exploration explored 100000 steps with 24970 reset in 1969 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 339 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 175 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 3790 steps, including 1 resets, run visited all 2 properties in 53 ms. (steps per millisecond=71 )
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 249 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 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-19 23:01:06] [INFO ] Invariant cache hit.
[2023-03-19 23:01:07] [INFO ] [Real]Absence check using 361 positive place invariants in 294 ms returned sat
[2023-03-19 23:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:01:09] [INFO ] [Real]Absence check using state equation in 2019 ms returned sat
[2023-03-19 23:01:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:01:10] [INFO ] [Nat]Absence check using 361 positive place invariants in 162 ms returned sat
[2023-03-19 23:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:01:12] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2023-03-19 23:01:12] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2023-03-19 23:01:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-19 23:01:12] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 68 ms.
[2023-03-19 23:01:25] [INFO ] Deduced a trap composed of 3 places in 537 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:01:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 26 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-19 23:01:25] [INFO ] Invariant cache hit.
[2023-03-19 23:01:26] [INFO ] Implicit Places using invariants in 652 ms returned []
[2023-03-19 23:01:26] [INFO ] Invariant cache hit.
[2023-03-19 23:01:27] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2023-03-19 23:01:27] [INFO ] Invariant cache hit.
[2023-03-19 23:01:28] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2594 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 312 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 175 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 1796 steps, including 0 resets, run visited all 2 properties in 43 ms. (steps per millisecond=41 )
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 388 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 176 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-19 23:01:29] [INFO ] Invariant cache hit.
[2023-03-19 23:01:30] [INFO ] [Real]Absence check using 361 positive place invariants in 228 ms returned sat
[2023-03-19 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:01:32] [INFO ] [Real]Absence check using state equation in 2390 ms returned sat
[2023-03-19 23:01:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:01:33] [INFO ] [Nat]Absence check using 361 positive place invariants in 175 ms returned sat
[2023-03-19 23:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:01:35] [INFO ] [Nat]Absence check using state equation in 1377 ms returned sat
[2023-03-19 23:01:35] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-03-19 23:01:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-19 23:01:35] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 93 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java: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-19 23:01:48] [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 276 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 33444 reset in 2278 ms.
Product exploration explored 100000 steps with 33517 reset in 2190 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 147 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 3 ms
Applied a total of 2 rules in 172 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-19 23:01:53] [INFO ] Redundant transitions in 240 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-19 23:01:53] [INFO ] Computed 361 place invariants in 7 ms
[2023-03-19 23:01:54] [INFO ] Dead Transitions using invariants and state equation in 668 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 50 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 1203 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 32 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:01:54] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-19 23:01:55] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-19 23:01:55] [INFO ] Invariant cache hit.
[2023-03-19 23:01:56] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 2058 ms to find 0 implicit places.
[2023-03-19 23:01:56] [INFO ] Invariant cache hit.
[2023-03-19 23:01:57] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3044 ms. Remains : 1003/1003 places, 963/963 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-12 finished in 58912 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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 80 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-19 23:01:57] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-19 23:01:58] [INFO ] Implicit Places using invariants in 681 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 696 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 797 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s754 1) (EQ s769 1)), p0:(NEQ s326 1), p1:(AND (EQ s88 1) (EQ s96 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 81 reset in 876 ms.
Product exploration explored 100000 steps with 80 reset in 937 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 710 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 226 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Finished random walk after 1757 steps, including 0 resets, run visited all 5 properties in 68 ms. (steps per millisecond=25 )
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 777 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 205 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 961 rows 1000 cols
[2023-03-19 23:02:02] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-19 23:02:03] [INFO ] [Real]Absence check using 360 positive place invariants in 223 ms returned sat
[2023-03-19 23:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:02:05] [INFO ] [Real]Absence check using state equation in 2049 ms returned sat
[2023-03-19 23:02:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:02:06] [INFO ] [Nat]Absence check using 360 positive place invariants in 301 ms returned sat
[2023-03-19 23:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:02:08] [INFO ] [Nat]Absence check using state equation in 1685 ms returned sat
[2023-03-19 23:02:08] [INFO ] Computed and/alt/rep : 882/3061/882 causal constraints (skipped 78 transitions) in 77 ms.
[2023-03-19 23:02:21] [INFO ] Deduced a trap composed of 3 places in 523 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: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-19 23:02:21] [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)
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-19 23:02:21] [INFO ] Invariant cache hit.
[2023-03-19 23:02:22] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-19 23:02:22] [INFO ] Invariant cache hit.
[2023-03-19 23:02:23] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2023-03-19 23:02:23] [INFO ] Redundant transitions in 234 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-19 23:02:23] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-19 23:02:24] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3172 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 599 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 234 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Finished random walk after 1769 steps, including 0 resets, run visited all 5 properties in 79 ms. (steps per millisecond=22 )
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 816 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 337 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
[2023-03-19 23:02:27] [INFO ] Invariant cache hit.
[2023-03-19 23:02:28] [INFO ] [Real]Absence check using 360 positive place invariants in 235 ms returned sat
[2023-03-19 23:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:02:30] [INFO ] [Real]Absence check using state equation in 2573 ms returned sat
[2023-03-19 23:02:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:02:31] [INFO ] [Nat]Absence check using 360 positive place invariants in 149 ms returned sat
[2023-03-19 23:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:02:34] [INFO ] [Nat]Absence check using state equation in 2603 ms returned sat
[2023-03-19 23:02:34] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-19 23:02:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-19 23:02:34] [INFO ] Computed and/alt/rep : 882/3066/882 causal constraints (skipped 77 transitions) in 145 ms.
[2023-03-19 23:02:45] [INFO ] Added : 450 causal constraints over 90 iterations in 11201 ms. Result :unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 81 reset in 801 ms.
Product exploration explored 100000 steps with 80 reset in 888 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 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-19 23:02:47] [INFO ] Invariant cache hit.
[2023-03-19 23:02:48] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-19 23:02:48] [INFO ] Invariant cache hit.
[2023-03-19 23:02:49] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
[2023-03-19 23:02:50] [INFO ] Redundant transitions in 404 ms returned []
[2023-03-19 23:02:50] [INFO ] Invariant cache hit.
[2023-03-19 23:02:50] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3185 ms. Remains : 1000/1000 places, 960/960 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-13 finished in 53298 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 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:02:50] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-19 23:02:51] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-19 23:02:51] [INFO ] Invariant cache hit.
[2023-03-19 23:02:53] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
[2023-03-19 23:02:53] [INFO ] Invariant cache hit.
[2023-03-19 23:02:53] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2944 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 461 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 88 reset in 830 ms.
Product exploration explored 100000 steps with 80 reset in 954 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 1449 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 552 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 427 ms. (steps per millisecond=23 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 23:02:58] [INFO ] Invariant cache hit.
[2023-03-19 23:02:59] [INFO ] [Real]Absence check using 361 positive place invariants in 56 ms returned sat
[2023-03-19 23:03:00] [INFO ] After 1183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:03:00] [INFO ] [Nat]Absence check using 361 positive place invariants in 92 ms returned sat
[2023-03-19 23:03:01] [INFO ] After 1391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:03:02] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:03:02] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2023-03-19 23:03:02] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 0 ms to minimize.
[2023-03-19 23:03:02] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2023-03-19 23:03:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1001 ms
[2023-03-19 23:03:03] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-19 23:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-19 23:03:03] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 0 ms to minimize.
[2023-03-19 23:03:03] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-19 23:03:04] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2023-03-19 23:03:04] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2023-03-19 23:03:04] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2023-03-19 23:03:04] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-19 23:03:04] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-19 23:03:05] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:03:05] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 22 ms to minimize.
[2023-03-19 23:03:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2011 ms
[2023-03-19 23:03:05] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2023-03-19 23:03:05] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2023-03-19 23:03:06] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2023-03-19 23:03:06] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2023-03-19 23:03:06] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-19 23:03:06] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2023-03-19 23:03:06] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2023-03-19 23:03:07] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-03-19 23:03:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1557 ms
[2023-03-19 23:03:07] [INFO ] After 6714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 502 ms.
[2023-03-19 23:03:07] [INFO ] After 7707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 602 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 90 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1001/1003 places, 961/963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-19 23:03:08] [INFO ] Computed 361 place invariants in 28 ms
[2023-03-19 23:03:09] [INFO ] [Real]Absence check using 359 positive place invariants in 197 ms returned sat
[2023-03-19 23:03:09] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-19 23:03:09] [INFO ] After 1147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:03:10] [INFO ] [Nat]Absence check using 359 positive place invariants in 99 ms returned sat
[2023-03-19 23:03:10] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:03:11] [INFO ] After 1218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:03:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:03:12] [INFO ] After 596ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 23:03:12] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-19 23:03:12] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 1 ms to minimize.
[2023-03-19 23:03:13] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 1 ms to minimize.
[2023-03-19 23:03:13] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2023-03-19 23:03:13] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 1 ms to minimize.
[2023-03-19 23:03:13] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2023-03-19 23:03:14] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 2 ms to minimize.
[2023-03-19 23:03:14] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2023-03-19 23:03:14] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2023-03-19 23:03:14] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-19 23:03:15] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2023-03-19 23:03:15] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2023-03-19 23:03:15] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 13 ms to minimize.
[2023-03-19 23:03:15] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-19 23:03:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3429 ms
[2023-03-19 23:03:16] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2023-03-19 23:03:16] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2023-03-19 23:03:16] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2023-03-19 23:03:17] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-19 23:03:17] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 0 ms to minimize.
[2023-03-19 23:03:17] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2023-03-19 23:03:17] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 4 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2695 ms
[2023-03-19 23:03:18] [INFO ] After 7261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-19 23:03:19] [INFO ] After 9169ms 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 23 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 24 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:03:19] [INFO ] Invariant cache hit.
[2023-03-19 23:03:19] [INFO ] [Real]Absence check using 359 positive place invariants in 53 ms returned sat
[2023-03-19 23:03:19] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:03:20] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:03:20] [INFO ] [Nat]Absence check using 359 positive place invariants in 61 ms returned sat
[2023-03-19 23:03:20] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:03:21] [INFO ] After 844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:03:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:03:21] [INFO ] After 89ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:03:22] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 0 ms to minimize.
[2023-03-19 23:03:22] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2023-03-19 23:03:22] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-19 23:03:22] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-19 23:03:22] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-19 23:03:23] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 0 ms to minimize.
[2023-03-19 23:03:23] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2023-03-19 23:03:23] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 0 ms to minimize.
[2023-03-19 23:03:23] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-19 23:03:23] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-19 23:03:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2276 ms
[2023-03-19 23:03:24] [INFO ] After 2511ms 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-19 23:03:24] [INFO ] After 3813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 103 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 181872 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181872 steps, saw 153408 distinct states, run finished after 3003 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:03:27] [INFO ] Invariant cache hit.
[2023-03-19 23:03:27] [INFO ] [Real]Absence check using 359 positive place invariants in 80 ms returned sat
[2023-03-19 23:03:27] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-19 23:03:28] [INFO ] After 1052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:03:28] [INFO ] [Nat]Absence check using 359 positive place invariants in 86 ms returned sat
[2023-03-19 23:03:28] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:03:29] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:03:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:03:29] [INFO ] After 139ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:03:30] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 0 ms to minimize.
[2023-03-19 23:03:30] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2023-03-19 23:03:30] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2023-03-19 23:03:30] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-19 23:03:31] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-19 23:03:31] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-19 23:03:31] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2023-03-19 23:03:31] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2023-03-19 23:03:31] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-19 23:03:31] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-19 23:03:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1997 ms
[2023-03-19 23:03:32] [INFO ] After 2226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-19 23:03:32] [INFO ] After 3690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 67 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 1001/1001 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-19 23:03:32] [INFO ] Invariant cache hit.
[2023-03-19 23:03:33] [INFO ] Implicit Places using invariants in 944 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 969 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1005 ms. Remains : 1000/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187051 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187051 steps, saw 155886 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-19 23:03:36] [INFO ] Computed 360 place invariants in 33 ms
[2023-03-19 23:03:36] [INFO ] [Real]Absence check using 358 positive place invariants in 135 ms returned sat
[2023-03-19 23:03:36] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:03:37] [INFO ] After 1191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:03:37] [INFO ] [Nat]Absence check using 358 positive place invariants in 78 ms returned sat
[2023-03-19 23:03:37] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-19 23:03:39] [INFO ] After 1632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:03:39] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-03-19 23:03:40] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2023-03-19 23:03:40] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2023-03-19 23:03:40] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-19 23:03:40] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2023-03-19 23:03:41] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
[2023-03-19 23:03:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1361 ms
[2023-03-19 23:03:41] [INFO ] After 3115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-19 23:03:41] [INFO ] After 3612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 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 25 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 35 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-19 23:03:41] [INFO ] Invariant cache hit.
[2023-03-19 23:03:42] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-19 23:03:42] [INFO ] Invariant cache hit.
[2023-03-19 23:03:44] [INFO ] Implicit Places using invariants and state equation in 1968 ms returned []
Implicit Place search using SMT with State Equation took 2772 ms to find 0 implicit places.
[2023-03-19 23:03:44] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-19 23:03:44] [INFO ] Invariant cache hit.
[2023-03-19 23:03:45] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3931 ms. Remains : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:03:45] [INFO ] Invariant cache hit.
[2023-03-19 23:03:45] [INFO ] [Real]Absence check using 358 positive place invariants in 113 ms returned sat
[2023-03-19 23:03:45] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-19 23:03:46] [INFO ] After 1074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:03:46] [INFO ] [Nat]Absence check using 358 positive place invariants in 61 ms returned sat
[2023-03-19 23:03:46] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:03:47] [INFO ] After 1228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:03:48] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 0 ms to minimize.
[2023-03-19 23:03:48] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-19 23:03:48] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 17 ms to minimize.
[2023-03-19 23:03:48] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2023-03-19 23:03:49] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2023-03-19 23:03:49] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-19 23:03:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1510 ms
[2023-03-19 23:03:49] [INFO ] After 2824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 463 ms.
[2023-03-19 23:03:50] [INFO ] After 3603ms 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 1567 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 662 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:03:52] [INFO ] Computed 361 place invariants in 7 ms
[2023-03-19 23:03:53] [INFO ] Implicit Places using invariants in 672 ms returned []
[2023-03-19 23:03:53] [INFO ] Invariant cache hit.
[2023-03-19 23:03:55] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
[2023-03-19 23:03:55] [INFO ] Invariant cache hit.
[2023-03-19 23:03:55] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3087 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 1261 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 602 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 445 ms. (steps per millisecond=22 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 23:03:58] [INFO ] Invariant cache hit.
[2023-03-19 23:03:58] [INFO ] [Real]Absence check using 361 positive place invariants in 58 ms returned sat
[2023-03-19 23:03:59] [INFO ] After 1160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:04:00] [INFO ] [Nat]Absence check using 361 positive place invariants in 189 ms returned sat
[2023-03-19 23:04:02] [INFO ] After 1888ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:04:02] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-03-19 23:04:02] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2023-03-19 23:04:03] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 9 ms to minimize.
[2023-03-19 23:04:03] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2023-03-19 23:04:03] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2023-03-19 23:04:03] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 0 ms to minimize.
[2023-03-19 23:04:03] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2023-03-19 23:04:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1344 ms
[2023-03-19 23:04:04] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2023-03-19 23:04:04] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2023-03-19 23:04:04] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2023-03-19 23:04:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 550 ms
[2023-03-19 23:04:04] [INFO ] After 4304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1216 ms.
[2023-03-19 23:04:06] [INFO ] After 6197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 542 ms.
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 276 times.
Drop transitions removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 280 place count 1001 transition count 961
Applied a total of 280 rules in 53 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1001/1003 places, 961/963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-19 23:04:06] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-19 23:04:07] [INFO ] [Real]Absence check using 359 positive place invariants in 60 ms returned sat
[2023-03-19 23:04:07] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:04:07] [INFO ] After 864ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:04:08] [INFO ] [Nat]Absence check using 359 positive place invariants in 91 ms returned sat
[2023-03-19 23:04:08] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-19 23:04:08] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:04:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:04:08] [INFO ] After 269ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:04:09] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2023-03-19 23:04:09] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 0 ms to minimize.
[2023-03-19 23:04:09] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2023-03-19 23:04:09] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-19 23:04:10] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:04:10] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2023-03-19 23:04:10] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-19 23:04:10] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-19 23:04:10] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-19 23:04:10] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-19 23:04:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1680 ms
[2023-03-19 23:04:10] [INFO ] After 2066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 445 ms.
[2023-03-19 23:04:11] [INFO ] After 3516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 54 ms.
Support contains 7 out of 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 30 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 43 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 180386 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180386 steps, saw 152603 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:04:14] [INFO ] Invariant cache hit.
[2023-03-19 23:04:14] [INFO ] [Real]Absence check using 359 positive place invariants in 122 ms returned sat
[2023-03-19 23:04:14] [INFO ] [Real]Absence check using 359 positive and 2 generalized place invariants in 40 ms returned sat
[2023-03-19 23:04:15] [INFO ] After 1201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:04:16] [INFO ] [Nat]Absence check using 359 positive place invariants in 102 ms returned sat
[2023-03-19 23:04:16] [INFO ] [Nat]Absence check using 359 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:04:16] [INFO ] After 829ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:04:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:04:17] [INFO ] After 646ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:04:17] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 0 ms to minimize.
[2023-03-19 23:04:18] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-19 23:04:18] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2023-03-19 23:04:18] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-19 23:04:18] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 0 ms to minimize.
[2023-03-19 23:04:19] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2023-03-19 23:04:19] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2023-03-19 23:04:19] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-19 23:04:19] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2023-03-19 23:04:19] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2023-03-19 23:04:19] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-19 23:04:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2147 ms
[2023-03-19 23:04:19] [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 939 ms.
[2023-03-19 23:04:20] [INFO ] After 5078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 151 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 20 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 20 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 19 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-19 23:04:21] [INFO ] Invariant cache hit.
[2023-03-19 23:04:21] [INFO ] Implicit Places using invariants in 727 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 729 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 765 ms. Remains : 1000/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 194564 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194564 steps, saw 159917 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-19 23:04:24] [INFO ] Computed 360 place invariants in 11 ms
[2023-03-19 23:04:25] [INFO ] [Real]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-19 23:04:25] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-19 23:04:25] [INFO ] After 980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:04:26] [INFO ] [Nat]Absence check using 358 positive place invariants in 54 ms returned sat
[2023-03-19 23:04:26] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-19 23:04:27] [INFO ] After 1147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:04:28] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-19 23:04:28] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-19 23:04:28] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-19 23:04:28] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 0 ms to minimize.
[2023-03-19 23:04:29] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 1 ms to minimize.
[2023-03-19 23:04:29] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-19 23:04:29] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2023-03-19 23:04:29] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-19 23:04:30] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-19 23:04:30] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-19 23:04:31] [INFO ] Deduced a trap composed of 15 places in 338 ms of which 0 ms to minimize.
[2023-03-19 23:04:31] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2023-03-19 23:04:31] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-19 23:04:31] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2023-03-19 23:04:31] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2023-03-19 23:04:32] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-19 23:04:32] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 1 ms to minimize.
[2023-03-19 23:04:32] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-19 23:04:32] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2023-03-19 23:04:33] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2023-03-19 23:04:33] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2023-03-19 23:04:33] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-19 23:04:33] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-19 23:04:33] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-19 23:04:33] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-19 23:04:34] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6017 ms
[2023-03-19 23:04:34] [INFO ] After 7839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 381 ms.
[2023-03-19 23:04:34] [INFO ] After 8543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 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 35 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 35 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 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-19 23:04:34] [INFO ] Invariant cache hit.
[2023-03-19 23:04:35] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-19 23:04:35] [INFO ] Invariant cache hit.
[2023-03-19 23:04:37] [INFO ] Implicit Places using invariants and state equation in 2093 ms returned []
Implicit Place search using SMT with State Equation took 2844 ms to find 0 implicit places.
[2023-03-19 23:04:37] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 23:04:37] [INFO ] Invariant cache hit.
[2023-03-19 23:04:38] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3723 ms. Remains : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 34 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:04:38] [INFO ] Invariant cache hit.
[2023-03-19 23:04:38] [INFO ] [Real]Absence check using 358 positive place invariants in 104 ms returned sat
[2023-03-19 23:04:38] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:04:39] [INFO ] After 1125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:04:39] [INFO ] [Nat]Absence check using 358 positive place invariants in 91 ms returned sat
[2023-03-19 23:04:39] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 23:04:40] [INFO ] After 842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:04:40] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-19 23:04:41] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-19 23:04:41] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2023-03-19 23:04:41] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 0 ms to minimize.
[2023-03-19 23:04:42] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 2 ms to minimize.
[2023-03-19 23:04:42] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 1 ms to minimize.
[2023-03-19 23:04:42] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2023-03-19 23:04:42] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-03-19 23:04:43] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:04:43] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-19 23:04:43] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-19 23:04:43] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-19 23:04:43] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 20 ms to minimize.
[2023-03-19 23:04:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3126 ms
[2023-03-19 23:04:43] [INFO ] After 4044ms 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-19 23:04:44] [INFO ] After 4594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 17 factoid took 1485 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 623 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 667 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 734 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 96 reset in 835 ms.
Product exploration explored 100000 steps with 103 reset in 992 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
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 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 4 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 53 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-19 23:04:50] [INFO ] Redundant transitions in 275 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-19 23:04:50] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-19 23:04:51] [INFO ] Dead Transitions using invariants and state equation in 698 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 24 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 1057 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 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-19 23:04:51] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-19 23:04:51] [INFO ] Implicit Places using invariants in 609 ms returned []
[2023-03-19 23:04:51] [INFO ] Invariant cache hit.
[2023-03-19 23:04:53] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
[2023-03-19 23:04:53] [INFO ] Invariant cache hit.
[2023-03-19 23:04:54] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3034 ms. Remains : 1003/1003 places, 963/963 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-14 finished in 123367 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 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 50 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-19 23:04:54] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-19 23:04:54] [INFO ] Implicit Places using invariants in 627 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 629 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 697 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-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 731 ms.
Product exploration explored 100000 steps with 52 reset in 952 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 220 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 142 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1868 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=56 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 304 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 147 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 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 44 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-19 23:04:57] [INFO ] Computed 360 place invariants in 6 ms
[2023-03-19 23:04:58] [INFO ] Implicit Places using invariants in 712 ms returned []
[2023-03-19 23:04:58] [INFO ] Invariant cache hit.
[2023-03-19 23:05:00] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
[2023-03-19 23:05:00] [INFO ] Redundant transitions in 191 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-19 23:05:00] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-19 23:05:00] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3157 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 110 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 117 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1887 steps, including 0 resets, run visited all 1 properties in 38 ms. (steps per millisecond=49 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 212 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 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 52 reset in 868 ms.
Product exploration explored 100000 steps with 52 reset in 933 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 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-19 23:05:03] [INFO ] Invariant cache hit.
[2023-03-19 23:05:04] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-03-19 23:05:04] [INFO ] Invariant cache hit.
[2023-03-19 23:05:05] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
[2023-03-19 23:05:06] [INFO ] Redundant transitions in 225 ms returned []
[2023-03-19 23:05:06] [INFO ] Invariant cache hit.
[2023-03-19 23:05:06] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3119 ms. Remains : 1000/1000 places, 960/960 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-15 finished in 12578 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))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-040A-LTLFireability-12
Stuttering acceptance computed with spot in 186 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 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 58 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2023-03-19 23:05:07] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-19 23:05:07] [INFO ] Implicit Places using invariants in 761 ms returned []
[2023-03-19 23:05:07] [INFO ] Invariant cache hit.
[2023-03-19 23:05:09] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
[2023-03-19 23:05:09] [INFO ] Invariant cache hit.
[2023-03-19 23:05:10] [INFO ] Dead Transitions using invariants and state equation in 618 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 3010 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 24960 reset in 722 ms.
Product exploration explored 100000 steps with 25072 reset in 947 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 372 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 200 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 2043 steps, including 0 resets, run visited all 2 properties in 44 ms. (steps per millisecond=46 )
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 319 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 209 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-19 23:05:13] [INFO ] Invariant cache hit.
[2023-03-19 23:05:14] [INFO ] [Real]Absence check using 360 positive place invariants in 228 ms returned sat
[2023-03-19 23:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:05:16] [INFO ] [Real]Absence check using state equation in 1967 ms returned sat
[2023-03-19 23:05:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:05:17] [INFO ] [Nat]Absence check using 360 positive place invariants in 147 ms returned sat
[2023-03-19 23:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:05:19] [INFO ] [Nat]Absence check using state equation in 1869 ms returned sat
[2023-03-19 23:05:19] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2023-03-19 23:05:19] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-19 23:05:19] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2023-03-19 23:05:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 399 ms
[2023-03-19 23:05:19] [INFO ] Computed and/alt/rep : 959/2392/959 causal constraints (skipped 0 transitions) in 57 ms.
[2023-03-19 23:05:32] [INFO ] Deduced a trap composed of 2 places in 816 ms of which 27 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.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-19 23:05:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 out of 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 19 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-19 23:05:32] [INFO ] Invariant cache hit.
[2023-03-19 23:05:32] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-19 23:05:32] [INFO ] Invariant cache hit.
[2023-03-19 23:05:34] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2023-03-19 23:05:34] [INFO ] Invariant cache hit.
[2023-03-19 23:05:35] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2920 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 217 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 167 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 3883 steps, including 1 resets, run visited all 2 properties in 64 ms. (steps per millisecond=60 )
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 487 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 227 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-19 23:05:36] [INFO ] Invariant cache hit.
[2023-03-19 23:05:37] [INFO ] [Real]Absence check using 360 positive place invariants in 244 ms returned sat
[2023-03-19 23:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:05:39] [INFO ] [Real]Absence check using state equation in 2055 ms returned sat
[2023-03-19 23:05:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:05:41] [INFO ] [Nat]Absence check using 360 positive place invariants in 157 ms returned sat
[2023-03-19 23:05:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:05:42] [INFO ] [Nat]Absence check using state equation in 1431 ms returned sat
[2023-03-19 23:05:42] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2023-03-19 23:05:42] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2023-03-19 23:05:42] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2023-03-19 23:05:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 508 ms
[2023-03-19 23:05:43] [INFO ] Computed and/alt/rep : 959/2392/959 causal constraints (skipped 0 transitions) in 117 ms.
[2023-03-19 23:05:54] [INFO ] Added : 425 causal constraints over 85 iterations in 11847 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 33336 reset in 952 ms.
Product exploration explored 100000 steps with 33311 reset in 941 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 183 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 42 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2023-03-19 23:05:57] [INFO ] Redundant transitions in 174 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-19 23:05:57] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-19 23:05:58] [INFO ] Dead Transitions using invariants and state equation in 628 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 877 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-19 23:05:58] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-19 23:05:58] [INFO ] Implicit Places using invariants in 609 ms returned []
[2023-03-19 23:05:58] [INFO ] Invariant cache hit.
[2023-03-19 23:06:00] [INFO ] Implicit Places using invariants and state equation in 1438 ms returned []
Implicit Place search using SMT with State Equation took 2048 ms to find 0 implicit places.
[2023-03-19 23:06:00] [INFO ] Invariant cache hit.
[2023-03-19 23:06:00] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2857 ms. Remains : 999/999 places, 960/960 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-12 finished in 54193 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 695 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 106 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-19 23:06:02] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-19 23:06:02] [INFO ] Implicit Places using invariants in 596 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 598 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 722 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 104 reset in 802 ms.
Product exploration explored 100000 steps with 95 reset in 934 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 1385 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 639 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 365 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 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-19 23:06:07] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-19 23:06:07] [INFO ] [Real]Absence check using 360 positive place invariants in 77 ms returned sat
[2023-03-19 23:06:08] [INFO ] After 1207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:06:08] [INFO ] [Nat]Absence check using 360 positive place invariants in 91 ms returned sat
[2023-03-19 23:06:10] [INFO ] After 1984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:06:11] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2023-03-19 23:06:11] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-19 23:06:11] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-19 23:06:11] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2023-03-19 23:06:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 642 ms
[2023-03-19 23:06:11] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-19 23:06:12] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-19 23:06:12] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-19 23:06:12] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2023-03-19 23:06:12] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-19 23:06:12] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-19 23:06:13] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2023-03-19 23:06:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1433 ms
[2023-03-19 23:06:13] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-19 23:06:13] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2023-03-19 23:06:14] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2023-03-19 23:06:14] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 0 ms to minimize.
[2023-03-19 23:06:14] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2023-03-19 23:06:14] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-19 23:06:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1136 ms
[2023-03-19 23:06:14] [INFO ] After 5890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 466 ms.
[2023-03-19 23:06:15] [INFO ] After 6830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 544 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 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-19 23:06:16] [INFO ] Computed 360 place invariants in 12 ms
[2023-03-19 23:06:16] [INFO ] [Real]Absence check using 358 positive place invariants in 53 ms returned sat
[2023-03-19 23:06:16] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:06:16] [INFO ] After 902ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:06:17] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2023-03-19 23:06:17] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-19 23:06:18] [INFO ] After 1665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:06:19] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2023-03-19 23:06:19] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2023-03-19 23:06:19] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2023-03-19 23:06:19] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-19 23:06:19] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2023-03-19 23:06:20] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-19 23:06:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1055 ms
[2023-03-19 23:06:20] [INFO ] After 2842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-19 23:06:20] [INFO ] After 3365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 209728 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209728 steps, saw 166851 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:06:23] [INFO ] Invariant cache hit.
[2023-03-19 23:06:23] [INFO ] [Real]Absence check using 358 positive place invariants in 97 ms returned sat
[2023-03-19 23:06:23] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:06:24] [INFO ] After 857ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:06:24] [INFO ] [Nat]Absence check using 358 positive place invariants in 80 ms returned sat
[2023-03-19 23:06:24] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:06:25] [INFO ] After 1248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:06:26] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-19 23:06:26] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 1 ms to minimize.
[2023-03-19 23:06:26] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2023-03-19 23:06:26] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2023-03-19 23:06:27] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-19 23:06:27] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-19 23:06:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1149 ms
[2023-03-19 23:06:27] [INFO ] After 2490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 451 ms.
[2023-03-19 23:06:27] [INFO ] After 3299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 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 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-19 23:06:27] [INFO ] Invariant cache hit.
[2023-03-19 23:06:28] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-19 23:06:28] [INFO ] Invariant cache hit.
[2023-03-19 23:06:30] [INFO ] Implicit Places using invariants and state equation in 1840 ms returned []
Implicit Place search using SMT with State Equation took 2712 ms to find 0 implicit places.
[2023-03-19 23:06:30] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-19 23:06:30] [INFO ] Invariant cache hit.
[2023-03-19 23:06:31] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3496 ms. Remains : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:06:31] [INFO ] Invariant cache hit.
[2023-03-19 23:06:31] [INFO ] [Real]Absence check using 358 positive place invariants in 51 ms returned sat
[2023-03-19 23:06:31] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:06:31] [INFO ] After 688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:06:32] [INFO ] [Nat]Absence check using 358 positive place invariants in 67 ms returned sat
[2023-03-19 23:06:32] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:06:33] [INFO ] After 1228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:06:33] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2023-03-19 23:06:33] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2023-03-19 23:06:34] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2023-03-19 23:06:34] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-19 23:06:34] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-03-19 23:06:34] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-19 23:06:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1447 ms
[2023-03-19 23:06:35] [INFO ] After 2772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 460 ms.
[2023-03-19 23:06:35] [INFO ] After 3513ms 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 1507 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 667 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 679 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 28 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-19 23:06:38] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-19 23:06:39] [INFO ] Implicit Places using invariants in 646 ms returned []
[2023-03-19 23:06:39] [INFO ] Invariant cache hit.
[2023-03-19 23:06:40] [INFO ] Implicit Places using invariants and state equation in 1582 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2023-03-19 23:06:40] [INFO ] Invariant cache hit.
[2023-03-19 23:06:41] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2987 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 938 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 560 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 290 ms. (steps per millisecond=34 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 61 ms. (steps per millisecond=163 ) 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-19 23:06:43] [INFO ] Invariant cache hit.
[2023-03-19 23:06:43] [INFO ] [Real]Absence check using 360 positive place invariants in 96 ms returned sat
[2023-03-19 23:06:44] [INFO ] After 1287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:06:45] [INFO ] [Nat]Absence check using 360 positive place invariants in 97 ms returned sat
[2023-03-19 23:06:46] [INFO ] After 1303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:06:46] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2023-03-19 23:06:47] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 1 ms to minimize.
[2023-03-19 23:06:47] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-19 23:06:47] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-19 23:06:47] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-19 23:06:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1030 ms
[2023-03-19 23:06:47] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 14 ms to minimize.
[2023-03-19 23:06:48] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:06:48] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-03-19 23:06:48] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-19 23:06:48] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2023-03-19 23:06:48] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-19 23:06:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 999 ms
[2023-03-19 23:06:49] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2023-03-19 23:06:49] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-19 23:06:49] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2023-03-19 23:06:49] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2023-03-19 23:06:49] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2023-03-19 23:06:49] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 4 ms to minimize.
[2023-03-19 23:06:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1159 ms
[2023-03-19 23:06:50] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-19 23:06:50] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 0 ms to minimize.
[2023-03-19 23:06:50] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2023-03-19 23:06:50] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2023-03-19 23:06:51] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-19 23:06:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1019 ms
[2023-03-19 23:06:51] [INFO ] After 6004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 507 ms.
[2023-03-19 23:06:51] [INFO ] After 6968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 613 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Partial Free-agglomeration rule applied 276 times.
Drop transitions removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 276 place count 1000 transition count 961
Applied a total of 276 rules in 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1000/1000 places, 961/961 transitions.
Finished random walk after 6023 steps, including 1 resets, run visited all 4 properties in 144 ms. (steps per millisecond=41 )
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 1544 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 720 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 754 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 692 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 841 ms.
Product exploration explored 100000 steps with 88 reset in 918 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 617 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 42 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-19 23:06:59] [INFO ] Redundant transitions in 177 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-19 23:06:59] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-19 23:06:59] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1019 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 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-19 23:06:59] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-19 23:07:00] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-19 23:07:00] [INFO ] Invariant cache hit.
[2023-03-19 23:07:02] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2230 ms to find 0 implicit places.
[2023-03-19 23:07:02] [INFO ] Invariant cache hit.
[2023-03-19 23:07:02] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2938 ms. Remains : 1000/1000 places, 961/961 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-14 finished in 61638 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-19 23:07:02] [INFO ] Flatten gal took : 86 ms
[2023-03-19 23:07:02] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 23:07:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 963 transitions and 4326 arcs took 9 ms.
Total runtime 400646 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-040A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
LTLFireability
BK_STOP 1679267353941
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldIIPs-PT-040A-LTLFireability-14
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/900 5/32 ShieldIIPs-PT-040A-LTLFireability-14 312293 m, 62458 m/sec, 1132214 t fired, .
Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/900 9/32 ShieldIIPs-PT-040A-LTLFireability-14 603134 m, 58168 m/sec, 2332796 t fired, .
Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/900 12/32 ShieldIIPs-PT-040A-LTLFireability-14 874606 m, 54294 m/sec, 3514362 t fired, .
Time elapsed: 15 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/900 16/32 ShieldIIPs-PT-040A-LTLFireability-14 1163639 m, 57806 m/sec, 4689652 t fired, .
Time elapsed: 20 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/900 20/32 ShieldIIPs-PT-040A-LTLFireability-14 1432567 m, 53785 m/sec, 5890767 t fired, .
Time elapsed: 25 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/900 23/32 ShieldIIPs-PT-040A-LTLFireability-14 1692495 m, 51985 m/sec, 7099983 t fired, .
Time elapsed: 30 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/900 27/32 ShieldIIPs-PT-040A-LTLFireability-14 1957398 m, 52980 m/sec, 8314654 t fired, .
Time elapsed: 35 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/900 30/32 ShieldIIPs-PT-040A-LTLFireability-14 2204761 m, 49472 m/sec, 9539431 t fired, .
Time elapsed: 40 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for ShieldIIPs-PT-040A-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPs-PT-040A-LTLFireability-12
lola: time limit : 1185 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1185 8/32 ShieldIIPs-PT-040A-LTLFireability-12 454732 m, 90946 m/sec, 1221175 t fired, .
Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1185 16/32 ShieldIIPs-PT-040A-LTLFireability-12 910470 m, 91147 m/sec, 2493930 t fired, .
Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1185 23/32 ShieldIIPs-PT-040A-LTLFireability-12 1298809 m, 77667 m/sec, 3701498 t fired, .
Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1185 29/32 ShieldIIPs-PT-040A-LTLFireability-12 1697933 m, 79824 m/sec, 4925567 t fired, .
Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for ShieldIIPs-PT-040A-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldIIPs-PT-040A-LTLFireability-15
lola: time limit : 1765 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1765 13/32 ShieldIIPs-PT-040A-LTLFireability-15 684361 m, 136872 m/sec, 1055894 t fired, .
Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1765 26/32 ShieldIIPs-PT-040A-LTLFireability-15 1358498 m, 134827 m/sec, 2093681 t fired, .
Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for ShieldIIPs-PT-040A-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPs-PT-040A-LTLFireability-13
lola: time limit : 3515 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3515 5/32 ShieldIIPs-PT-040A-LTLFireability-13 660447 m, 132089 m/sec, 1028683 t fired, .
Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3515 9/32 ShieldIIPs-PT-040A-LTLFireability-13 1257529 m, 119416 m/sec, 2037666 t fired, .
Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3515 13/32 ShieldIIPs-PT-040A-LTLFireability-13 1859801 m, 120454 m/sec, 3052428 t fired, .
Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3515 17/32 ShieldIIPs-PT-040A-LTLFireability-13 2444291 m, 116898 m/sec, 4042543 t fired, .
Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3515 21/32 ShieldIIPs-PT-040A-LTLFireability-13 2997811 m, 110704 m/sec, 4944204 t fired, .
Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3515 24/32 ShieldIIPs-PT-040A-LTLFireability-13 3547722 m, 109982 m/sec, 5835785 t fired, .
Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3515 28/32 ShieldIIPs-PT-040A-LTLFireability-13 4101479 m, 110751 m/sec, 6738534 t fired, .
Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3515 32/32 ShieldIIPs-PT-040A-LTLFireability-13 4647658 m, 109235 m/sec, 7627129 t fired, .
Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for ShieldIIPs-PT-040A-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-040A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-040A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-040A-LTLFireability-12: LTL unknown AGGR
ShieldIIPs-PT-040A-LTLFireability-13: LTL unknown AGGR
ShieldIIPs-PT-040A-LTLFireability-14: LTL unknown AGGR
ShieldIIPs-PT-040A-LTLFireability-15: LTL unknown AGGR
Time elapsed: 130 secs. Pages in use: 32
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="lolaxred"
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 lolaxred"
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 r391-oct2-167903714900132"
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 '
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 ;